A pyramid was divided into parts (1 pyramid and 23 frustums) by n=23 planes parallel to its base according to two principles. First, such that the volumes of the parts are equal, and then such that the areas of the lateral surfaces of the parts are equal. Show that the two sets of planes have a common plane.
List all values of n up to 100 for which this statement holds. Is there any n for which more than one such common plane exists?
Solution
1. Instead of truncated pyramids, we examine the pyramids defined by the apex of the original pyramid and planes parallel to its base. Let the distances of these planes from the common apex be m1,m2,…,m24(m24=m, the height of the original pyramid). If the volume of the original pyramid is V, then the volume of the pyramid at height mi according to the division is Vi=24iV, so VVi=24i,i=1,2,…,23.
!
The triangles forming the sides of the pyramids and the base triangles are similar, with the ratio of corresponding edges being mmi, hence VVi=m3mi3. From the two equalities, it follows that
mi=m324i
In the second division, the lateral surface area of the pyramid at height mk′ is Fk=24kF, where F is the lateral surface area of the original pyramid, k=1,2,…,23, so FFk=24k. By similarity, FFk=m2mk′2, hence mk′=m24k.
The two sets of planes have a common plane if for some pair of numbers i,k it holds that mi=mk′. This means that
324i=24k,or24i2=k3
Since 24=3⋅23, the pair i=3,k=6 satisfies the condition: the third plane of the first division coincides with the sixth plane of the second division. This plane bisects the pyramid at half its height, above it is the (21)3=243 part of the volume V and the (21)2=246 part of the lateral surface area F.
2. If the pyramid is divided into parts by n planes according to the two principles, then similarly to the above, the condition is the equation
(n+1)i2=k3,1≤i,k≤n
For which values of (n+1) does the two n-element sets of planes have a common plane?
If (n+1) in its prime factorization does not contain a third or higher power, then the equation has no solution under the condition 1≤i,k≤n. In this case, in the factorization of (n+1), the exponent of every prime number is either α=1 or α=2, and i2 must (for the purpose of k3) raise it to 3 or a multiple of 3, from α=1 to at least 3, and from α=2 to at least 6, since the exponent in i2 is even. Thus, i must contain every prime factor of (n+1) with at least as large an exponent as (n+1) itself, which is only possible if i≥n+1.
However, if n+1=q⋅p3, where p>1 and q are natural numbers, then for example, the pair i=q,k=q⋅p is a solution to the equation for every q=1,2,3,…. The cubes less than 100 are 8,27,64, so the corresponding values of n are:
7,15,23,26,31,39,47,53,55,63,71,79,80,87,95.
We already notice here that n=63 can be obtained in two different ways: 63=8⋅23−1=1⋅43−1, so here we get two common planes: i=8,k=16 and i=1,k=4.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.