benchmarks.wiki / Public workspace

Omni-MATH / A number n is bad if there exists some integer c for which x^{x} equiv c(bmod n) has no integer solutions for x. Find the number of bad integers between 2 and 42 inclusive.

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

A number nn is badb a d if there exists some integer cc for which $x^{x} \equiv c(\bmod n)$ has no integer solutions for xx. Find the number of bad integers between 2 and 42 inclusive.
Plain-text mathematical notation (without MathML)
A number n is bad if there exists some integer c for which $x^{x} \equiv c(\bmod n)$ has no integer solutions for x. Find the number of bad integers between 2 and 42 inclusive.
Original LaTeX notation
A number $n$ is $b a d$ if there exists some integer $c$ for which $x^{x} \equiv c(\bmod n)$ has no integer solutions for $x$. Find the number of bad integers between 2 and 42 inclusive.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import