Answer:
16
Step-by-step explanation:
Answer:
Yes
Step-by-step explanation:
The left side, because you only need to move one thing, and you don't need to subtract after that. (you can add, much more easier)
hope this helps
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:
10.5 is the correct answer.
Step-by-step explanation:
Due to the fact Triangle CAB has "6" as its length, and Triangle FDE has "2" as its length, you multiply 3.5 and 3.
3.5 x 3=10.5
2 x 3=6
3.5/2=10.5/6, so the answer is 10.5.
