SOLUTION: Use the base-ten model to prove whether 436 is divisible by 3

SOLUTION: Use the base-ten model to prove whether 436 is divisible by 3

Algebra.Com

Question 857933: Use the base-ten model to prove whether 436 is divisible by 3
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
Never heard of the phrase "base-ten model" (even as a math major) but 436 is not divisible by 3 because 4+3+6 = 13, which is not divisible by 3.
RELATED QUESTIONS
use mathematical induction to prove 7^n-3^n is divisible by... (answered by Edwin McCravy)

Use the factor theorem to show that if 2^p - 1, where p does not equal 3, is a prime... (answered by Edwin McCravy)

Use mathematical induction to prove the statement is true for all positive integers n. (answered by Edwin McCravy)

Use mathematical induction to prove the statement is true for all positive integers n. (answered by ikleyn)

Use mathematical induction to prove: 4^n+1 + 5^2n-1 is divisible by... (answered by jim_thompson5910,Edwin McCravy)

prove n^3 + 2n is divisible by 3... (answered by ikleyn)

Use mathematical induction to prove each statement is true for all positive integers n:... (answered by math_helper)

Use mathematical induction to prove the statement is true for all positive integers n. (answered by ikleyn)

Prove that x to the power of five minus x is divisible by... (answered by richard1234)