MétaCan
Menu
Back to cohort
Record W2010179120 · doi:10.1090/s0025-5718-02-01519-3

Corrigendum to “Period of the power generator and small values of Carmichael’s function”

2002· erratum· en· W2010179120 on OpenAlex
John Friedlander, Carl Pomerance, Igor E. Shparlinski

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueMathematics of Computation · 2002
Typeerratum
Languageen
FieldMathematics
TopicAnalytic Number Theory Research
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMathematicsAssertionNotationGenerator (circuit theory)Discrete mathematicsPower (physics)Period (music)CombinatoricsCalculus (dental)ArithmeticComputer sciencePhilosophy

Abstract

fetched live from OpenAlex

We are indebted to Kelly Postelmans whose question drew our attention to a slip in the proof of Theorem 8 of [1]. In particular, we asserted that for a fixed number n, the number of pairs of primes p, l with gcd(p − 1,l − 1) <Dand λ(λ(pl)) = n is at most Dτ(n), an assertion which now seems unjustified. (The notation is defined below.) In this note we give a corrected proof of Theorem 8. As in [1] we consider the power generator (1) un ≡ u e n−1 (mod m), 0 ≤ un ≤ m − 1, n =1, 2,..., with the initial value u0 = ϑ (an integer coprime to m) andexponent e (an integer at least 2). We recall that for an integer n ≥ 1theCarmichael function λ(n) is the largest order occurring amongst elements of the unit group in the residue ring modulo n. As usual, ϕ denotes Euler’s function. We let τ(n) denote the number of natural divisors of n, weletω(n) denote the number of divisors of n that are prime, and we let Ω(n) denote the number of divisors of n that are (either a prime or) a prime power. An integer n is said to be squarefull if for each prime p|n we

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.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.841
Threshold uncertainty score0.963

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.064
GPT teacher head0.306
Teacher spread0.243 · 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