Results 1 to 2 of 2

Math Help - Show that Z=E mod 9, where E is the sum of digits of r (in dec. repres. of r)

  1. #1
    Newbie
    Joined
    Jan 2011
    Posts
    8

    Show that Z=E mod 9, where E is the sum of digits of r (in dec. repres. of r)

    Hi,

    I have the following problem and I don't know how to go about this... I would really appreciate if you could give me a hand. The problem says:

    "Let r \in \mathbb{N}. Show that

    r \equiv \Sigma mod 9,

    where \Sigma is the sum of digits of r (in decimal representation of r)."
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Banned
    Joined
    Oct 2009
    Posts
    4,261
    Quote Originally Posted by jmgilbert View Post
    Hi,

    I have the following problem and I don't know how to go about this... I would really appreciate if you could give me a hand. The problem says:

    "Let r \in \mathbb{N}. Show that

    r \equiv \Sigma mod 9,

    where \Sigma is the sum of digits of r (in decimal representation of r)."


    If n=A_k\times 10^k +A_{k-1}\times 10^{k-1}+\ldots+A_1\times 10+A_0 , and

    since 10^m=1\!\!\pmod 9\,,\,\,\forall\,m\in\mathnn{N} , we get

    n=\sum\limits^k_{i=0}A_i\times 10^i=\sum\limits^k_{i=0}A_i\!\!\pmod 9

    Tonio
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 5
    Last Post: February 20th 2013, 09:32 AM
  2. Replies: 7
    Last Post: November 28th 2010, 09:22 PM
  3. Replies: 8
    Last Post: December 26th 2009, 04:35 AM
  4. Sum of the digits
    Posted in the Algebra Forum
    Replies: 1
    Last Post: April 7th 2008, 03:50 AM
  5. Replies: 2
    Last Post: April 3rd 2007, 12:31 PM

Search Tags


/mathhelpforum @mathhelpforum