اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Conjecture Equivalent to the Collatz Conjecture
156
0
0.0
(
0
)
تأليف
Ashish Tiwari
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a formulation of the Collatz conjecture that is potentially more amenable to modeling and analysis by automated termination checking tools.
قيم البحث
اقرأ أيضاً
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak proof of the c
onjecture by using induction with respect to the degree of the polynomials.
We prove that, for every theory $T$ which is given by an ${mathcal L}_{omega_1,omega}$ sentence, $T$ has less than $2^{aleph_0}$ many countable models if and only if we have that, for every $Xin 2^omega$ on a cone of Turing degrees, every $X$-hyperar
ithmetic model of $T$ has an $X$-computable copy. We also find a concrete description, relative to some oracle, of the Turing-degree spectra of all the models of a counterexample to Vaughts conjecture.
The yet unproven Collatz conjecture maintains that repeatedly connecting even numbers n to n/2, and odd n to 3n + 1, connects all natural numbers by a unique root path to the Collatz tree with 1 as its root. The Collatz tree proves to be a Hilbert ho
tel. Numbers divisible by 2 or 3 depart. An infinite binary tree remains with one upward and one rightward child per number. Rightward numbers, and infinitely many generations of their upward descendants, each with a well-defined root path, depart thereafter. The Collatz tree is a Hilbert hotel because still higher upward descendants keep descending to all unoccupied nodes. The density of already departed numbers comes nevertheless arbitrarily close to 100% of the natural numbers. The latter proves the Collatz conjecture.
I conjecture an upper bound on the number of possible swampland conjectures by comparing the entropy required by the conjectures themselves to the Beckenstein-Hawking entropy of the cosmological horizon. Assuming of order 100 kilobits of entropy per
conjecture, this places an upper bound of order $10^{117}$ on the number of conjectures. I estimate the rate of production of swampland conjectures by the number of papers listed on INSPIRE with the word swampland in the title or abstract, which has been showing approximately exponential growth since 2014. At the current rate of growth, the entropy bound on the number of swampland conjectures can be projected to be saturated on a timescale of order $10^{-8} H_0^{-1}$. I compare the upper bound from the Swampland Conjecture Bound Conjecture (SCBC) to the estimated number of vacua in the string landscape. Employing the duality suggested by AdS/CFT between the quantum complexity of a holographic state and the volume of a Wheeler-Dewitt spacetime patch, I place a conservative lower bound of order $mathcal{N}_H > 10^{263}$ on the number of Hubble volumes in the multiverse which must be driven to heat death to fully explore the string landscape via conjectural methods.
Lothar Collatz had proposed in 1937 a conjecture in number theory called Collatz conjecture. Till today there is no evidence of proving or disproving the conjecture. In this paper, we propose an algorithmic approach for verification of the Collatz co
njecture based on bit representation of integers. The scheme neither encounters any cycles in the so called Collatz sequence and nor the sequence grows indefinitely. Experimental results show that the Collatz sequence starting at the given integer , oscillates for finite number of times, never exceeds 1.7 times (scaling factor) size of the starting integer and finally reaches the value 1. The experimental results show strong evidence that conjecture is correct and paves a way for theoretical proof.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
