olymmath

HMMT 2017 U24

  • Guts
  • Answer

At a recent math contest, Evan was asked to find 22016( mod p)2^{2016}(\bmod p) for a given prime number pp with 100<p<500100<p<500. Evan has forgotten what the prime pp was, but still remembers how he solved it:

  • Evan first tried taking 2016 modulo p−1p-1, but got a value ee larger than 100 .
  • However, Evan noted that e−12(p−1)=21e-\frac{1}{2}(p-1)=21, and then realized the answer was −221( mod p)-2^{21}(\bmod p).

What was the prime pp ?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

211

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2017/u24 · Tag 9T6W37MH3Z · Edit this page on GitHub · Keys: j next, k previous