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
The answer is 48. 98 - 50 = 48 apples left :)
Answer:
<h2><em><u>hope </u></em><em><u>it </u></em><em><u>helps </u></em><em><u>you </u></em><em><u>see </u></em><em><u>the </u></em><em><u>attachment </u></em><em><u>for </u></em><em><u>further </u></em><em><u>information </u></em><em><u>(๏_๏)</u></em><em><u>(๏_๏)</u></em><em><u>(๏_๏)</u></em></h2>
Answer:
dilation is an enlargment and the scale factor is 2
Step-by-step explanation:
Answer:
1) "fake numbers" do not exist but there are irrational numbers
2) We have negative numbers to help us understand the number system better. We need negative numbers in graphing.