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

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

Number System

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
User avatar
Legendary Member
Posts: 504
Joined: Tue Apr 19, 2011 1:40 pmFollowed by: 11 members
Thanked: 114 times
by knight247 » Wed Aug 03, 2011 5:26 am
Does the prime number p divide N!
(1) The prime number p divides N!+(N+2)!
(2) The prime number p divides (N+2)!/N!

Don't have the OA on this one. According to me it is A.Because when two multiples of a number are added the resultant sum is also a multiple of that number. For statement two, I plugged in numbers and managed to figure that it is insufficient. Am I correct? Detailed explanations would be appreciated
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Data Sufficiency |
Legendary Member
Posts: 1448
Joined: Tue May 17, 2011 9:55 amFollowed by: 53 members
Location: India
Thanked: 375 times

by Frankenstein » Wed Aug 03, 2011 6:59 am
Hi,
Because when two multiples of a number are added the resultant sum is also a multiple of that number.
True. But you are assuming the converse is true. If a number is a factor of the sum of two numbers, each number doesn't necessarily be a multiple of the factor.
From(1):
Let n = 3
n!+(n+2)! = 3! + 5! = 126
p = 7 divides n!+(n+2)!, but it doesn't divide n! = 6 -> No
p = 3 divides n!+(n+2)!, it also divides n! = 6 -> Yes
Not sufficient

From(2):
Not sufficient(As you have already checked)

Both(1) and (2):
p is prime
p is a factor of (n+1)(n+2), i.e p is factor of either (n+1) or(n+2)
p is factor of n!+(n+2)! = n![1+(n+1)(n+2)]
So, p is factor of n! or [1+(n+1)(n+2)].
Since, 'p' is factor of (n+1)(n+2), it cannot be factor of 1+(n+1)(n+2). So, p has to be factor of n!.

Hence, C
Cheers!

Things are not what they appear to be... nor are they otherwise
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1