Finding a Prime Using Sin Function

Question

To find if n is prime, take the square root of n, called m. Let O be the set of primes less than or equal to m. For every element o in O, let y = sin⁡(πx/o), for all real numbers x from zero to n. So that an integer less than or equal to n, will have a zero if and only if that integer is composite, or the first zero in the function and prime. If none of the functions of y equal zero for any o at n, then n is prime. Does this work as a way to find primes?