scientific article; zbMATH DE number 1185160
From MaRDI portal
Publication:3838151
zbMATH Open0897.11005MaRDI QIDQ3838151FDOQ3838151
Authors: Daniele Parisse
Publication date: 6 August 1998
Title of this publication is not available (Why is that?)
Recommendations
partitionsbinary treetower of Hanoinumber of solutionslinear diophantine equationnumber-theoretic functionsStern-Brocot arraytheory of continued fractions
Trees (05C05) Combinatorial aspects of partitions of integers (05A17) Linear Diophantine equations (11D04)
Cited In (10)
- The super towers of Hanoi problem: Large rings on small rings
- The average eccentricity of Sierpiński graphs
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time
- Exponential vs. Subexponential Tower of Hanoi Variants
- The associativity of equivalence and the Towers of Hanoi problem
- Title not available (Why is that?)
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- Square-free tower of Hanoi sequences
- Goldbach, Hurwitz, and the infinitude of primes: weaving a proof across the centuries
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)