Count all the squares to get the answer (the long ones that are connected are 10)
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)
√2 is irrational
a rational number Q can be expressed in the form 
where a and b are integers.
- 18 = 
⇒ rational
⇒ rational
3.14 = 
⇒ rational
√2 = 1.414213562...... ⇒ irrational
First we think of a 3 digit dividend for example 100.
Next we think of a divisor between 10 and 29 for example 20.
We divide 100÷20=5
Here's a division problem:
Sophia has 100 pencils. She has 20 boxes with the same number of pencils in them. How many pencils does Sophia put her box?
Divide 100 by 20 which equals 5
Your answer is 5
Answer:
Step-by-step explanation:
we want y by itself...sooo
y - 19 = - 
(x - (-5))
y - 19 = - (x+5)
y - 19 = - x - 
y = - x - 3 +19
y = - x + 16
