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

Printable View

- Jan 13th 2010, 10:02 AMrpatelProof 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 - Jan 13th 2010, 10:15 AMDrexel28
- Jan 13th 2010, 10:35 AMMoo
- Jan 13th 2010, 10:37 AMDrexel28
Well, it's kind of cheating since you need this result to prove the FTA. Since $\displaystyle p|ab$ we know that $\displaystyle ab=p\cdot p_1\cdots p_m$ and since $\displaystyle a$ and $\displaystyle b$ must be written as a product of those primes it follows that $\displaystyle p$ must be in one of them. That's roughly the cheat.

- Jan 13th 2010, 11:25 AMrpatel
what does FTA stand for ?

- Jan 13th 2010, 11:26 AMDrexel28
- Jan 13th 2010, 11:31 AMrpatel
oh ok i haven't come accross FTA before.