Solo2 opens in week10 and covers10/11, worth5%; three solo assignments total15%. Its configured calendar determines the deadline. It is not the old7.5% big-integer project.

Entry	Function	Required method
`w10-primes-brute`	`count_primes_brute(n: int) -> int`	Try factors2 through candidate−1
`w10-primes-sqrt`	`count_primes_sqrt(n: int) -> int`	Stop at d²>candidate
`w10-primes-6k`	`count_primes_6k(n: int) -> int`	Handle2/3, then6k±1 factors
`w10-primes-sieve`	`count_primes_sieve(n: int) -> int`	Eratosthenes marking
`w10-primes-mr`	`count_primes_mr(n: int) -> int`	Bounded-domain Miller–Rabin

Count primes 0≤p<n for0≤n≤100000. Values≤2 return0; negative n raises ValueError. Larger inputs are not required. Examples: n=0/2→0, n=3→1, n=10→4. Return an integer without printing.

MR handles values below2,2/3 and other even values before bases2,3 on remaining odds. The known deterministic bound below1,373,653 covers candidates below100000. This is not a determinism claim for arbitrary integers. L11 and assignment material develop decomposition/modular exponentiation and the other algorithms; establish interfaces and evidence now rather than requiring untaught implementations immediately.

Each method entry carries16 automatic raw points. The staff report carries20;100 raw points normalize to this assignment’s5%. Tests primarily check results/edges; staff inspect sources and records for genuinely different methods. Do not wrap one algorithm five times. Each entry includes its helpers; pow(a,d,m) is allowed for MR.

w10-primes-report: method/source evidence6, boundary/cross-checking6, fair reproducible timing6, conclusions/limits2, declaration0. Verify correctness before timing. Slow methods may use smaller n rather than another algorithm. Record actual sizes, repetitions, environment, preparation/query accounting and counts; make at least three measurements, without claiming a single ratio is universal.

Solo assignment 2 — Counting primes five ways

Sign in

Create account