Skip to main content

2019 AMC 10B Problem 2

Problem 2 of 25EasierNumber Theory

Consider the statement, “If nn is not prime, then n2n-2 is prime.” Which of the following values of nn is a counterexample to this statement?

Answer choices

Show solution

Solution

We need nn to not be prime, so nn can only be 15,21,27.15,21,27. Then, n2n-2 must be not prime, leaving just 27.27. Thus, the answer is E .

More practice

Concepts: counterexample · prime

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.