Bonded Trajectories of the 3x+γ Problem
Abstract
Fix γ ∈ Z>0odd and n∈Z>0. We define the function Cγ: Z>0 Z>0 such that if n is odd, Cγ(n)=3n+γ; and if n is even, Cγ(n)=n/2. We define the characteristic mapping γ: Z>0 \0,\, 1\ to be γ(n) Cγ(n)\, mod\, 2. Let n start an integral loop of length N associated with the 3x+γ Problem. Let and be the count of the number of zeros and ones in a single period of B = (γi(n))i≥ 0. In a single period of B, let mj denote the number of zeros between the (j-1)th and jth one. Let Mn be the matrix associated to n whose elements are the sequential products of 2mj (e.g. (2m0,2m0+m1,2m0+m1+m2,...)). Let p be a prime factor for all the terms in the integral loop starting with n with multiplicity a>0. Suppose also that p is a prime factor of γ and 2 - 3 with multiplicity b and c, respectively. Finally assume that c>b-a. Then (Mn) 0 p. We do find examples of this property. Let be prime. Let zj = 2(mj+2mj+1+3mj+2+...)/ be a weighted arithmetic average of the mj. We prove that if p is a prime factor of 2-3 distinct from so that the residue class p generates the whole group Z* then p (Mn) if and only if p(z1+...+z) and for any 1≤ i<j≤ we have zi zj p. By this, we give an interesting property for the integral loop.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.