(1) We perform the operation on P0. It is easy to see that each side of P0 becomes 4 sides of P1. So the number of sides of P1 is 3⋅4. In the same way, we operate on P1. Each side of P1 becomes 4 sides of P2. So the number of sides of P2 is 3⋅42. Consequently, it is not difficult to get that the number of sides of Pn is 3⋅4n.
It is known that the area of P0 is S0=1. Comparing P1 with P0, it is easy to see that we add to P1 a smaller equilateral triangle with area 321 on each side of P0. Since P0 has 3 sides, so
S1=S0+3⋅321=1+31.
Again, comparing P2 with P1, we see that P2 has an additional smaller equilateral triangle with area 321⋅321 on each side of P1, and P1 has 3⋅4 sides. So that
S2=S1+3⋅4⋅341=1+31+334.
Similarly, we have
S3=S2+3⋅4⋅361=1+31+334+3542.
Hence, we have
Sn=1+31+334+3542+⋯+32n−14n−1=1+k=1∑n32k−14k−1=1+43k=1∑n(94)k=1+43⋅94⋅[1−(94)n]=1+53[1−(94)n]=58−53⋅(94)n.(*)
We will prove (∗) by mathematical induction as follows:
When n=1, it is known that (∗) holds from above.
Suppose, when n=k, we have Sk=58−53⋅(94)k.
When n=k+1, it is easy to see that, after k+1 times of operations, by comparing Pk+1 with Pk, we have added to Pk+1 a smaller equilateral triangle with area 32(k+1)1 on each side of Pk and Pk has 3⋅4k sides. So we get
Sk+1=Sk+3⋅4k⋅32(k+1)1=Sk+32k+14k=58−53⋅(94)k+1.
By mathematical induction, (∗) is proved.
(2) From (1), we have Sn=58−53⋅(94)n.
Therefore,
n→∞limSn=n→∞lim[58−53⋅(94)n]=58.