scientific article; zbMATH DE number 1185160

MaRDI QIDQ3838151zbMATH OpenFDO

Authors Daniele Parisse

Publication date 6 August 1998

zbMATH Keywords

partitionsbinary treetower of Hanoinumber of solutionslinear diophantine equationnumber-theoretic functionsStern-Brocot arraytheory of continued fractions

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of partitions of integers (05A17) Linear Diophantine equations (11D04)

Recommendations

• scientific article; zbMATH DE number 1488860
• Generalized sequencing problem “Towers of Hanoi”
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart

Cited in

(10)

• scientific article; zbMATH DE number 6963586 (Why is no real title available?)
• Exponential vs. Subexponential Tower of Hanoi Variants
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time
• The average eccentricity of Sierpiński graphs
• Square-free tower of Hanoi sequences
• The super towers of Hanoi problem: Large rings on small rings
• Goldbach, Hurwitz, and the infinitude of primes: weaving a proof across the centuries
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• The associativity of equivalence and the Towers of Hanoi problem

This page was built for publication:

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