Ivan also decides to try putting together the “Multiples of 3” set from the numbers sitting around. How can he know if a number is a multiple of 3? (Hint: Build a lot of different multiples of 3. Then look at the sum of the digits of each number.

Multiples of 3 are: 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, ...

The two digit numbers in that list above all have their digits adding to some other multiple of 3

and so on.

Therefore, the rule is: If the digits add to a multiple of 3, then the original number is a multiple of 3.

its electric no smoke

step-by-step explanation:

for this pair of functions g(x)=x-2 and f(x)=|x| is (g o f)(a)= |a| -2

step-by-step explanation:

g(x)=x-2

f(x)=|x|

(g o f)(a)=?

(g o f)(x)=g(f(x))

(g o f)(x)=g(|x|)

(g o f)(x)=|x|-2

(g o f)(a)=|a|-2