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 Solvers30
Suggested Problems
-
Project Euler: Problem 1, Multiples of 3 and 5
3708 Solvers
-
327 Solvers
-
1849 Solvers
-
1740 Solvers
-
Given a number N, find the smallest prime P>N
282 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!