For proof of 3 divisibility, abc is a divisible by 3 if the sum of abc (a + b + c) is a multiple of 3.
<h3>
Integers divisible by 3</h3>
The proof for divisibility of 3 implies that an integer is divisible by 3 if the sum of the digits is a multiple of 3.
<h3>Proof for the divisibility</h3>
111 = 1 + 1 + 1 = 3 (the sum is multiple of 3 = 3 x 1) (111/3 = 37)
222 = 2 + 2 + 2 = 6 (the sum is multiple of 3 = 3 x 2) (222/3 = 74)
213 = 2 + 1 + 3 = 6 ( (the sum is multiple of 3 = 3 x 2) (213/3 = 71)
27 = 2 + 7 = 9 (the sum is multiple of 3 = 3 x 3) (27/3 = 9)
Thus, abc is a divisible by 3 if the sum of abc (a + b + c) is a multiple of 3.
Learn more about divisibility here: brainly.com/question/9462805
#SPJ1
Answer: n = -1 n = 3
Step-by-step explanation:
Answer:
Senior citizen ticket: $3
Student ticket: $9
Explanation:
Please let me know if you want me to add an explanation as to why this is the answer. I can definitely do that, I just wouldn’t want to write it if you don’t want me to :)
Can you show picture of sentences
