olymmath

HMMT 2017 A10

  • Algebra and Number Theory
  • Answer

Let N\mathbb{N} denote the natural numbers. Compute the number of functions f:N→{0,1,…,16}f: \mathbb{N} \rightarrow\{0,1, \ldots, 16\} such that

f(x+17)=f(x) and f(x2)≡f(x)2+15( mod 17)f(x+17)=f(x) \text { and } f\left(x^{2}\right) \equiv f(x)^{2}+15 (\bmod 17)

for all integers x≥1x \geq 1.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

12066

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/a10 · Tag JKN55PYMBH · Edit this page on GitHub · Keys: j next, k previous