MétaCan
Menu
Back to cohort
Record W2150958489 · doi:10.1017/s0004972712000834

CONSTRUCTION OF NORMAL NUMBERS USING THE DISTRIBUTION OF THE LARGEST PRIME FACTOR

2012· article· en· W2150958489 on OpenAlexaff
Jean–Marie De Koninck, Imre Kátai

Bibliographic record

VenueBulletin of the Australian Mathematical Society · 2012
Typearticle
Languageen
FieldMathematics
TopicAnalytic Number Theory Research
Canadian institutionsUniversité Laval
Fundersnot available
KeywordsMathematicsCombinatoricsInteger (computer science)Prime numberPrime factorBase (topology)Prime (order theory)Concatenation (mathematics)Sequence (biology)Irrational numberDistribution (mathematics)GeometryMathematical analysis

Abstract

fetched live from OpenAlex

Abstract Given an integer $q\ge 2$ , a $q$ -normal number is an irrational number $\eta $ such that any preassigned sequence of $\ell $ digits occurs in the $q$ -ary expansion of $\eta $ at the expected frequency, namely $1/q^\ell $ . In a recent paper we constructed a large family of normal numbers, showing in particular that, if $P(n)$ stands for the largest prime factor of $n$ , then the number $0.P(2)P(3)P(4)\ldots ,$ the concatenation of the numbers $P(2), P(3), P(4), \ldots ,$ each represented in base $q$ , is a $q$ -normal number, thereby answering in the affirmative a question raised by Igor Shparlinski. We also showed that $0.P(2+1)P(3+1)P(5+1) \ldots P(p+1)\ldots ,$ where $p$ runs through the sequence of primes, is a $q$ -normal number. Here, we show that, given any fixed integer $k\ge 2$ , the numbers $0.P_k(2)P_k(3)P_k(4)\ldots $ and $0. P_k(2+1)P_k(3+1)P_k(5+1) \ldots P_k(p+1)\ldots ,$ where $P_k(n)$ stands for the $k{\rm th}$ largest prime factor of $n$ , are $q$ -normal numbers. These results are part of more general statements.

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.001
metaresearch head score (Gemma)0.004
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.005
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0020.003
Open science0.0010.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.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.067
GPT teacher head0.334
Teacher spread0.267 · 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

Citations5
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueBulletin of the Australian Mathematical SocietySame topicAnalytic Number Theory ResearchFrench-language works237,207