Option (B) is correct.
Explanation:
Assertion (A): The k-th odd number is 2k−1, so round 50 has 2×50−1=99 dots. Round 1 is a 1 by 1 square. The 3 dots of round 2 form an L-shaped border that turns it into a 2 by 2 square; the 5 dots of round 3 turn it into a 3 by 3 square. In general, going from a (k−1) by (k−1) square to a k by k square needs
k2−(k−1)2=2k−1
dots, which is exactly the k-th odd number. So the dots of all 50 rounds make a 50 by 50 square, and
1+3+5+⋯+99=502=2500
Assertion (A) is true.
Reason (R): Writing 1+2+⋯+n forwards and backwards and adding gives n pairs, each adding to n+1, so the sum is 2n(n+1). Reason (R) is true.
Link: R can be used to check the total in a roundabout way: each odd number is 2k−1, so
1+3+⋯+99=2(1+2+⋯+50)−50=2×1275−50=2500
But Assertion (A) claims more than the total: it says the dots form a complete 50 by 50 square, and gives the L-shaped borders as the reason. R is about adding consecutive numbers and says nothing about why each round closes up a bigger square. The reason for A is k2−(k−1)2=2k−1, the L-border picture. So R is true but is not the correct explanation of A.
Why the other options are wrong
- (A) Both statements are true, and R can be used to confirm the number 2500, but it does not explain why the dots form a 50 by 50 square; that comes from the L-shaped borders, k2−(k−1)2=2k−1.
- (C) Reason (R) is true; it is the sum of the first n natural numbers proved by reversing and adding.
- (D) Assertion (A) is true: the odd numbers from 1 to 99 add up to 502=2500.