Find prime n such that reversed n is also prime: Difference between revisions
Content added Content deleted
Thundergnat (talk | contribs) m (syntax highlighting fixup automation) |
No edit summary |
||
Line 1,291: | Line 1,291: | ||
found 34 primes |
found 34 primes |
||
done... |
done... |
||
</pre> |
|||
=={{header|Rust}}== |
|||
<syntaxhighlight lang="Rust"> |
|||
use prime_tools ; |
|||
fn myreverse( n : u32 ) -> u32 { |
|||
let forward : String = n.to_string( ) ; |
|||
let numberstring = &forward[..] ; |
|||
let mut reversed : String = String::new( ) ; |
|||
for c in numberstring.chars( ).rev( ) { |
|||
reversed.push( c ) ; |
|||
} |
|||
*&reversed[..].parse::<u32>( ).unwrap( ) |
|||
} |
|||
fn main() { |
|||
let mut reversible_primes : Vec<u32> = Vec::new( ) ; |
|||
for num in 2..=500 { |
|||
if prime_tools::is_u32_prime( num ) && prime_tools::is_u32_prime( |
|||
myreverse( num )) { |
|||
reversible_primes.push( num ) ; |
|||
} |
|||
} |
|||
println!("{:?}" , reversible_primes ) ; |
|||
}</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
[2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, 97, 101, 107, 113, 131, 149, 151, 157, 167, 179, 181, 191, 199, 311, 313, 337, 347, 353, 359, 373, 383, 389] |
|||
</pre> |
</pre> |
||