Dayo Ogundipe edited begin_itemize_item_textbf_sqrt__.tex  over 8 years ago

Commit id: 57edc1e93400f9cb20d5f63306552d045cc332f2

deletions | additions      

       

Since $2p_1 = p$  \[2|p^2 = 2|q^2\]  \[2|p = 2|q\]  $\therefore $\therefore$  By 2|p$ $2|p$  and $2|q$ $gcd(p,q) \ne 1$ Proof by contradiction.