Explore Westonci.ca, the leading Q&A site where experts provide accurate and helpful answers to all your questions. Get precise and detailed answers to your questions from a knowledgeable community of experts on our Q&A platform. Connect with a community of professionals ready to help you find accurate solutions to your questions quickly and efficiently.
Sagot :
if a decimal number is divisible by 3 if and only if the sum of its digits is divisible by three is evident and proved below.
Let n be a decimal number.
Assume n is divisible by 3.
lets consider n in terms of its digits as
n = d_1 * 10^(m-1) + d_2 * 10^(m-2) + ... + d_m * 10^0
where m is the number of digits in n and d_1, d_2, ..., d_m are its digits.
Substituting n = 3k into the above equation, we get
3k = d_1 * 10^(m-1) + d_2 * 10^(m-2) + ... + d_m * 10^0
Subtracting 3k from both sides of the equation, we get
0 = d_1 * 10^(m-1) + d_2 * 10^(m-2) + ... + d_m * 10^0 - 3k
Adding 3k to both sides of the equation, we get
3k = d_1 * 10^(m-1) + d
Learn more about divisible by 3 here
https://brainly.com/question/2273245
#SPJ4
We hope our answers were helpful. Return anytime for more information and answers to any other questions you may have. Thanks for stopping by. We strive to provide the best answers for all your questions. See you again soon. Get the answers you need at Westonci.ca. Stay informed with our latest expert advice.
