anonymous
  • anonymous
Denote by pk the kth prime number. Show that p1p2...pn +1 cannot be the perfect square of an integer.
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
jamiebookeater
  • jamiebookeater
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
i am not sure i understand the question, but the product of n primes ( or the first n primes) cannot be a perfect square by the fundamental theorem of algebra. \[n=p_1^{\alpha _1}p_2^{\alpha _2}...p_j^{\alpha _j}\implies n^2=2p_1^{\alpha _1}p_2^{2\alpha _2}...p_j^{2\alpha _j}\]
anonymous
  • anonymous
You missed the plus one at the end of the product of primes
anonymous
  • anonymous
ooooh i see. sorry. i thought that was a subscript. so this number leaves a remainder of one when dividing by each smaller prime. i am sure you can use that to show it is not the square of something

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

asnaseer
  • asnaseer
As @satellite73 said, any number n can be written as:\[n=p_1^{\alpha _1}p_2^{\alpha _2}...p_j^{\alpha _j}\]\[\therefore n^2=p_1^{2\alpha _1}p_2^{2\alpha _2}...p_j^{2\alpha _j}\]and we know that:\[p_1p_2p_3...p_j+1\]is not divisible by any of the primes \(p_1\) to \(p_j\)therefore it cannot be the square of an integer? I /think/ this proves it?
asnaseer
  • asnaseer
because the square HAS to divisible by primes less than itself and:\[p_1p_2...p_j+1\]is NOT divisible by any of the primes less than it.
anonymous
  • anonymous
My proof is Suppose that \[p_{1}p_{2}p_{3}p_{4}p_{5}p_{6}...p_{j} + 1 = m^{2}\] \[p_{1}p_{2}p_{3}p_{4}p_{5}p_{6}..p_{j} = (m-1)(m+1)\] m+1 or m-1 must be an even number since 2 is a prime number m must be odd If m is odd, then m + 1 and m - 1 are even numbers But there is only one even number in the set of prime numbers Therefore p1p2...pn +1 cannot be the perfect square of an integer.
asnaseer
  • asnaseer
how do you conclude the last part? But there is only one even number in the set of prime numbers <--- TRUE Therefore p1p2...pn +1 cannot be the perfect square of an integer. <--- WHY?
asnaseer
  • asnaseer
wait - I just got it! - your method is quite clever

Looking for something else?

Not the answer you are looking for? Search for more explanations.