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 500,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:

1) if n is even, n(n+1)(n+2) is necessarily a multiple of 8 when n>=2

n = 2K:
= 2K(2K+1)(2K+2)
= 4K(2K+1)(K+1)

Using the above, all I can say is it is a multiple of 4.

Let us proceed further..

K even: If K is even, we can tell that above is a multiple of 8.

K Odd: If K is odd = 2P-1
=4(2P-1)(2P-2 +1) (2P-1 +1)
=4(2P-1)(2P-1)(2p)
Aha ... it is a multiple of 8!
Proved!

2) if n is odd, then n(n+1)(n+2) is a multiple of 8 if only (n+1) is.

n = 2K-1:
=(2K-1)(2K)(2K+1)
=2(2K-1)(K)(2K+1)

Using the above, all I can say is it is a multiple of 2.

Although, we can say that the above product is a multiple of 8 if n is odd only if n+1 is a multiple of 8 looking at the product as n and n+2 will still be odd.
Proved.

Re: If an integer n is to be chosen at random from the integers [#permalink]

Show Tags

17 Oct 2013, 14:46

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email. _________________

Re: If an integer n is to be chosen at random from the integers [#permalink]

Show Tags

18 Oct 2013, 00:40

3

This post received KUDOS

Expert's post

5

This post was BOOKMARKED

If an integer n is to be chosen at random from the integers 1 to 96, inclusive, what is the probability that n(n + 1)(n + 2) will be divisible by 8?

A. 1/4 B. 3/8 C. 1/2 D. 5/8 E. 3/4

\(n(n + 1)(n + 2)\) is divisible by 8 in two cases:

A. \(n=even\), in this case \(n+2=even\) too and as \(n\) and \(n+2\) are consecutive even integers one of them is also divisible by 4, so their product is divisible by 2*4=8; B. \(n+1\) is itself divisible by 8;

(Notice that these two sets have no overlaps, as when \(n\) and \(n+2\) are even then \(n+1\) is odd and when \(n+1\) is divisible by 8 (so even) then \(n\) and \(n+2\) are odd.)

Now, in EACH following groups of 8 numbers: {1-8}, {9-16}, {17-24}, ..., {89-96} there are EXACTLY 5 numbers satisfying the above two condition for n, for example in {1, 2, 3, 4, 5, 6, 7, 8} n can be: 2, 4, 6, 8 (n=even), or 7 (n+1 is divisible by 8). So, the overall probability is 5/8.

http://blog.ryandumlao.com/wp-content/uploads/2016/05/IMG_20130807_232118.jpg The GMAT is the biggest point of worry for most aspiring applicants, and with good reason. It’s another standardized test when most of us...

Strategy, innovation, marketing, finance... The second module has been pretty engaging. Though, no lack of memorable times. There is no lack of high profile guest speakers. One of the...