A binomial representation of the 3x + 1 problem

DOI10.4064/AA-91-4-367-378MaRDI QIDQ4719663zbMATH OpenOpenAlexFDO

Authors M. Margenstern, Yu. 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

zbMATH Keywords

\(3n+1\) conjecture\(3x+1\) problembinomial representationCollatz problemKummer's theoremsums of products of binomial coefficientsSyracuse algorithmUlam's problem

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Recurrences (11B37) Binomial coefficients; factorials; (q)-identities (11B65) Special sequences and polynomials (11B83)

Recommendations

• scientific article; zbMATH DE number 2236594
• scientific article; zbMATH DE number 3889900
• scientific article; zbMATH DE number 3310994
• On the resolution of the equations U_n= x3 and V_n= x3
• scientific article; zbMATH DE number 3910471
• scientific article; zbMATH DE number 5263433
• Functional equations connected with the Collatz problem
• The inverse of a finite series and a third-order recurrent sequence
• scientific article; zbMATH DE number 1934404
• Studies on the coefficients of the analytic faculty.

Cited in

(5)

• Integral Representation and Algorithms for Closed Form Summation
• scientific article; zbMATH DE number 3871450 (Why is no real title available?)
• Some arithmetical restatements of the four color conjecture
• The Riemann hypothesis as the parity of special binomial coefficients
• Representing the integers with powers of 2 and 3.

This page was built for publication: A binomial representation of the 3x + 1 problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719663)