Even if the legend were true, there would be very little to worry about. Consider this: to move one disk is trivial. To move two disks simply requires moving one disk, and then moving the base disk to the unoccupied peg, and moving the first disk on top. Three disks requires performing the previous task (two disks) then moving the base disk and moving the two disks back on top. In this way we can prove that any number of disks can be moved. There are three main steps required to move $n$ disks
1.

Move the top $n1$ disks to another peg.

2.

Move the last disk to the open peg.

3.

Move the first $n1$ disks on top of the last disk.

So, if we let $S\left(n\right)$ be the number of steps for $n$ disks, then recursively, $S\left(n\right)\=S\left(n1\right)\+1\+S\left(n1\right)\=2\cdot S\left(n1\right)\+1$. Since $S\left(0\right)\=0$ (trivially), the first few terms generated by this formula are $S\left(1\right)\=1\,S\left(2\right)\=3\,S\left(4\right)\=7\,S\left(5\right)\=15$. This is identical to the sequence generated by the nonrecursive function $S\left(n\right)\={2}^{n}1$ for $n\ge 0$. Thus, with three pegs, any number of disks can be moved from a starting peg to another peg. Why, then, is there nothing to worry about? If the monks made one move every second, it will take them ${2}^{64}1$ seconds, or about 585 billion years, to finish their appointed task.