Remainder

This topic has expert replies
Master | Next Rank: 500 Posts
Posts: 113
Joined: Wed Dec 07, 2011 7:20 am
Thanked: 3 times

Remainder

by manik11 » Thu Nov 05, 2015 4:11 am
Given n>5,when (n!+n+1)is divided by (n+1),what is the remainder ?

(1) (n+2) is a prime number.

(2) (n−2) is a prime number.

Hi Experts...I could really use some help on this one. I simplified the question down to [n!/(n+1) +1],but after that I have got no clue how to proceed further.

Would really appreciate if you guys could post links to some problems, which use similar concept.

OA : D
Source : Veritas Prep
Source: — Data Sufficiency |

User avatar
GMAT Instructor
Posts: 15539
Joined: Tue May 25, 2010 12:04 pm
Location: New York, NY
Thanked: 13060 times
Followed by:1906 members
GMAT Score:790

by GMATGuruNY » Thu Nov 05, 2015 6:28 am
manik11 wrote:Given n>5,when (n!+n+1)is divided by (n+1),what is the remainder ?

(1) (n+2) is a prime number.

(2) (n−2) is a prime number.
Statement 1: (n+2) is a prime number
Case 1: n+2 = 11, implying that n=9
Plugging n=9 into (n! + n+1)/(n+1), we get:
(9! + 10)/10 = (multiple of 10 + 10)/10 = (multiple of 10)/10.
Since 10 can divide evenly into any multiple of 10, the remainder will be 0.

Case 2: n+2 = 13, implying that n=11
Plugging n=11 into (n! + n+1)/(n+1), we get:
(11! + 12)/12 = (multiple of 12 + 12)/12 = (multiple of 12)/12.
Since 12 can divide evenly into any multiple of 12, the remainder will be 0.

Case 3: n+2 = 37, implying that n=35
Plugging n=35 into (n! + n+1)/(n+1), we get:
(35! + 36)/35 = (multiple of 36 + 36)/36 = (multiple of 36)/36.
Since 36 can divide evenly into any multiple of 36, the remainder will be 0.

In every case, the remainder is 0.
SUFFICIENT.

Statement 2: (n-2) is a prime number
Case 1: n-2 = 11, implying that n=13
Plugging n=13 into (n! + n+1)/(n+1), we get:
(13! + 14)/14 = (multiple of 14 + 14)/14 = (multiple of 14)/14.
Since 14 can divide evenly into any multiple of 14, the remainder will be 0.

Case 2: n-2 = 13, implying that n=15
Plugging n=15 into (n! + n+1)/(n+1), we get:
(15! + 16)/16 = (multiple of 16 + 16)/16 = (multiple of 16)/16.
Since 16 can divide evenly into any multiple of 16, the remainder will be 0.

Case 3: n-2 = 37, implying that n=39
Plugging n=39 into (n! + n+1)/(n+1), we get:
(39! + 40)/40 = (multiple of 40 + 40)/40 = (multiple of 40)/40.
Since 40 can divide evenly into any multiple of 40, the remainder will be 0.

In every case, the remainder is 0.
SUFFICIENT.

The correct answer is D.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3