A Conjecture on the Closed Form Formula for the Multi-Peg Tower of Hanoi Problem

Published 19 May 2025 in math.CO | (2505.12941v2)

Abstract: This paper presents a comprehensive validation and exploration of the author's Conjecture, a surprising closed-form expression for the minimum number of moves required to solve the Multi Peg Tower of Hanoi problem with p pegs and n disks for all n and p such that p is greater than 3 and n is between p-1 and p*(p-1)/2.

Abstract PDF Upgrade to Chat

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Create Your Own

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Abhiram Menon

Collections

Sign up for free to add this paper to one or more collections.

Reddit

Menon’s Conjecture on the Generalized Tower of Hanoi (0 points, 4 comments)