Results 1 to 5 of 5

Math Help - Modulo and the Sum of Digits

  1. #1
    Member
    Joined
    Nov 2010
    Posts
    86

    Modulo and the Sum of Digits

    Hey all, I would really appreciate some help with the following:

    Let n = the sum from i=0 to v(n)-1 of x-sub-i * 10^i, where each x-sub-i is a digit.

    n "is the same as" x-sub-0 (mod 2)

    Well I get this one by doing the following:

    n = x-sub-(v(n)-1)*10^(v(n)-1) + x-sub-(v(n)-2)*10^(v(n)-2) + ... + x-sub-0 * 10^0

    but 10 is the same as 0 (mod 2) so 10^j is the same as 0^j

    so n is the same as x-sub-0 (mod 2)


    But how can I prove that:
    n is the same as x-sub-0 + 10*(x-sub-1) (mod 4)
    n is the same as x-sub-0 + 10*(x-sub-1) + 100*(x-sub-2) (mod 8)
    n is the same as x-sub-0 (mod 5)
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Forum Admin topsquark's Avatar
    Joined
    Jan 2006
    From
    Wellsville, NY
    Posts
    9,939
    Thanks
    338
    Awards
    1
    Quote Originally Posted by jstarks44444 View Post
    Let n = the sum from i=0 to v(n)-1 of x-sub-i * 10^i, where each x-sub-i is a digit.
    This line is bugging me. You have defined n in terms n:
    \displaystyle n = \sum_{i = 0}^{v(n) - 1} x_i \cdot 10^i

    Is the sum n or is n the argument of the function v(n)? I doubt you can have it both ways.

    -Dan
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Banned
    Joined
    Oct 2009
    Posts
    4,261
    Thanks
    2
    Quote Originally Posted by jstarks44444 View Post
    Hey all, I would really appreciate some help with the following:

    Let n = the sum from i=0 to v(n)-1 of x-sub-i * 10^i, where each x-sub-i is a digit.

    n "is the same as" x-sub-0 (mod 2)

    Well I get this one by doing the following:

    n = x-sub-(v(n)-1)*10^(v(n)-1) + x-sub-(v(n)-2)*10^(v(n)-2) + ... + x-sub-0 * 10^0

    but 10 is the same as 0 (mod 2) so 10^j is the same as 0^j

    so n is the same as x-sub-0 (mod 2)


    But how can I prove that:
    n is the same as x-sub-0 + 10*(x-sub-1) (mod 4)
    n is the same as x-sub-0 + 10*(x-sub-1) + 100*(x-sub-2) (mod 8)
    n is the same as x-sub-0 (mod 5)

    You better make a visit in the LaTeX Help subsection of the section "Math Resources" to learn quickly

    how to properly write mathematics in this forum. What you wrote is very hard to understand.

    Tonio
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Member
    Joined
    Nov 2010
    Posts
    86
    the way you typed it is correct. i believe you can have it both ways

    v(n) is the number of digits of n with respect to base 10
    Follow Math Help Forum on Facebook and Google+

  5. #5
    Forum Admin topsquark's Avatar
    Joined
    Jan 2006
    From
    Wellsville, NY
    Posts
    9,939
    Thanks
    338
    Awards
    1
    Quote Originally Posted by jstarks44444 View Post
    n is the same as x-sub-0 + 10*(x-sub-1) (mod 4)
    n is the same as x-sub-0 + 10*(x-sub-1) + 100*(x-sub-2) (mod 8)
    n is the same as x-sub-0 (mod 5)
    Consider, in each case, the truncated series 1000x_3 + 100x_2 + 10x_1 + x_0

    For example, mod 4: 1000 \equiv 0, 100 \equiv 0, 10 \not \equiv 0. So for mod 4 we have that n \equiv 10x_1 + x_0. (Actually n \equiv 2x_1 + x_0 in mod 4. Can you prove this?)

    Apply the same arguments for mod 8 and mod 5. Note that your mod 8 formula also can be simplified: n \equiv 4x_2 + 2x_1 + x_0.

    -Dan
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 7
    Last Post: November 28th 2010, 09:22 PM
  2. Last two digits...
    Posted in the Number Theory Forum
    Replies: 7
    Last Post: May 29th 2010, 08:08 AM
  3. Modulo of squares = modulo of roots
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: December 1st 2009, 09:04 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