4 and 1
3 and 2
im pretty sure thats is the answer, the question is quite vague.
Answer:
17.5
Step-by-step explanation:
17×4=68; half of 4 is 2; 68+2=70
Yes, 23 has an inverse mod 1000 because gcd(23, 1000) = 1 (i.e. they are coprime).
Let <em>x</em> be the inverse. Then <em>x</em> is such that
23<em>x</em> ≡ 1 (mod 1000)
Use the Euclidean algorithm to solve for <em>x</em> :
1000 = 43×23 + 11
23 = 2×11 + 1
→ 1 ≡ 23 - 2×11 (mod 1000)
→ 1 ≡ 23 - 2×(1000 - 43×23) (mod 1000)
→ 1 ≡ 23 - 2×1000 + 86×23 (mod 1000)
→ 1 ≡ 87×23 - 2×1000 ≡ 87×23 (mod 1000)
→ 23⁻¹ ≡ 87 (mod 1000)
Answer:
They Would be if they Have a pattern from left to right such as +2 or -5.
Step-by-step explanation:
If an example is counting up from 15 to 31 and 0 to 8 the pattern is Adding Two. So if the numbers decrease or increase in a certain way, then you can find out what it is and thn bam, your answer to the question.
Answer:
348
Step-by-step explanation:
Length-l
Width-w
Height-h
A=2(wl+hl+hw)=2·(8·9+6·9+6·8)=348
