On the Greatest Prime Factor of Some Divisibility Sequences
Bibliographic record
Abstract
Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper P left-parenthesis m right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>P</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>m</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">P(m)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> denote the greatest prime factor of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="m"> <mml:semantics> <mml:mi>m</mml:mi> <mml:annotation encoding="application/x-tex">m</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . For integer <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="a greater-than 1"> <mml:semantics> <mml:mrow> <mml:mi>a</mml:mi> <mml:mo>></mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">a>1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , M. Ram Murty and S. Wong proved that, under the assumption of the ABC conjecture, <disp-formula content-type="math/mathml"> \[ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper P left-parenthesis a Superscript n Baseline minus 1 right-parenthesis much-greater-than Subscript epsilon comma a Baseline n Superscript 2 minus epsilon"> <mml:semantics> <mml:mrow> <mml:mi>P</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:msup> <mml:mi>a</mml:mi> <mml:mi>n</mml:mi> </mml:msup> <mml:mo> − </mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> <mml:msub> <mml:mo> ≫ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi> ϵ </mml:mi> <mml:mo>,</mml:mo> <mml:mi>a</mml:mi> </mml:mrow> </mml:msub> <mml:msup> <mml:mi>n</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mn>2</mml:mn> <mml:mo> − </mml:mo> <mml:mi> ϵ </mml:mi> </mml:mrow> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">P(a^n-1)\gg _{\epsilon , a} n^{2-\epsilon }</mml:annotation> </mml:semantics> </mml:math> \] </disp-formula> for any <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="epsilon greater-than 0"> <mml:semantics> <mml:mrow> <mml:mi> ϵ </mml:mi> <mml:mo>></mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">\epsilon >0</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . We study analogues results for the corresponding divisibility sequence over the function field <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper F Subscript q Baseline left-parenthesis t right-parenthesis"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">F</mml:mi> </mml:mrow> <mml:mi>q</mml:mi> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>t</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {F}_q(t)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and for some divisibility sequences associated to elliptic curves over the rational field <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper Q"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">Q</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {Q}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> .
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".