Pascal's Triangle and the Tower of Hanoi

DOI10.2307/2324061zbMath0782.05003OpenAlexW2093851287WikidataQ56083802 ScholiaQ56083802MaRDI QIDQ5285734

Andreas M. Hinz

Publication date: 29 June 1993

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2324061

zbMATH Keywords

binomial coefficientsTower of HanoiPascal TriangleArithmetic Triangle

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics in computer science (68R05) Biographies, obituaries, personalia, bibliographies (01A70) Graph theory (05C99)

Related Items (22)

On a question of Leiss regarding the Hanoi Tower problem ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ The average eccentricity of Sierpiński graphs ⋮ A tour of general Hanoi graphs ⋮ The tower of Hanoi problem on Path\(_h\) graphs ⋮ Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph ⋮ Finding the edge ranking number through vertex partitions ⋮ The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs ⋮ Unnamed Item ⋮ The hub number of Sierpiński-like graphs ⋮ Metric properties of Sierpiński-like graphs ⋮ Coloring the square of Sierpiński graphs ⋮ The Wiener index of Sierpiński-like graphs ⋮ The generalized four-peg tower of hanoi problem ⋮ On the planarity of Hanoi graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Shortest paths in Sierpiński graphs ⋮ Graphs S(n, k) and a Variant of the Tower of Hanoi Problem ⋮ The outer-connected domination number of Sierpiński-like graphs

This page was built for publication: Pascal's Triangle and the Tower of Hanoi