A binomial representation of the 3x + 1 problem (Q4719663)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1384780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A binomial representation of the 3x + 1 problem |
scientific article; zbMATH DE number 1384780 |
Statements
A binomial representation of the 3x + 1 problem (English)
0 references
6 January 2000
0 references
\(3x+1\) problem
0 references
\(3n+1\) conjecture
0 references
Collatz problem
0 references
Ulam's problem
0 references
Syracuse algorithm
0 references
Kummer's theorem
0 references
binomial representation
0 references
sums of products of binomial coefficients
0 references
0.7075081
0 references
0.6993367
0 references
0.6983214
0 references
0.69438815
0 references
Let \(f(x)=(3x+1)/2\) if \(x\) is odd, and \(f(x)=x/2\) if \(x\) is even, and define \(g\) recursively by \(g(a,0)=a\) and \(g(a,k+1)=f(g(a,k))\). Then the \(3x+1\) problem is to prove that, for any positive integer \(a\), there is some \(k\) such that \(g(a,k)=1\). The relation \(\text{Syr}(a,b)\) is defined to hold when there is some \(m\) satisfying \(g(a,m)=b\). Starting with a lemma based on a theorem of Kummer, the authors prove a theorem asserting that, given positive integers \(a,b\), the relation \(\text{Syr}(a,b)\) is equivalent to the existence of integers \(w,p,r,s,t\) satisfying \(a\leq w\), \(b\leq w\), and the condition that a product of seven binomial coefficients whose entries are polynomials of \(a,b,w,p,r,s,t\) of degree \(\leq 3\) gives an odd number. Using that the \(3x+1\) conjecture is true if and only if \(\text{Syr}(a,1)\) is true for any positive integer \(a\), they derive three restatements of the \(3x+1\) conjecture in terms involving products of binomial coefficients. The last corollary asserts that \(\text{Syr}(a,1)\) is true if and only if there exists positive integers \(w,v\) with \(a\leq w\) such that a triple sum of products of binomial coefficients gives an odd number. In principle, this could make it possible to attack the Collatz problem by sophisticated algorithms searching closed forms for sums of products of binomial coefficients [cf. \textit{H. S. Wilf} and \textit{D. Zeilberger}, Invent. Math. 108, 575-633 (1992; Zbl 0739.05007)].
0 references