Difference between revisions of "Stacking with harmonic series"

From MathTank
Jump to navigation Jump to search
m
m
Line 1: Line 1:
 
How ''long'' can dominoes (or blocks, tiles etc.) stack be? Can it be 50 cm? 1m? 1 km? Let’s take a look:
 
How ''long'' can dominoes (or blocks, tiles etc.) stack be? Can it be 50 cm? 1m? 1 km? Let’s take a look:
 
[[File:Domino.png|alt=Domino stacks|none|thumb|777x777px|Domino stacks]]
 
[[File:Domino.png|alt=Domino stacks|none|thumb|777x777px|Domino stacks]]
For each of the stacks above we need to make sure that it does not collapse.   
+
For each of the stacks above we need to make sure that it does not collapse.  Suppose that we have already built a stack of <nowiki><math> n </math></nowiki> dominoes. We then take this stack and place it on top of the next domino, shifting the stack over as much as we can without tipping it over. What is the maximal length of this shift? If we shift dominoes by <nowiki><math> x </math></nowiki> then the total extra weight we add to the left is proportional to <nowiki><math> (n-1) \cdot x </math></nowiki>, and the same weight is removed from the right. We need to balance it with the weight of the portion of the lowest domino in the stack which remains at the right (rests entirely on top of the domino in the base). Assuming that the length of each domino is 1, this weight is proportional to 1-x. Therefore we must have 1- x = 2(n-1)x
 +
 
 
Continuing in the same way for <math>  n </math>  dominos, the first overhanging by 1/2, the second by 1/4, the third by 1/6,..., the <math>  n </math>-th by <math>  1/2n </math>, we get the total length of <math>  1/2 +1/4+1/6+\dots +1/2n = \frac{1}{2}(1+1/2+1/3+…+1/n)</math>. Since the harmonic series diverges, we can get ''any'' length as soon as we have enough dominos!
 
Continuing in the same way for <math>  n </math>  dominos, the first overhanging by 1/2, the second by 1/4, the third by 1/6,..., the <math>  n </math>-th by <math>  1/2n </math>, we get the total length of <math>  1/2 +1/4+1/6+\dots +1/2n = \frac{1}{2}(1+1/2+1/3+…+1/n)</math>. Since the harmonic series diverges, we can get ''any'' length as soon as we have enough dominos!

Revision as of 20:54, 15 January 2022

How long can dominoes (or blocks, tiles etc.) stack be? Can it be 50 cm? 1m? 1 km? Let’s take a look:

Domino stacks
Domino stacks

For each of the stacks above we need to make sure that it does not collapse. Suppose that we have already built a stack of <math> n </math> dominoes. We then take this stack and place it on top of the next domino, shifting the stack over as much as we can without tipping it over. What is the maximal length of this shift? If we shift dominoes by <math> x </math> then the total extra weight we add to the left is proportional to <math> (n-1) \cdot x </math>, and the same weight is removed from the right. We need to balance it with the weight of the portion of the lowest domino in the stack which remains at the right (rests entirely on top of the domino in the base). Assuming that the length of each domino is 1, this weight is proportional to 1-x. Therefore we must have 1- x = 2(n-1)x

Continuing in the same way for [math]\displaystyle{ n }[/math] dominos, the first overhanging by 1/2, the second by 1/4, the third by 1/6,..., the [math]\displaystyle{ n }[/math]-th by [math]\displaystyle{ 1/2n }[/math], we get the total length of [math]\displaystyle{ 1/2 +1/4+1/6+\dots +1/2n = \frac{1}{2}(1+1/2+1/3+…+1/n) }[/math]. Since the harmonic series diverges, we can get any length as soon as we have enough dominos!