Rope-burning puzzle

Last updated
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).
Lighting one end (red line) of a rope (brown line) burns it out in 60 s.
Lighting both ends burns it out in 30 s.
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.
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. Rope burning puzzle.svg
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 60s.
  2. Lighting both ends burns it out in 30s.
  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 45s.
  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 15s, giving a total of 45s.

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.

Contents

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

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]

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

Fusible numbers

Visualisation of the smallest fusible numbers larger than 0, 1 and 2:
.mw-parser-output .sfrac{white-space:nowrap}.mw-parser-output .sfrac.tion,.mw-parser-output .sfrac .tion{display:inline-block;vertical-align:-0.5em;font-size:85%;text-align:center}.mw-parser-output .sfrac .num,.mw-parser-output .sfrac .den{display:block;line-height:1em;margin:0 0.1em}.mw-parser-output .sfrac .den{border-top:1px solid}.mw-parser-output .sr-only{border:0;clip:rect(0,0,0,0);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}
1/2, 1
1/8 and 2
1/1024, respectively (bold) Rope burning puzzle smallest fusible.svg
Visualisation of the smallest fusible numbers larger than 0, 1 and 2:1/2, 11/8 and 21/1024, respectively (bold)

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

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

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

Related Research Articles

In mathematics, the Cantor set is a set of points lying on a single line segment that has a number of unintuitive properties. It was discovered in 1874 by Henry John Stephen Smith and introduced by German mathematician Georg Cantor in 1883.

<span class="texhtml mvar" style="font-style:italic;">e</span> (mathematical constant) 2.71828..., base of natural logarithms

The number e, also known as Euler's number, is a mathematical constant approximately equal to 2.71828 that can be characterized in many ways. It is the base of natural logarithms. It is the limit of (1 + 1/n)n as n approaches infinity, an expression that arises in the study of compound interest. It can also be calculated as the sum of the infinite series

<span class="mw-page-title-main">Fibonacci sequence</span> Numbers obtained by adding the two previous ones

In mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers, commonly denoted Fn. The sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or sometimes from 1 and 2. Starting from 0 and 1, the first few values in the sequence are:

In mathematics, the harmonic mean is one of several kinds of average, and in particular, one of the Pythagorean means. It is sometimes appropriate for situations when the average rate is desired.

<span class="mw-page-title-main">Natural logarithm</span> Logarithm to the base of the mathematical constant e

The natural logarithm of a number is its logarithm to the base of the mathematical constant e, which is an irrational and transcendental number approximately equal to 2.718281828459. The natural logarithm of x is generally written as ln x, logex, or sometimes, if the base e is implicit, simply log x. Parentheses are sometimes added for clarity, giving ln(x), loge(x), or log(x). This is done particularly when the argument to the logarithm is not a single symbol, so as to prevent ambiguity.

<span class="mw-page-title-main">Pell's equation</span> Type of Diophantine equation

Pell's equation, also called the Pell–Fermat equation, is any Diophantine equation of the form where n is a given positive nonsquare integer, and integer solutions are sought for x and y. In Cartesian coordinates, the equation is represented by a hyperbola; solutions occur wherever the curve passes through a point whose x and y coordinates are both integers, such as the trivial solution with x = 1 and y = 0. Joseph Louis Lagrange proved that, as long as n is not a perfect square, Pell's equation has infinitely many distinct integer solutions. These solutions may be used to accurately approximate the square root of n by rational numbers of the form x/y.

In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the sum of its integer part and the reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on. In a finite continued fraction, the iteration/recursion is terminated after finitely many steps by using an integer in lieu of another continued fraction. In contrast, an infinite continued fraction is an infinite expression. In either case, all integers in the sequence, other than the first, must be positive. The integers are called the coefficients or terms of the continued fraction.

<span class="mw-page-title-main">Imaginary unit</span> Principal square root of −1

The imaginary unit or unit imaginary number is a solution to the quadratic equation . Although there is no real number with this property, i can be used to extend the real numbers to what are called complex numbers, using addition and multiplication. A simple example of the use of i in a complex number is .

<span class="mw-page-title-main">Dyadic rational</span> Fraction with denominator a power of two

In mathematics, a dyadic rational or binary rational is a number that can be expressed as a fraction whose denominator is a power of two. For example, 1/2, 3/2, and 3/8 are dyadic rationals, but 1/3 is not. These numbers are important in computer science because they are the only ones with finite binary representations. Dyadic rationals also have applications in weights and measures, musical time signatures, and early mathematics education. They can accurately approximate any real number.

<span class="mw-page-title-main">Egyptian fraction</span> Finite sum of distinct unit fractions

An Egyptian fraction is a finite sum of distinct unit fractions, such as

<span class="mw-page-title-main">Square triangular number</span> Integer that is both a perfect square and a triangular number

In mathematics, a square triangular number is a number which is both a triangular number and a square number. There are infinitely many square triangular numbers; the first few are:

In number theory, Aleksandr Yakovlevich Khinchin proved that for almost all real numbers x, coefficients ai of the continued fraction expansion of x have a finite geometric mean that is independent of the value of x and is known as Khinchin's constant.

One half is the irreducible fraction resulting from dividing one (1) by two (2), or the fraction resulting from dividing any number by its double.

<span class="mw-page-title-main">Unit fraction</span> One over a whole number

A unit fraction is a positive fraction with one as its numerator, 1/n. It is the multiplicative inverse (reciprocal) of the denominator of the fraction, which must be a positive natural number. Examples are 1/1, 1/2, 1/3, 1/4, 1/5, etc. When an object is divided into equal parts, each part is a unit fraction of the whole.

In complex analysis, a branch of mathematics, a generalized continued fraction is a generalization of regular continued fractions in canonical form, in which the partial numerators and partial denominators can assume arbitrary complex values.

<span class="mw-page-title-main">Practical number</span> Number such that it and all smaller numbers may be represented as sums of its distinct divisors

In number theory, a practical number or panarithmic number is a positive integer such that all smaller positive integers can be represented as sums of distinct divisors of . For example, 12 is a practical number because all the numbers from 1 to 11 can be expressed as sums of its divisors 1, 2, 3, 4, and 6: as well as these divisors themselves, we have 5 = 3 + 2, 7 = 6 + 1, 8 = 6 + 2, 9 = 6 + 3, 10 = 6 + 3 + 1, and 11 = 6 + 3 + 2.

<span class="mw-page-title-main">Znám's problem</span> On divisibility among sets of integers

In number theory, Znám's problem asks which sets of integers have the property that each integer in the set is a proper divisor of the product of the other integers in the set, plus 1. Znám's problem is named after the Slovak mathematician Štefan Znám, who suggested it in 1972, although other mathematicians had considered similar problems around the same time.

In number theory, the odd greedy expansion problem asks whether a greedy algorithm for finding Egyptian fractions with odd denominators always succeeds. As of 2021, it remains unsolved.

<span class="mw-page-title-main">Irrational number</span> Number that is not a ratio of integers

In mathematics, the irrational numbers are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being incommensurable, meaning that they share no "measure" in common, that is, there is no length, no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself.

Ganita Kaumudi (Gaṇitakaumudī) is a treatise on mathematics written by Indian mathematician Narayana Pandita in 1356. It was an arithmetical treatise alongside the other algebraic treatise called "Bijganita Vatamsa" by Narayana Pandit.

References

  1. 1 2 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. 1 2 Brumbaugh, Douglas K. (2013), Teaching Middle School Mathematics, Routledge, pp.  191, 309, ISBN   978-1-136-75622-1
  3. 1 2 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. 1 2 3 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. 1 2 3 4 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.), "SequenceA188545", 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