olymmath

HMMT 2013 T9

  • Team
  • Answer

Let mm be an odd positive integer greater than 1 . Let SmS_{m} be the set of all non-negative integers less than mm which are of the form x+yx+y, where xy−1x y-1 is divisible by mm. Let f(m)f(m) be the number of elements of SmS_{m}. (a) Prove that f(mn)=f(m)f(n)f(m n)=f(m) f(n) if m,nm, n are relatively prime odd integers greater than 1 . (b) Find a closed form for f(pk)f\left(p^{k}\right), where k>0k>0 is an integer and pp is an odd prime.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

2+\frac{p^{k-1}(p-3)}{2}+\frac{p^{k-1}-p^{\frac{1+(-1)^{k}}{2}}}{p+1}

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