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.
for example if you have 3x^2+2x-1 then a=3 b=2 and c=-1 you plug those into the formula and solve to get the formula just look it up and go to images
Answer:
26.75
Step-by-step explanation:
It is 26.75 because if you split the traingle in half from the bottom to the top you look to find the area of each shape, so the sqaure has a measure of 2 by 2 so that is four then the smaller triangle has a measure of 2 by 2 but the formula for triangles are length times height divided by 2 and the area for that is 2. Then the other smaller triangle is 5 * 2 which is 10 then divide it by 2 so it is 5 so all together it is 9. then the area of the biggest triangle is 15.75
Answer: yes
Step-by-step explanation: Joshua
Answer:
6
Step-by-step explanation:
f(6) = -6 this is the value when the x value is 6
g(5) = -5 this is the value when the x value is 5
4 * f(6) -6*g(5)
4*-6 - 6* -5
-24 + 30
6
