A simple (inductive) proof for the non-existence of 2-cycles of the 3x+1 problem
From MaRDI portal
Publication:868892
DOI10.1016/J.JNT.2006.05.011zbMATH Open1111.11016OpenAlexW2162335506MaRDI QIDQ868892FDOQ868892
Publication date: 26 February 2007
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jnt.2006.05.011
Recommendations
Special sequences and polynomials (11B83) Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)
Cites Work
- Title not available (Why is that?)
- A lower bound for linear forms in logarithms
- Benford's law, values of L-functions and the 3x+1 problem
- Linear forms in two logarithms and interpolation determinants
- On the "3x + 1" Problem
- The 3x + 1 Problem and Its Generalizations
- On the nonexistence of $2$-cycles for the $3x+1$ problem
- Theoretical and computational bounds for m-cycles of the 3n+1-problem
- Title not available (Why is that?)
- Counting smooth solutions to the equation A +B =C
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: A simple (inductive) proof for the non-existence of 2-cycles of the \(3x+1\) problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868892)