Proof by contradiction  polynomials and infinite primesby bloynoys Tags: contradiction, infinite, polynomials, primes, proof 

#1
Oct311, 08:53 PM

P: 24

1. The problem statement, all variables and given/known data
Two Questions: 1. Prove, by contradiction, that if a and b are integers and b is odd,, then 1 is not a root of f(x)= ax^2+bx+a. 2. Prove, by contradiction, that there are infinitely many primes as follows. Assume that there only finite primes. Let P be the largest prime. Explain why there is a prime dividing P!+1 and find the the contradiction. 2. Relevant equations For both, assume the contradiction work towards finding it is impossible. 3. The attempt at a solution 1. (x1)(xa)=ax^2+bx+a Not sure where to go from there 2. This is not a normal infinite prime solutions as we have gone over a few of the solutions in class. I am not sure what she means by "there is a prime dividing P!+1" as that isn't really a clear sentence. Any Ideas? 



#2
Oct311, 10:03 PM

Mentor
P: 16,565





#3
Oct311, 10:16 PM

P: 24

Maybe I am just confused to how to relate the P!+1 to P. Is it P/(P!+1)? Or (P!+1)/P and that just eliminates the "largest prime?" So it is the second largest prime plus one?
And for the first one, a root means that it is one of the solutions to an equation. I realize this looks dumb as this is an easyish problem, but we are working on this in a high level undergrad math course. I am just drawing a blank on the intermediate steps to set these problems up. Oh and I believe I made a mistake. It should read: (x+1)(x+a)=ax^2+bx+a correct? 



#4
Oct311, 10:18 PM

Mentor
P: 16,565

Proof by contradiction  polynomials and infinite primesIn general, there is always a prime that divides P!+1 for any P. 



#5
Oct311, 10:26 PM

P: 24

Wow, holy cow, that was a whole lot easier than I thought for the first one. I just had my head focused in on a multiple root function and didn't think about the f(x)=0. Thank you for that!
And wow on the second one as well. She basically spelled out the definition of prime numbers, and then added one. It was the word dividing that had me confused. I knew they weren't as hard as I was making them but wow, I really shouldn't overlook stuff like that. Thank you for all your help! 


Register to reply 
Related Discussions  
Euler's proof of infinite primes and his product formula.  General Math  9  
Infinite number of primes?  General Math  8  
Euclid Proof of Infinite Primes  General Math  7  
infinite primes?  Linear & Abstract Algebra  8  
Infinite primes using Quadratic Residues  Linear & Abstract Algebra  1 