Given an vector x of integer numbers, find the element of x that has the most primes less than it.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers72
Suggested Problems
-
Project Euler: Problem 10, Sum of Primes
2121 Solvers
-
574 Solvers
-
12030 Solvers
-
295 Solvers
-
Finding perimeter of a rectangle
496 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
It can be an interesting problem but as of now it can be passed by using max()