Results 1 to 2 of 2

Math Help - weird problem

  1. #1
    mms
    mms is offline
    Junior Member
    Joined
    Jul 2009
    Posts
    67

    weird problem

    Hi, i didnt know where to put this problem

    Show that every positive integer has a multiple made of only sevens and zeros.

    thanks for your help.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Member
    Joined
    Jun 2009
    Posts
    220
    Thanks
    1
    So we have an integer n and we want an integer m such that  nm = s, where s consists of only 7's and 0's.

    This is a constructive proof, but I'm sure there are other ways of doing it.

    Firstly take a number of the form x = 1111\ldots 111, constisting only of 1's. Then calculate r = x \mod{n}

    If  r=0 then we can simply multiply r by 7 and we are done.

    If not then we find 2 other numbers of the form y_1=111\ldots 111 > y_2 = 11\ldots 111 such that  y_1 \equiv y_2 \mod{n} . Then y_1 - y_2 is divisible by n and consists only of 1's and 0's, we simply multiply this by 7 and we are done.

    The justification for the existence of such y_i is that if we take n elements from the set \left\{1,11,111,1111,\ldots \right\} , then there must be at least 2 with the same remainder mod n.

    Pomp.
    Last edited by pomp; July 13th 2009 at 09:44 AM. Reason: typos. lots of them.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 3
    Last Post: January 2nd 2011, 08:20 PM
  2. Help with a weird problem
    Posted in the Pre-Calculus Forum
    Replies: 3
    Last Post: March 30th 2010, 11:45 PM
  3. Weird sum problem
    Posted in the Calculus Forum
    Replies: 1
    Last Post: November 21st 2009, 03:47 AM
  4. A weird problem.. Please take a look and help!
    Posted in the Pre-Calculus Forum
    Replies: 2
    Last Post: April 10th 2008, 09:59 AM
  5. Weird problem
    Posted in the Calculus Forum
    Replies: 3
    Last Post: November 26th 2006, 11:06 PM

Search Tags


/mathhelpforum @mathhelpforum