Competition problem — Number theory

Library / /156 of 520

Number theory Difficulty 5.8 AIME, harder Prove it

4. Show that if $n$ is an Euler pseudoprime to the base $b$ , then $n$ is also an Euler pseudoprime to the base $n-b$ .

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.