olymmath

HMMT November 2015 T10

  • Team
  • Answer

A number nn is badb a d if there exists some integer cc for which xx≡c( mod n)x^{x} \equiv c(\bmod n) has no integer solutions for xx. Find the number of bad integers between 2 and 42 inclusive.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

25

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 hmnt/2015/t10 · Tag C8W79HNTA4 · Edit this page on GitHub · Keys: j next, k previous