Pascal's Triangle and the Tower of Hanoi

DOI10.2307/2324061MaRDI QIDQ5285734zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1488860
• Graphs, random walks, and the tower of Hanoi
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• Hanoi graphs and some classical numbers

Cited in

(23)

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

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

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