I have a bag of cards numbered from 1 to 100 while my friend has a bag of cards numbered from 1 to 200. The goal is for me to successively pick two cards without replacement from my bag, such that the sum is equal to the single card that my friend picks from his bag. For example, if my friend picks up the card 4, then I must pick up or . I cannot pick up .
Over all card choices, how many ways can the goal be met?
Note: Order does matter.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No matter what cards I choose, my friend would always have 1 way to choose the card that is the sum of mine. Thus, we simply need to find how many ways I can select two cards, which is 99*100=9900.