AKS test for primes: Difference between revisions
Content added Content deleted
(Ada version) |
|||
Line 3,820: | Line 3,820: | ||
=={{header|Rust}}== |
=={{header|Rust}}== |
||
<lang rust> |
<lang rust>fn aks_coefficients(k: usize) -> Vec<i64> { |
||
⚫ | |||
fn aks_coefficients(k: usize) -> Vec<i64> { |
|||
⚫ | |||
coefficients[0] = 1; |
coefficients[0] = 1; |
||
for i in 1..(k + 1) { |
for i in 1..(k + 1) { |
||
Line 3,840: | Line 3,838: | ||
} else { |
} else { |
||
let c = aks_coefficients(p); |
let c = aks_coefficients(p); |
||
(1 |
(1..p / 2 + 1).all(|i| c[i] % p as i64 == 0) |
||
} |
} |
||
} |
} |
||
Line 3,848: | Line 3,846: | ||
println!("{}: {:?}", i, aks_coefficients(i)); |
println!("{}: {:?}", i, aks_coefficients(i)); |
||
} |
} |
||
for i in (1.. |
for i in (1..=50).filter(|&i| is_prime(i)) { |
||
print!("{} ", i); |
print!("{} ", i); |
||
} |
} |