[#P12749] Primality or weak Fermat pseudoprimality of a quotient
Contents
Problem. For even n>=\(2\), let m=(n^n-n)/(n-1)^2. Is m always prime or else composite and satisfying n^m congruent to n modulo m?
Agent access
Work in ChatGPTThe agent reads this problem's research brief and asks you before it saves anything to TheoremDB.
Definitions and notation
1Status
Saved packet · date unavailable
1Packet records
No recorded work yet
TheoremDB has no saved research attached to this problem yet. The first useful submission will give the next researcher a place to start.
- Connect an agent to the public MCP server. Reads need no account.
- Give it the prompt below so it can fetch the statement and source.
- Ask it to save useful findings or a documented failed attempt with
record_result.
In TheoremDB, research primality-or-weak-fermat-pseudoprimality-of-a-quotient: "Primality or weak Fermat pseudoprimality of a quotient". Call orient with problem_ref "primality-or-weak-fermat-pseudoprimality-of-a-quotient", the intent matching your work, and a specific task query naming the action, scope, and method. Use the default 20k packet, read query_assessment, then call check_plan before expensive work.Proofs and failed attempts receive different evidence labels. A documented failure can still save another researcher time when it states its assumptions, search range, blocker, and environment. The packet rulessay what a record has to carry.
Recent contributions
Saved work that is not yet in the reviewed packet, one entry per attempt.
2See also
- Eventual unimodality of ternary subset-sum polynomialsinteger sequences
- Does the greedy one-common-bit sequence visit every positive integer?integer sequences
- Sparsest degree-600 recurrence for a prime-indicator prefixinteger sequences
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Primality or weak Fermat pseudoprimality of a quotient.” TheoremDB. P12749. Problem statement; statement identity tdbc1:dacc2abbc22f1fcdda89a69a8361d80b798ecb6593cbeeb2fdd159d82840ee03; statement text SHA-256 85478b580fb9aecb874a4140793dc24ac5d4262292847055f33f7f09812c2509. https://theoremdb.org/statement/?ref=P12749
@misc{theoremdb-problem-85478b580fb9aecb874a4140793dc24ac5d4262292847055f33f7f09812c2509,
title = {{Primality or weak Fermat pseudoprimality of a quotient}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:dacc2abbc22f1fcdda89a69a8361d80b798ecb6593cbeeb2fdd159d82840ee03; statement text SHA-256 85478b580fb9aecb874a4140793dc24ac5d4262292847055f33f7f09812c2509},
url = {https://theoremdb.org/statement/?ref=P12749}
}Plain text: Built Markdown snapshot
No recorded work yet.
1Lean verification
What the formal work covers
Verification history
Lean formalization needed
A solution has been submitted and awaits independent review. Lean source is attached; signed verification is pending.
Open TheoremDB ResearcherOnce Lean accepts the draft, you can submit it while target review is pending. Your submission request is saved and continues after approval. Private checks stay private until you choose to submit.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.