Option (B) is correct.
Explanation:
Assertion (A) is true. Pair each number k with 101−k, for k=1,2,…,50. This uses every number from 1 to 100 exactly once. Expand (101−k)99 with first quantity 101 and second quantity −k:
(101−k)99=10199−99C110198k+99C210197k2−⋯+99C98101k98−k99
Every term except the last has the factor 101. The last term is (−k)99=−k99, negative because 99 is odd. So
(101−k)99+k99=101×(an integer)
The sum in A is the total of these 50 pairs, so it is divisible by 101.
Reason (R) is true. 1+2+⋯+100=2100×101=5050=101×50.
Link. R is about the numbers themselves, where each pair adds to exactly 101: k+(101−k)=101. For the 99th powers a pair does not add to 101; it is a multiple of 101 only because of the binomial expansion above and because the index 99 is odd. With an even index the same pairing fails: 12+1002=10001=101×99+2. R says nothing about powers or about the index being odd, so it does not explain A.
Why the other options are wrong
- (A) would need R to explain A. R gives the pairing only for first powers; the step (101−k)99+k99=101×(integer) comes from the binomial theorem, not from R.
- (C) needs R to be false. R is true: 5050=101×50.
- (D) needs A to be false. A is true: each pair k99+(101−k)99 is a multiple of 101.