Uncover valuable information and solutions with IDNLearn.com's extensive Q&A platform. Get step-by-step guidance for all your technical questions from our knowledgeable community members.
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 are happy to have you as part of our community. Keep asking, answering, and sharing your insights. Together, we can create a valuable knowledge resource. Discover the answers you need at IDNLearn.com. Thanks for visiting, and come back soon for more valuable insights.
