BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

the value f n

Expert replies
Source: — Problem Solving |

by [email protected] » Mon Mar 07, 2016 10:21 pm
Hi didieravoaka,

There's a nice discussion of this question here:

https://www.beatthegmat.com/probability- ... 76490.html

GMAT assassins aren't born, they're made,
Rich
Contact Rich at [email protected]
Image
Join the discussion

by Matt@VeritasPrep » Thu Mar 17, 2016 9:14 pm
You need either n to be divisible by 3 or (n + 1) to be divisible by 3; in other words, you need n to have remainder 0 or remainder 2 when divided by 3.

If we consider all the integers (negative, positive, 0, whatever), exactly (1/3) of them have remainder 0 when divided by 3 and exactly (1/3) of them have remainder 2. So (2/3) of all integers fit our criteria.

In this case, the same idea holds: we have 99 integers, (1/3) of which have remainder 0 and (1/3) of which have remainder 2, so (2/3) of our numbers do the trick.
Join the discussion