olymmath

HMMT 2016 U11

  • Guts
  • Answer

Define ϕ!(n)\phi^{!}(n) as the product of all positive integers less than or equal to nn and relatively prime to nn. Compute the remainder when

∑2≤n≤50gcd⁡(n,50)=1ϕ!(n)\sum_{\substack{2 \leq n \leq 50 \\ \operatorname{gcd}(n, 50)=1}} \phi^{!}(n)

is divided by 50 .

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

12

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