Answer:
0, 1, 2
Step-by-step explanation:
Euclid's division Lemma states that for any two positive integers ‘a’ and ‘b’ there exist two unique whole numbers ‘q’ and ‘r’ such that , a = bq + r, where 0≤ r < b.
Here, a= Dividend, b= Divisor, q= quotient and r = Remainder.
According to Euclid's division lemma a 3q+r, where 0≤r≤3 and r is an integer.
Therefore, the values of r can be 0, 1 or 2.
Answer:
Step-by-step explanation:
Hello, please consider the following.
So this is divisible by 3.
Now, to prove that this is divisible by 9 = 3*3 we need to prove that
is divisible by 3. We will prove it by induction.
Step 1 - for n = 1
4+17=21= 3*7 this is true
Step 2 - we assume this is true for k so 
is divisible by 3
and we check what happens for k+1
is divisible by 3 and
is divisible by 3, by induction hypothesis
So, the sum is divisible by 3.
Step 3 - Conclusion
We just prove that is divisible by 3 for all positive integers n.
Thanks
Answer:
67.38
Step-by-step explanation:
Centimeter is bigger than millimeter
