Prime numbers relation

Question

Show that if $k$ is a natural number. And $k$ is like $4*m +3, so $k$ has a prime factor in this form. Please, show me different ways to solve this question.

Answer 1

Hint:

The simple way uses congruences: the hypothesis means $k\equiv 3(\equiv -1)\bmod 4$, so $k$ is odd and it has only odd prime factors. Now an odd prime is congruent either to $1$ or $-1\bmod 4$.

What can you conclude as to the number of primes congruent to $-1\bmod 4$ in the decomposition of $k$ into primes?

Answer 2

"Show that if k is a natural number. And k is like 4∗m+3,so k has a prime factor in this way. Please, show me different ways to solve this question."

What question? There is no question there. Also, what do you mean by "has a prime factor in this way"? Every integer has prime factors! If m= 0, k= 3 which is a prime number. If m= 1, k= 7 which is a prime number. If m= 2, k= 9= 3*3. If m= 3, k= 15= 3*5. If m= 4, k= 19 which is a prime number.

Again, every integer has prime factors.