A binomial representation of the 3x + 1 problem
From MaRDI portal
Publication:4719663
DOI10.4064/aa-91-4-367-378zbMath0968.11011OpenAlexW150784343MaRDI QIDQ4719663
Maurice Margenstern, Yu. V. Matiyasevich
Publication date: 6 January 2000
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/207362
Collatz problemUlam's problem\(3x+1\) problem\(3n+1\) conjectureKummer's theorembinomial representationSyracuse algorithmsums of products of binomial coefficients
Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65) Recurrences (11B37) Special sequences and polynomials (11B83)
Related Items (3)
The Riemann hypothesis as the parity of special binomial coefficients ⋮ Some arithmetical restatements of the four color conjecture ⋮ Integral Representation and Algorithms for Closed Form Summation
This page was built for publication: A binomial representation of the 3x + 1 problem
