Thread: Proof relating to prime numbers

Hi

I need help with this following proof. I can't seem to prove it. I believe there is something relating to coprime in this question.

I have attached my question as i didn't know all the various commands to type it in latex.

thanks

Originally Posted by rpatel

Hi

I need help with this following proof. I can't seem to prove it. I believe there is something relating to coprime in this question.

I have attached my question as i didn't know all the various commands to type it in latex.

thanks

What have you tried? I suppose you cannot use the FTA.

Originally Posted by Drexel28

What have you tried? I suppose you cannot use the FTA.

How would you use the FTA here ?

Well, the proof of the FTA uses methods that may be useful here :P



Edit : sorry, I've been constantly editing my message. This is the final version

Originally Posted by Moo

What's the relationship between his question and the fundamental theorem of algebra ?

Well, it's kind of cheating since you need this result to prove the FTA. Since we know that and since and must be written as a product of those primes it follows that must be in one of them. That's roughly the cheat.

what does FTA stand for ?

Originally Posted by rpatel

what does FTA stand for ?

Fundamental theorem of arithmetic.

oh ok i haven't come accross FTA before.