• Freeflows
  • Problems
    • Sign in
    Prime Testing Count

    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?

    • 1
    • 2
    • 3
    • +
    • 4
    • 5
    • 6
    • -
    • 7
    • 8
    • 9
    • $\frac{a}{b}$
    • .
    • 0
    • =
    • %
    • $a^n$
    • $a^{\circ}$
    • $a_n$
    • $\sqrt{}$
    • $\sqrt[n]{}$
    • $\pi$
    • $\ln{}$
    • $\log$
    • $\theta$
    • $\sin{}$
    • $\cos{}$
    • $\tan{}$
    • $($
    • $)$
    • $[$
    • $]$
    • $\cap$
    • $\cup$
    • $,$
    • $\infty$

    Sign in to save your progress!