Skip to content
V. Numerical Problems · Q7

Q.On the edge of a wall, we build a brick tower that only holds together because of the bricks' own weight. Our goal is to build a stable tower whose overhang dd is greater than the length ℓ\ell of a single brick. What is the minimum number of bricks you need? [Hint: Find the center of mass for each brick and add.]

Tamil Nadu DgeTextbookSubjectiveImportance★★★★★est
40% · 35/87 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Step 1. Set up the stacking rule. Build the tower from the top brick downward. For any group of the topmost kk bricks (each of length ℓ\ell), treated as a single rigid unit, the maximum they can overhang the brick immediately below them — without the whole group toppling — is exactly reached when the combined center of mass of the top kk bricks sits directly above the very edge of the (k+1)(k+1)-th brick. Any further overhang and the group topples; this is the greatest stable overhang, since the problem asks for the minimum number of bricks for a given required overhang, using the best (maximum-overhang) stacking at every stage.

Step 2. Find the extra overhang contributed when going from kk bricks to k+1k+1 bricks. Adding the (k+1)(k+1)-th brick beneath a stable stack of kk bricks (whose combined center of mass is known), the new combined center of mass (of all k+1k+1 bricks) shifts by an amount inversely proportional to kk; working through the center-of-mass balance (treating the top kk bricks, of total mass km0km_0 for single-brick mass m0m_0, as concentrated at their own combined center of mass, positioned at the very edge of brick k+1k+1), the additional overhang gained at this step is

Δk=ℓ2k.\Delta_k=\frac{\ell}{2k}.

Step 3. Sum the overhangs to get the total overhang after nn bricks. Starting from the top (brick 1, contributing nothing extra since it is the very first) and adding each subsequent brick below it, the total overhang beyond the edge of the bottom (table or wall) support, after nn bricks, is

dn=∑k=1n−1ℓ2k=ℓ2(1+12+13+⋯+1n−1)=ℓ2Hn−1,d_n=\sum_{k=1}^{n-1}\frac{\ell}{2k}=\frac{\ell}{2}\left(1+\frac12+\frac13+\cdots+\frac{1}{n-1}\right)=\frac{\ell}{2}H_{n-1},

where Hn−1H_{n-1} is the (n−1)(n-1)-th harmonic number.

Step 4. Apply the required condition, dn>ℓd_n>\ell. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.