For any integer p, *p is equal to the product of all the integers between 1 and p, inclusive. How many prime numbers are there between *7 + 3 and *7 + 7, inclusive?
(A) None
(B) One
(C) Two
(D) Three
(E) Four
Prime numbers (Knewton Prep)
This topic has expert replies
-
- Master | Next Rank: 500 Posts
- Posts: 132
- Joined: Thu Dec 02, 2010 2:49 am
- Thanked: 5 times
-
- Newbie | Next Rank: 10 Posts
- Posts: 4
- Joined: Mon Mar 28, 2011 10:20 am
- manpsingh87
- Master | Next Rank: 500 Posts
- Posts: 436
- Joined: Tue Feb 08, 2011 3:07 am
- Thanked: 72 times
- Followed by:6 members
*p=p!; therefore *7=7!=5040; *7+3=5043 which is divisible by 3 hence not prime,RadiumBall wrote:For any integer p, *p is equal to the product of all the integers between 1 and p, inclusive. How many prime numbers are there between *7 + 3 and *7 + 7, inclusive?
(A) None
(B) One
(C) Two
(D) Three
(E) Four
5044, divisible by 2 hence not prime,
5045, divisible by 5 hence not prime,
5046 divisible by 2 hence not prime,
*7+7=5047 divisible by 7 hence not prime.
as there is no prime no. between *7+3 and *7+7 hence A..
O Excellence... my search for you is on... you can be far.. but not beyond my reach!
-
- Legendary Member
- Posts: 586
- Joined: Tue Jan 19, 2010 4:38 am
- Thanked: 31 times
- Followed by:5 members
- GMAT Score:730
thrs a similar gmat prep or og prb i remember.
Q asks number of primes betwn 7!+3 and 7!+7
7!+3=3[(1*2*4*5*6*7)+1]
similarly all others can be re written as multiples of 4,5,6 and 7
as we can see each is a multiple of some number it cannot be a prime.
as its 7! we can even calculate 7! but the above method is useful for higher factorials.
Q asks number of primes betwn 7!+3 and 7!+7
7!+3=3[(1*2*4*5*6*7)+1]
similarly all others can be re written as multiples of 4,5,6 and 7
as we can see each is a multiple of some number it cannot be a prime.
as its 7! we can even calculate 7! but the above method is useful for higher factorials.
-
- Master | Next Rank: 500 Posts
- Posts: 118
- Joined: Wed Mar 16, 2011 1:44 pm
- Location: Canada
- Followed by:2 members
- GMAT Score:530
rohu27 wrote:thrs a similar gmat prep or og prb i remember.
Q asks number of primes betwn 7!+3 and 7!+7
7!+3=3[(1*2*4*5*6*7)+1]
similarly all others can be re written as multiples of 4,5,6 and 7
as we can see each is a multiple of some number it cannot be a prime.
as its 7! we can even calculate 7! but the above method is useful for higher factorials.
Under this method, would it be a correct assessment to say if there was a remainder (+ a value) at the end of this equation that could not be factored out we would need to multiply the n! and add the remainder to determine if it is a prime number or not? Or is there another shortcut for this scenario?
For example, 7! + 11
btw - great shortcut!
-
- Master | Next Rank: 500 Posts
- Posts: 132
- Joined: Thu Dec 02, 2010 2:49 am
- Thanked: 5 times
- cans
- Legendary Member
- Posts: 1309
- Joined: Mon Apr 04, 2011 5:34 am
- Location: India
- Thanked: 310 times
- Followed by:123 members
- GMAT Score:750
This is the shortcut...rohu27 wrote: Q asks number of primes betwn 7!+3 and 7!+7
7!+3=3[(1*2*4*5*6*7)+1]
similarly all others can be re written as multiples of 4,5,6 and 7
as we can see each is a multiple of some number it cannot be a prime.
as its 7! we can even calculate 7! but the above method is useful for higher factorials.
- sourabh33
- Master | Next Rank: 500 Posts
- Posts: 135
- Joined: Tue Mar 22, 2011 12:01 pm
- Thanked: 21 times
- Followed by:3 members
- GMAT Score:720
Prime no -> any number that does not have a divisor other than 1 & itself
Now,
*7+3 = 3 x (1.2.4.5.6.7 + 1) -> This has more divisors other than 1 & *7+3
*7+4 = 4 x (1.2.3.5.6.7 + 1) -> This has more divisors other than 1 & *7+3
*7+5 = 5 x (1.2.3.4.6.7 + 1) -> This has more divisors other than 1 & *7+3
*7+6 = 6 x (1.2.3.4.5.7 + 1) -> This has more divisors other than 1 & *7+3
*7+7 = 7 x (1.2.3.4.5.6 + 1) -> This has more divisors other than 1 & *7+3
There no of primes = 0
Now,
*7+3 = 3 x (1.2.4.5.6.7 + 1) -> This has more divisors other than 1 & *7+3
*7+4 = 4 x (1.2.3.5.6.7 + 1) -> This has more divisors other than 1 & *7+3
*7+5 = 5 x (1.2.3.4.6.7 + 1) -> This has more divisors other than 1 & *7+3
*7+6 = 6 x (1.2.3.4.5.7 + 1) -> This has more divisors other than 1 & *7+3
*7+7 = 7 x (1.2.3.4.5.6 + 1) -> This has more divisors other than 1 & *7+3
There no of primes = 0
-
- Senior | Next Rank: 100 Posts
- Posts: 97
- Joined: Sun May 15, 2011 9:19 am
- Thanked: 18 times
- Followed by:1 members
If you add two multiples of any given number X, that sum will be divisible by X.Strongt wrote:I can find the answer by doing all the calculations, but this will take forever. Is there a shortcut for this type of questions?
By definition, 7! is a multiple of 3, 4, 5, 6 and 7. Therefore, the sum of 7! and any of those five numbers is divisible by that number.
To extend the concept, adding higher multiples of any of those numbers will still result in a non-prime number.