Answer:
The prove is as given below
Step-by-step explanation:
Suppose there are only finitely many primes of the form 4k + 3, say {p1, . . . , pk}. Let P denote their product.
Suppose k is even. Then P ≅ 3^k (mod 4) = 9^k/2 (mod 4) = 1 (mod 4).
ThenP + 2 ≅3 (mod 4), has to have a prime factor of the form 4k + 3. But pₓ≠P + 2 for all 1 ≤ i ≤ k as pₓ| P and pₓ≠2. This is a contradiction.
Suppose k is odd. Then P ≅ 3^k (mod 4) = 9^k/2 (mod 4) = 1 (mod 4).
Then P + 4 ≅3 (mod 4), has to have a prime factor of the form 4k + 3. But pₓ≠P + 4 for all 1 ≤ i ≤ k as pₓ| P and pₓ≠4. This is a contradiction.
So this indicates that there are infinite prime numbers of the form 4k+3.
Answer:
21.04
Step-by-step explanation:
the 8 is closest to 10 so that would make the 3 a 4.
Answer:
All Triangles are closed figure polygons that have three straight sides
Step-by-step explanation:
All 2D shapes are plane figures so this one is false. Three right angles are greater than 180 so this is fake. Polygon and closed figures are shapes with three or more closed sides. And triangles have straight sides.
I can't think of what the form is called, but the slope is in that equation.
y=mx+b
m is the slope and in that equation, m=-4/3