Competition problem — Number theory

Library / /247 of 520

Number theory Difficulty 6.1 National olympiad Prove it

Theorem 5.8. If $n$ is an odd composite positive integer, then $n$ passes Miller's test for at most $(n-1) / 4$ bases $b$ with $1 \leqslant b \leqslant n-1$ .

Solution

None

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.