Does the prime number P divides n!
(i) The prime number P divides n!+(n+2)!
(ii) The Prime number divides (n+2)!/n!
(i) The prime number P divides n!+(n+2)!
(ii) The Prime number divides (n+2)!/n!
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
narik11 wrote:Does the prime number P divides n!
(i) The prime number P divides n!+(n+2)!
(ii) The Prime number divides (n+2)!/n!
Not Quite Right..sanju09 wrote:narik11 wrote:Does the prime number P divides n!
(i) The prime number P divides n!+(n+2)!
(ii) The Prime number divides (n+2)!/n!
Is n! = P x, where n, x are positive integers and P being a prime?
[1] It reads n! + (n + 2)! = P y, where y is a positive integer.
Or, n! + (n + 2) (n + 1) n! = P y
Or, n! (n^2 + 3 n + 3) = P y.
Obscurity what's left...P could be either a factor n! or a factor of (n^2 + 3 n + 3), or may be of both. Insufficient
[2] It reads that P is a factor of (n^2 + 3 n + 3), or we accidentally get a gem that if n is a positive integer, then (n^2 + 3 n + 3) is a prime. Now, if a prime is a factor of a prime, then it's the prime itself, hence, P = (n^2 + 3 n + 3), take an example for n like if n = 2, then P is 19. Here, 2! Is not containing 19 as one factor, and this is pretty sure that (n^2 + 3 n + 3) > n, hence the prime P would be greater than any element in the flag march of the factorial of n, a positive integer; hence the answer is always NO. Sufficient
[spoiler]B[/spoiler]
When we try factoring n! + (n + 2)!, it unfolds likerohan_vus wrote:Not Quite Right..sanju09 wrote:narik11 wrote:Does the prime number P divides n!
(i) The prime number P divides n!+(n+2)!
(ii) The Prime number divides (n+2)!/n!
Is n! = P x, where n, x are positive integers and P being a prime?
[1] It reads n! + (n + 2)! = P y, where y is a positive integer.
Or, n! + (n + 2) (n + 1) n! = P y
Or, n! (n^2 + 3 n + 3) = P y.
Obscurity what's left...P could be either a factor n! or a factor of (n^2 + 3 n + 3), or may be of both. Insufficient
[2] It reads that P is a factor of (n^2 + 3 n + 3), or we accidentally get a gem that if n is a positive integer, then (n^2 + 3 n + 3) is a prime. Now, if a prime is a factor of a prime, then it's the prime itself, hence, P = (n^2 + 3 n + 3), take an example for n like if n = 2, then P is 19. Here, 2! Is not containing 19 as one factor, and this is pretty sure that (n^2 + 3 n + 3) > n, hence the prime P would be greater than any element in the flag march of the factorial of n, a positive integer; hence the answer is always NO. Sufficient
[spoiler]B[/spoiler]
Firstly, stmnt B reduces to n^2 + 3 n + 2 and not n^2 + 3 n + 3...
Secondly, Even if u use n^2 + 3 n + 3 , still u cant generalize n^2 + 3 n + 3 as a prime number..take n = 3 , it reduces the expression to 21 which is not a prime.... So the P = n^2 + 3 n + 3 is not correct
What is (n + 2)!/n! equal to? Yeah yo're right! Thanksrohan_vus wrote:Stmnt B is not n! + (n+2)! but (n+2)!/n! , so still it wont be n^2 + 3n+3 .....
New here Create free account