Jump to content

Rope-burning puzzle

From Wikipedia, the free encyclopedia
(Redirected from Fusible number)
Visualisation of the rope-burning puzzle, the horizontal axis denoting time elapsed in seconds and vertical axis denoting burn time remaining on a rope (not its length).
  1. Lighting one end (red line) of a rope (brown line) burns it out in 60 s.
  2. Lighting both ends burns it out in 30 s.
  3. The standard solution with two ropes, initially the first with both ends lit and the second with just one. The first rope burning out triggers lighting of the second end of the second rope (blue arrow), burning it out in a total of 45 s.
  4. An alternative solution with the second rope initially unlit. The first rope burning out triggers lighting of both ends of and a random point on the second rope. Each time a segment burns out, a random point on the remaining rope is lit. In theory, the second rope burns out in 15 s, giving a total of 45 s.

In recreational mathematics, rope-burning puzzles are a class of mathematical puzzle in which one is given lengths of rope, fuse cord, or shoelace that each burn for a given amount of time, and matches to set them on fire, and must use them to measure a non-unit amount of time. The fusible numbers are defined as the amounts of time that can be measured in this way.

As well as being of recreational interest, these puzzles are sometimes posed at job interviews as a test of candidates' problem-solving ability,[1] and have been suggested as an activity for middle school mathematics students.[2]

Example

[edit]

A common and simple version of this problem asks to measure a time of 45 seconds using only two fuses that each burn for a minute. The assumptions of the problem are usually specified in a way that prevents measuring out 3/4 of the length of one fuse and burning it end-to-end, for instance by stating that the fuses burn unevenly along their length.[1][2][3][4]

One solution to this problem is to perform the following steps:[3]

  • Light one end of the first fuse, and both ends of the second fuse.
  • Once the second fuse has burned out, 30 seconds have elapsed, and there are 30 seconds of burn time left on the first fuse. Light the other end of the first fuse.
  • Once the first fuse burns out, 45 seconds have elapsed.

Many other variations are possible, in some cases using fuses that burn for different amounts of time from each other.[5]

Fusible numbers

[edit]
Visualisation of the smallest fusible numbers larger than 0, 1 and 2: 1/2, 11/8 and 21/1024, respectively (bold) [6]

In common versions of the problem, each fuse lasts for a unit length of time, and the only operations used or allowed in the solution are to light one or both ends of a fuse at known times, determined either as the start of the solution or as the time that another fuse burns out. If only one end of a fuse is lit at time , it will burn out at time . If both ends of a fuse are lit at times and , it will burn out at time , because a portion of is burnt at the original rate, and the remaining portion of is burnt at twice the original rate, hence the fuse burns out at

.

A number is a fusible number if it is possible to use unit-time fuses to measure out units of time using only these operations. For instance, by the solution to the example problem, is a fusible number.[7]

One may assume without loss of generality that every fuse is lit at both ends, by replacing a fuse that is lit only at one end at time by two fuses, the first one lit at both ends at time and the second one lit at both ends at time when the first fuse burns out. In this way, the fusible numbers can be defined as the set of numbers that can be obtained from the number by repeated application of the operation , applied to pairs that have already been obtained and for which .[7]

The fusible numbers include all of the non-negative integers, and are a well-ordered subset of the dyadic rational numbers, the fractions whose denominators are powers of two. Being well-ordered means that, if one chooses a decreasing sequence of fusible numbers, the sequence must always be finite. Among the well-ordered sets, their ordering can be classified as , an epsilon number (a special case of the infinite ordinal numbers). Because they are well-ordered, for each integer there is a unique smallest fusible number among the fusible numbers larger than ; it has the form for some .[7] This number grows very rapidly as a function of , so rapidly that for it is (in Knuth's up-arrow notation for large numbers) already larger than .[8] The existence of this number , for each , cannot be proven in Peano arithmetic.[7]

Lighting more than two points of a fuse

[edit]

If the rules of the fuse-burning puzzles are interpreted to allow fuses to be lit at more points than their ends, a larger set of amounts of time can be measured. For instance, if a fuse is lit in such a way that, while it burns, it always has three ends burning (for instance, by lighting one point in the middle and one end, and then lighting another end or another point in the middle whenever one or two of the current lit points burn out) then it will burn for 1/3 of a unit of time rather than a whole unit. By representing a given amount of time as a sum of unit fractions, and successively burning fuses with multiple lit points so that they last for each unit fraction amount of time, it is possible to measure any rational number of units of time. However, keeping the desired number of flames lit, even on a single fuse, may require an infinite number of re-lighting steps.[4]

The problem of representing a given rational number as a sum of unit fractions is closely related to the construction of Egyptian fractions, sums of distinct unit fractions; however, for fuse-burning problems there is no need for the fractions to be different from each other. Using known methods for Egyptian fractions one can prove that measuring a fractional amount of time , with , needs only fuses (expressed in big O notation).[9] An unproven conjecture of Paul Erdős on Egyptian fractions suggests that fewer fuses, , may always be enough.[10]

History

[edit]

In a booklet on these puzzles titled Shoelace Clock Puzzles, created by Dick Hess for a 1998 Gathering 4 Gardner conference, Hess credits Harvard statistician Carl Morris as his original source for these puzzles.[4]

See also

[edit]

References

[edit]
  1. ^ a b Mongan, John; Kindler, Noah Suojanen; Giguère, Eric (2012), "Burning fuses", Programming Interviews Exposed: Secrets to Landing Your Next Job (3rd ed.), John Wiley & Sons, p. 234, ISBN 978-1-118-28720-0
  2. ^ a b Brumbaugh, Douglas K. (2013), Teaching Middle School Mathematics, Routledge, pp. 191, 309, ISBN 978-1-136-75622-1
  3. ^ a b Haselbauer, Nathan (2020), 60-Second Brain Teasers Pencil-Free Puzzles: Short Head-Scratchers from the Easy to Near Impossible, Fair Winds Press, pp. 77, 121, ISBN 978-1-63159-927-9
  4. ^ a b c Winkler, Peter (2004), "Uses of fuses", Mathematical Puzzles: A Connoisseur's Collection, A K Peters, pp. 2, 6, ISBN 1-56881-201-9
  5. ^ Hess, Dick (2009), "Shoelace clocks", All-Star Mathlete Puzzles, Official Mensa Puzzle Books, p. 9, ISBN 978-1-4027-5528-6
  6. ^ Jeff Erickson, Fusible Numbers
  7. ^ a b c d Erickson, Jeff; Nivasch, Gabriel; Xu, Junyan (June 2021), "Fusible numbers and Peano arithmetic", Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2021), IEEE, pp. 1–13, arXiv:2003.14342, doi:10.1109/lics52264.2021.9470703
  8. ^ Sloane, N. J. A. (ed.), "Sequence A188545", The On-Line Encyclopedia of Integer Sequences, OEIS Foundation
  9. ^ Vose, M. (1985), "Egyptian fractions", Bulletin of the London Mathematical Society, 17: 21, doi:10.1112/blms/17.1.21, MR 0766441
  10. ^ Erdős, Pál (1950), "Az egyenlet egész számú megoldásairól" [On a Diophantine equation] (PDF), Matematikai Lapok (in Hungarian), 1: 192–210, MR 0043117