Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

n(n+1)(n-1) is divisible by 8 if any or all of its terms are divisible by 8.
Lets assume X=[1,96];
The probability P that X is divisible by 8 is P = 1/8.
X could be equal to n or (n-1) or (n+1), so there are 3 possible favorable outcomes out of 8 possible outcomes.

I'd go with C 1/2
We need the expression n(n+1)(n-1) to contain 2^3 to be divisible by 8
Plug in 1, 2, 3, 4... and you will see that every other 2nd number starting with 1 will have 2^3 in it. _________________

the total cases : 96
favorable :
for all multiples of 8 we have 3 triplets i.e in total 12 * 3 = 36 triplets
for all odd multiples of 4 we have 2 triplets so 12 *2 = 24

OA is E.
the key here is to determine the favorable outcomes for the task: either 12x3, either 12x2, either 12 events
(n-1)n(n+1)
12 12 12
12 12
12
The total sum of favorable outcomes is 12x3 + 12x2 + 12 = 72
So it is 72/96 = 3/4.

Any odd number value of n would be divisible by 8. ex. 3(3+1)(3-1) or 5(5+1)(5-1) etc. - we have 48 odd numbers between 1 and 96.

Also numbers such as 8, 16, 24....are divisible by 8. There are 96/8 = 12 such numbers.

In total 48 + 12 = 60 numbers.

prob = 60/96 = 5/8.

Venksune, I took the same approach as you but I dont get 5/8. This is the problem I have can you help?

In your approach you seem to be counting the odd number 1. But the set (1,2,0) does not exist because the range is from 1 to 96. Besides 2 is not not is not divisible by 8. So, I get 47 + 12 = 59.

we are choosing a number n from 1 to 96. If we choose n=1, then we have (n-1)(n)(n+1)=0. However, 0/8 is still 0. 0 is divisible by 8. then next odd number is 3 in which case (n-1)(n)(n+1) would be 2*3*4 = 24, which is divisble by 8. Same is the case with 5...so on - totalling to 48 of them that are divisible by 8.

I didn't quite get your reference to 2.

I feel that the question will have NO ambiguity if it reads n(n+1)(n+2)

gayathri, the result set is (1,2,0) meaning that when you take 1, you get 1*(1+1)*(1-1) = 1*2*0 = 0
0 IS a multiple of 8
Hence, take every odd number from the domain, 1 to 96, you will have a number divisible by 8 and there are 48 of those. But as Venksune explained, every even number that is a multiple of 8 will also give a result divisible by 8 and there are 12 of those.

Type of Visa: You will be applying for a Non-Immigrant F-1 (Student) US Visa. Applying for a Visa: Create an account on: https://cgifederal.secure.force.com/?language=Englishcountry=India Complete...