There are multiple answers to this question on this website, but they do not address the question that I have.
To be proved: $A = \{4n + 3 \mid n \in \mathbb N\}$ contains infinitely many prime numbers. Hint: ... Consider the number $N = 4p_1...p_m-1 = 4(p_1...p_m-1)+3$. Argue that $N$ must contain a factor $4q+3$, using the fact that $(4a+1)(4b+1)$ is of the form $(4c+1)$
What does the last part of the hint mean?
Using the fact that (4a+1)(4b+1) is of the form (4c+1)
Why is $(4a+1)(4b+1)$ in the form of $(4c+1)$ and what information does this give to me? The answer on this part that the book gives is as follows:
Since $(4a + 1)(4b + 1)$ has the form $(4c + 1)$, we know that $N/q$ has form $4n + 3$. Also, $N/q$ has a prime factor $q_1$. After a finite number of steps this will yield a prime factor $q_i$ of the form $4n + 3$, with $q_i$ != p$_1, ... , p_k$.
Could anyone explain this in more detail?
We have that
$$(4a+1)(4b+1)=16ab+4a+4b+1=4(4ab+a+b)+1$$
and so, taking $c=4ab+a+b,$ we see that $(4a+1)(4b+1)$ is of the form $4c+1.$
Suppose $N>1$ is an integer such that every prime factor of $N$ is of the form $4a+1$ $(a\in\mathbb{N}).$
Can you see how the above hint shows that $N$ must be a number of the form
$$4\times \text{some positive integer } +1 ?$$
By showing that there is no integer which is both of the form $4c+1$ and $4d+3,$ deduce that $$N=4(p_1\ldots p_m-1)+3$$ must have a prime factor of the form $4a+3,$ call it $q.$
Finally, if $q=p_i$ for some $1\leq i \leq m,$ then it must be a factor of $N-4p_1\ldots p_m = -1,$ absurd!