benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / 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 d…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

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 20032003 is prime?
Plain-text mathematical notation (without MathML)
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?
Original LaTeX notation
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?

level

Level 3

type

Number Theory

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
3dcfd7c4-6a02-5591-ac51-119c126b84d5
task_key
number~5ftheory--test--3dcfd7c4-6a02-5591-ac51-119c126b84d5
task_revision_id
1
config / split
number_theory / test

Official source

initial import