Question 1172305
.
<pre>

So, the statement, which you want to prove, is THIS


   +------------------------------------------------------------------------+
   |  prove by contradiction that any composite number of the form (4n-1)   |
   |  must have at least one prime factor of the form (4n-1).               |
   +------------------------------------------------------------------------+



Let N be a composite number of the form (4n-1).


Then it is a product of the odd prime numbers; the prime number 2 is not its divisor.


Let assume that all its prime divisors are of the form (4n+1).


Notice that the product of any two odd numbers of the form (4n+1) is the number of the form (4n+1).
 


    It can be proven by direct multiplication of the numbers of this form.



It implies that a product of ANY number of the primes of the form (4n+1) has the form (4n+1).


But our number N has the form (4n-1).


So, we got a CONTRADICTION, which proves the statement.
</pre>

The proof is completed.