To determine whether a number $\textit{N}$ is prime, we must test for divisibility by every prime less than or equal to the square root of $\textit{N}$. How many primes must we test to determine whether $2003$ is prime?
<|im_start|>system
You are a helpful assistant.<|im_end|>
<|im_start|>user
To determine whether a number $\textit{N}$ is prime, we must test for divisibility by every prime less than or equal to the square root of $\textit{N}$. How many primes must we test to determine whether $2003$ is prime?
Please reason step by step, and put your final answer within \boxed{{}}.<|im_end|>
<|im_start|>assistant

user
14
To determine whether a number $\textit{N}$ is prime, we must test for divisibility by every prime less than or equal to the square root of $\textit{N}$. How many primes must we test to determine whether $2003$ is prime?
train