Calculate collatz

Anchor-Based Formulas for 7 mod 8 To predict the behavior of sequences starting in 7 mod 8, we introduce a variable g = (n + 1) / 8, where n ∈ 7 mod 8. If (n+1)/8 is odd its g If even divide it with 2 until it hit odd g = 3(times you divide).d (the odd number you get after dividing) Example. If (n+1)/8 is 56 56= 2*2*2*7 g = 3^3*7We have derived the following working formulas: Class: 3mod4 (in7mod8) If g = 3mod4 x = (27g-1)/4 Then, divide x by 2 repeatedly until an odd number is reached. This is the first value sequence will attain after its first visit of 5mod8 class always smaller than the value we started with it will be true for other 2 formulas as well. To calculate the the the starting value v=8g-1 We consider the starting value the point where our calculated anchor point exsist i will further write on anchor points . Class: 1 mod 16 (in 7 mod 8)If g ≡ 1 mod 16: x = (81g - 1) / 16Then, divide x by 2 repeatedly until an odd number is reached.Class: 5 mod 32 (in 7 mod 8)If g ≡ 5 mod 32: x = (243g + 1) / 32Then divide x by 2 repeatedly until an odd number is reached.These formulas are fully testable and yield deterministic values. *These formula also skip the loops a number might take in 7mod8 class before hitting 5mod8 class for first time, also its orbit in 3mod8 and 1mod8 class. Note: The frame work on proof is complete. N+1/4 main function

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-07-11
DOI
https://doi.org/10.5281/zenodo.15879231
Primary Topic
Benford’s Law and Fraud Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Calculate collatz

Zenodo (CERN European Organization for Nuclear Research)
Benford’s Law and Fraud Detection
article

Calculate collatz

article en

Abstract

Anchor-Based Formulas for 7 mod 8 To predict the behavior of sequences starting in 7 mod 8, we introduce a variable g = (n + 1) / 8, where n ∈ 7 mod 8. If (n+1)/8 is odd its g If even divide it with 2 until it hit odd g = 3(times you divide).d (the odd number you get after dividing) Example. If (n+1)/8 is 56 56= 2*2*2*7 g = 3^3*7We have derived the following working formulas: Class: 3mod4 (in7mod8) If g = 3mod4 x = (27g-1)/4 Then, divide x by 2 repeatedly until an odd number is reached. This is the first value sequence will attain after its first visit of 5mod8 class always smaller than the value we started with it will be true for other 2 formulas as well. To calculate the the the starting value v=8g-1 We consider the starting value the point where our calculated anchor point exsist i will further write on anchor points . Class: 1 mod 16 (in 7 mod 8)If g ≡ 1 mod 16: x = (81g - 1) / 16Then, divide x by 2 repeatedly until an odd number is reached.Class: 5 mod 32 (in 7 mod 8)If g ≡ 5 mod 32: x = (243g + 1) / 32Then divide x by 2 repeatedly until an odd number is reached.These formulas are fully testable and yield deterministic values. *These formula also skip the loops a number might take in 7mod8 class before hitting 5mod8 class for first time, also its orbit in 3mod8 and 1mod8 class. Note: The frame work on proof is complete. N+1/4 main function

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 49%
Benford’s Law and Fraud Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.