Competition problem — Number theory

Library / /114 of 520

Number theory Difficulty 5.7 AIME, harder Prove it

13. Show that there are no Carmichael numbers of the form $3 p q$ where $p$ and $q$ are primes.

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.