Find the modulo of sum of square of first n primes with 24.
Example:
For n = 1, mod(2^2,24) = 4
For n = 2, mod(2^2 + 3^2,24) = 13
For n = 4, mod(2^2 + 3^2 + 5^2 + 7^2,24) = 15
Note: n can be very large.
Hint : refer tag or check the modulo of square of primes(greater than 3) with 24 to observe the pattern
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers19
Suggested Problems
-
Maximum running product for a string of numbers
2253 Solvers
-
How to find the position of an element in a vector without using the find function
2812 Solvers
-
227 Solvers
-
3391 Solvers
-
842 Solvers
More from this Author5
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
