欢迎光临散文网 会员登陆 & 注册

[Series] Ladder of Pigeons

2021-07-07 14:33 作者:AoiSTZ23  | 我要投稿

By: Tao Steven Zheng (郑涛)

【Problem】

The following problem is attributed to Alcuin of York (c. 735 – 804 AD):

 Suppose there is a stairway which has 100 steps. One pigeon sat on the first step, two pigeons on the second step, three pigeons on the third step, four on the fourth step, five on the fifth step, and so on up to the hundredth step. How many pigeons are there altogether?

【Solution】

Let  S_n%3D1%2B2%2B3%2B%E2%8B%AF%2Bn%20 denote the sum of consecutive positive integers. Determine the formula for calculating this sum using the arithmetic series formula. The first term is a_1%3D1, and the final term is a_n%3Dn. Hence,


S_n%3D%20%5Cfrac%7Bn%7D%7B2%7D%20(a_1%2Ba_n)%0A

S_n%3D%5Cfrac%7Bn%7D%7B2%7D%20(1%2Bn)%0A%0A

S_n%3D%5Cfrac%7Bn(n%2B1)%7D%7B2%7D%0A


The total number of pigeons is the sum of the first 100 positive integers.

S_%7B100%7D%20%3D%20%5Csum_%7Bk%3D1%7D%5E%7B100%7D%20k%20

%5Csum_%7Bk%3D1%7D%5E%7B100%7Dk%3D%5Cfrac%7B100%5Ctimes(100%2B1)%7D%7B2%7D%20

 

Therefore, there are 5050 pigeons on the stairway.

Pigeons on stairway


[Series] Ladder of Pigeons的评论 (共 条)

分享到微博请遵守国家法律