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
Read a column of numbers and interpolate missing data
618 Solvers
878 Solvers
Sum all integers from 1 to 2^n
5702 Solvers
Vectorize the digits of an Integer
229 Solvers
236 Solvers
Tags