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
Sqrt(27)+sqrt(48)+sqrt(12)
Sqrt(27)=sqrt(3*3*3)=3*sqrt(3)
Sqrt(48)=sqrt(4*4*3)=4*sqrt(3)
Sqrt(12)=sqrt(2*2*3)=2*sqrt(3)
Add the three to get 9*sqrt(3)
Final answer:
9*sqrt(3)
Hope I helped :)
Answer:
12
Step-by-step explanation:
This may not be intirely correct because you said q = 2 6. I think that means 2 times 6.
Anyways
2 x 6 = 12
⇒ q = 12
