MétaCan
Menu
Back to cohort
Record W4393118771 · doi:10.9734/jamcs/2024/v39i41880

Block Format Solves the Collatz Conjecture

2024· article· en· W4393118771 on OpenAlexaff
Khaled Moftah

Bibliographic record

VenueJournal of Advances in Mathematics and Computer Science · 2024
Typearticle
Languageen
FieldMathematics
TopicBenford’s Law and Fraud Detection
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsCollatz conjectureBlock (permutation group theory)Computer scienceConjectureParallel computingMathematicsAlgorithmArithmeticCombinatorics

Abstract

fetched live from OpenAlex

Blocks are unit convergence between two consecutive odd numbers formed according to the three x plus one conjecture rules. The left odd number is the left hook, L, and the right odd number is the right hook, R. They include even numbers between their boundaries. They are divided into families (F1 = 5, 11, 17, … & F2 = 1, 7, 11, … & F3 = 3, 9, 15, …) and groups based on their group length (The number of the middle-even numbers between the two hooks). Blocks are taken individually and placed beside each other, similar to the domino tiles play, which, by their formulation, satisfies the conjecture rules. Formed chains reach number one in the convergence mode or continue generating odd positive numbers infinitely according to the generation mode. The final convergence to number one is reached because these blocks have all the positive integers included as left hooks (L1, L2, L3), and all the F1 and F2 odd positive numbers are included as right hooks (R1 and R2). Block rules mandate that a single left hook produces only one right hook. Accordingly, no looping or entanglement (Joining and consequent splitting) between chain branches would occur. Statistics show that R cannot increase infinitely. Repeated oscillation up and down without reaching number one would also violate the statistics. Statistics reveal that blocks of various lengths have a strict occurrence and repetition sequence along the positive integer series. Block lengths can extend infinitely, and each block length repeats its occurrence infinitely. In the generation mode, blocks are attached in reverse order to the conjecture/convergence rules. According to the rules, all positive integers can be generated starting from number one. Multiple sequences and clusters of specific block lengths occur according to specific rules and cannot continue infinitely.

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 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.000
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.543
Threshold uncertainty score0.287

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.015
GPT teacher head0.296
Teacher spread0.281 · 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 teacher head, 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

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Advances in Mathematics and Computer ScienceSame topicBenford’s Law and Fraud DetectionFrench-language works237,207