Stacking Blocks Fun

You want to stack blocks, as shown, in such a way that they don't fall and the overhang H ( n ) H_{(n)} is maximized. Each block has the same length l = 1 m . l=1\text{ m}.

To 2 decimal places, evaluate lim n H ( n ) ln ( n ) , \lim_{n\to\infty} \frac{H_{(n)}}{\ln(n)}, where ln ( ) \ln(\cdot) is the natural logarithm.

Note: Let M M be the positive integer for which the equilibrium is unstable, no matter the position of the blocks. Then H M = H M + 1 = = 0 H_{M}=H_{M+1}=\dots=0 .


The answer is 0.50.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Let 2 L 2L be the length of a block and m m its mass. Consider the situation showed: a pile of N + 1 N+1 blocks can be thought as a pile of N N above one, with center of mass displaced x x from the border of the table, which we will choose as origin. In the case of maximum overhang, x x is also the position of the edge of the bottom block, whose center of mass is in ( L x ) -(L-x) . To achieve equilibrium the center of mass of the system should be in the position x = 0 x=0 , which gives m ( N x ( L x ) ) m ( N + 1 ) = 0 \frac{m \cdot (Nx-(L-x))}{m \cdot (N+1)}=0 resulting in x = L N + 1 x=\frac{L}{N+1} .

The situation of the problem can't be solved exactly like this, however we can imagine repeating this reasonment for each block starting from the higher one, finding a relative displacement between the center of mass of two consecutive blocks of x = L N + 1 x=\frac{L}{N+1} . Here you can check that for example the "big block" equivalent to the higher two has a center of mass which is displaced by L L from the one of the third block.

The overhang is therefore H ( N ) = L 1 N 1 k + 1 , H_{(N)}=L \cdot \sum_{1}^{N} \frac{1}{k+1}, the armonic series, which tends to L ( l n ( N ) + γ ) L \cdot ( ln(N)+\gamma) as N N tends to infinity. Plugging L = 1 2 L= \frac{1}{2} leads to the answer 0.500 0.500 .

Curiosity: γ 0.577 \gamma \simeq 0.577 \dots is known as Euler-Mascheroni constant .

The limit as n > n->\infty of

I n ( n ) + γ I n ( n ) \dfrac{In(n)+\gamma}{In(n)}

is 1 1 , not γ \gamma

Maybe ask for the limit of H ( n ) 1 I n ( n ) H_{(n)}-1-In(n) ? Then the correct answer would be γ \gamma .

Michael Mendrin - 2 years, 10 months ago

Log in to reply

But the limit is l 2 \frac{l}{2} , which is 0.5 0.5 , not γ \gamma .

Gabriele Manganelli - 2 years, 10 months ago

Log in to reply

In fact, k = 1 n 1 k + 1 = H ( n ) 1 \displaystyle \sum _{ k=1 }^{ n }{ \dfrac { 1 }{ k+1 } }= H(n) - 1 , where H ( n ) H(n) is the Harmonic Function. The limit as n > n->\infty of H ( n ) 1 L o g ( n ) H(n)-1 - Log(n) is γ 1 \gamma -1 . On the other hand, the limit of the ratio H ( n ) 1 L o g ( n ) \dfrac{H(n)-1}{Log(n)} is 1 1 .

Michael Mendrin - 2 years, 10 months ago

Log in to reply

@Michael Mendrin Perfect (so there is no problem right?). That expression has to be multiplied by half the length of a block in order to obtain the physical overhang fron the table of the pile of blocks.

Gabriele Manganelli - 2 years, 10 months ago

Log in to reply

@Gabriele Manganelli Wait a minute, is the correct answer 0.5 0.5 or 0.577... 0.577... ? But, yes, if L = 1 2 L=\frac{1}{2} , then the ratio becomes 0.5 0.5 .

Michael Mendrin - 2 years, 10 months ago

Log in to reply

@Michael Mendrin The correct answer is 0.50 0.50 .

Gabriele Manganelli - 2 years, 10 months ago

Log in to reply

@Gabriele Manganelli well, check the wording of the bottom of your solution

Michael Mendrin - 2 years, 10 months ago

Log in to reply

@Michael Mendrin Sorry for the misleading way I wrote it before, thank you for your time

Gabriele Manganelli - 2 years, 10 months ago

Log in to reply

@Gabriele Manganelli I actually liked the way γ \gamma came up with this problem, but oh well.

This problem of building an overhanging tower of blocks is an old one, but it still boggles my mind, that it could overhang without limit.

Michael Mendrin - 2 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...