MétaCan
Menu
Back to cohort
Record W4302863679 · doi:10.48550/arxiv.1011.2154

Reducing the Erdos-Moser equation 1^n + 2^n + . . . + k^n = (k+1)^n\n modulo k and k^2

2010· preprint· W4302863679 on OpenAlexaff
Jonathan Sondow, Kieren MacMillan

Bibliographic record

VenuearXiv (Cornell University) · 2010
Typepreprint
Language
FieldMathematics
TopicAdvanced Mathematical Identities
Canadian institutionsYork University
Fundersnot available
KeywordsMathematicsDivisibility ruleModuloCongruence (geometry)Diophantine equationCongruence relationQuotientConjectureFermat's Last TheoremCorollaryMathematical proofCombinatoricsPure mathematicsDiophantine approximationDiscrete mathematics

Abstract

fetched live from OpenAlex

An open conjecture of Erdos and Moser is that the only solution of the\nDiophantine equation in the title is the trivial solution 1+2=3. Reducing the\nequation modulo k and k^2, we give necessary and sufficient conditions on\nsolutions to the resulting congruence and supercongruence. A corollary is a new\nproof of Moser's result that the conjecture is true for odd exponents n. We\nalso connect solutions k of the congruence to primary pseudoperfect numbers and\nto a result of Zagier. The proofs use divisibility properties of power sums as\nwell as Lerch's relation between Fermat and Wilson quotients.\n

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Research integrity
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.303
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0000.001
Open science0.0010.003
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.133
GPT teacher head0.226
Teacher spread0.094 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicAdvanced Mathematical IdentitiesFrench-language works237,207