MétaCan
Menu
Back to cohort
Record W1995158087 · doi:10.1142/s1793042110003848

ON A CONJECTURE ON RAMANUJAN PRIMES

2010· article· en· W1995158087 on OpenAlexfundno aff
Shanta Laishram

Bibliographic record

VenueInternational Journal of Number Theory · 2010
Typearticle
Languageen
FieldMathematics
TopicAnalytic Number Theory Research
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRamanujan's sumMathematicsabc conjectureConjectureCombinatoricsPrime (order theory)Upper and lower boundsInteger (computer science)Discrete mathematicsBeal's conjectureMathematical analysis

Abstract

fetched live from OpenAlex

For n ≥ 1, the nth Ramanujan prime is defined to be the smallest positive integer Rn with the property that if x ≥ Rn, then [Formula: see text] where π(ν) is the number of primes not exceeding ν for any ν > 0 and ν ∈ ℝ. In this paper, we prove a conjecture of Sondow on upper bound for Ramanujan primes. An explicit bound of Ramanujan primes is also given. The proof uses explicit bounds of prime π and θ functions due to Dusart.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.007
metaresearch head score (Gemma)0.024
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.010
Threshold uncertainty score0.038

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0070.024
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0030.002
Science and technology studies0.0030.009
Scholarly communication0.0050.010
Open science0.0020.005
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0100.002

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.027
GPT teacher head0.376
Teacher spread0.350 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations18
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Number TheorySame topicAnalytic Number Theory ResearchFrench-language works237,207