Hi All,
These type of 'large sum' questions can be approached in a variety of ways, but there will always be a pattern involved. We can use BUNCHING to solve this problem.
Here, we're asked for all of the ODD multiples of 5 from 1 to 500....
To start, take the 1st multiple of 5 involved and add it to the last multiple of 5 involved.
5+495 = 500
Next, take the 2nd multiple of 5 involved and the second-to-last multiple of 5 involved....
15 + 485 = 500
This proves that there are a certain number of "500s" in this sequence. We have to figure out how many and if there is an "unpaired" term in the middle. Given the restrictions in this prompt, we're taking 1 number out of every 10 consecutive numbers....
The '5' out of 1 through 10
The '15' out of 11 through 20
The '25' out of 21 through 30,
Etc.
Since we're dealing with the numbers from 1 to 500, we're dealing with 50 sets of 10. This means that we are taking the sum of 50 numbers....
50 numbers --> 25 pairs (and each pair totals 500)
25(500) = 12,500
Final Answer:
GMAT assassins aren't born, they're made,
Rich