Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2311.12038

Modular Arithmetic Study on Ascending and Descending Operations Related with Collatz Conjecture

Kyo Jin Ihn
View original source ↗Read source document ↗Export metadata ↓

Abstract

Sequence of numbers generated by the recurrence relation based on the Collatz conjecture is investigated. An arithmetic operation on the Collatz conjecture is called descending operation, and ascending operation is carried out reversely to the descending operation. Study on the 3x+1 problem against every integer is relevant to that of descending operation against every odd. Any odds can be generated by ascending operations against odds not multiple of 3, and vise versa. Ascending operations against an odd not a multiple of 3 can generate infinite number of odds in the next generation. The odds multiple of 3 are terminal numbers of sequences that no further ascending operations are possible. Descending operations against the odds 1,5,21,.. reach 1, and otherwise reach the odds greater than or equal to 5. No two odds except 1 in each sequence are the same, and the each descending sequence is unique. Every descending sequence can start from terminal numbers, and reaches ultimately the origin of 1 as indicated by the Collatz conjecture. Sequences of odds in the same pattern ignoring the sizes of the odds are generated by ascending operations with the same number of doubling operations against the odds in modular arithmetic.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Kyo Jin Ihn. 2023-11-17. Modular Arithmetic Study on Ascending and Descending Operations Related with Collatz Conjecture. https://arxiv.org/abs/2311.12038

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗