My professor has given a sequence of N numbers as a1, a2, ..., aN and asked me to find the smallest possible value of ai * aj such that it is a prime number, where 1 <= i < j <= N.
If it's possible to find any value of ai * aj such that it is a prime number, then print the smallest value of such ai * aj, otherwise print -1.
x=[1 2 3] y = 2
x=[5 5 5 2] y = -1
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers35
Suggested Problems
-
Number of 1s in the Binary Representation of a Number
483 Solvers
-
755 Solvers
-
Rounding off numbers to n decimals
5726 Solvers
-
Find the index of n in magic(n)
273 Solvers
-
Find out sum and carry of Binary adder
1771 Solvers
More from this Author2
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!