More information about strong primes on Wikipedia
isStrongPrime(11) = 1;
isStrongPrime(2) = 0;
isStrongPrime(9) = 0;
isStrongPrime(227) = 1;
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers27
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6695 Solvers
-
Permute diagonal and antidiagonal
504 Solvers
-
385 Solvers
-
406 Solvers
-
Number of Even Elements in Fibonacci Sequence
1639 Solvers
More from this Author92
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!