There are 100 tokens numbered from 1 to 100. In how many ways can two tokens be drawn simultaneously so that their sum is more than 100?
4950
5050
2500
2550
5000
I got the above Problem on the daily problems. I wasn't able to construe the explanation in the link. So I thought to post a new thread.
While solving the problem I took more than 2 mins so went on to guestimate -- by which I got 2500 [my way of estimation was -- 100C2 total no. of ways of choosing any 2 tokens and now the 2 nos chosen are interchangeable I divided 100C2 by 2, getting 2475 which is close to 2500 and so I went with this one. I am sure my method is flawed.]
Pls can someone help attacking this PS? Thanks.
[spoiler](OA is apparently 2500)[/spoiler]
4950
5050
2500
2550
5000
I got the above Problem on the daily problems. I wasn't able to construe the explanation in the link. So I thought to post a new thread.
While solving the problem I took more than 2 mins so went on to guestimate -- by which I got 2500 [my way of estimation was -- 100C2 total no. of ways of choosing any 2 tokens and now the 2 nos chosen are interchangeable I divided 100C2 by 2, getting 2475 which is close to 2500 and so I went with this one. I am sure my method is flawed.]
Pls can someone help attacking this PS? Thanks.
[spoiler](OA is apparently 2500)[/spoiler]
