Bibliographic record
Abstract
Based on the data we get, nlog n is acceptable approximation to A(Pn) for small Pn ( most of relative errors are on the order of 1%, 1‰ or 0.1‰ for Pn less than 2000 ), where Pn is the n-th prime for n ≥ 2 and A(Pn) = Ln − Pn but Ln is the largest strong Goldbach number generated by Pn. Thus we propose a proposition that A(Pn) ≈ nlog n for all Pn. To give indirect verification of the proposition for large Pn, we obtain an experimental formula for calculating the number of primes not greater than Pn relying on existence of A(Pn). Using the formula, our found relative errors are generally smaller than that arising from x/log x, for example, there is a found relative error to be about 0.00935% for the 382465573492-th prime but the relative error is about 3.45305% by x/log x, 0.16046% by x/((log x) − 1.08366), 0.02479% by x/log x + x/(log x)2 + 2x/(log x)3. If the proposition is proven, then Goldbach’s conjecture is true.
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.022 | 0.007 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.000 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 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".