Results 1 to 3 of 3

Math Help - Show that it is divisible by 7 for all positive integers...

  1. #1
    Junior Member Bartimaeus's Avatar
    Joined
    Jul 2006
    Posts
    36

    Show that it is divisible by 7 for all positive integers...

    Show that 43^n + 83 * 92 (to the power of) (3n-1) is divisible by 7 for all positive integers n



    Thanks for your time guys, really appreciate it and sorry about the dodgy math after the 92, I'm not very good when it comes to this computer stuff.
    Last edited by Bartimaeus; September 22nd 2007 at 01:46 PM. Reason: mistake in problem
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Forum Admin topsquark's Avatar
    Joined
    Jan 2006
    From
    Wellsville, NY
    Posts
    9,899
    Thanks
    329
    Awards
    1
    Quote Originally Posted by Bartimaeus View Post
    Show that 43^n + 83 * 92 (to the power of) (3n-1) is divisible by 7 for all positive integers n



    Thanks for your time guys, really appreciate it and sorry about the dodgy math after the 92, I'm not very good when it comes to this computer stuff.
    If you know modular arithmetic, then
    43 \equiv 1~\text{(mod 7)}

    83 \equiv -1~\text{(mod 7)}

    and
    92 \equiv 1~\text{(mod 7)}

    So
    43^n + 83 \cdot 92^{3n-1} \equiv 1^n + (-1) \cdot 1^{3n - 1} ~\text{(mod 7)}

    \equiv 1 - 1~\text{(mod 7)} ~ \forall ~n

    \equiv 0 ~\text{(mod 7)}

    So 43^n + 83 \cdot 92^{3n-1} is divisible by 7 for all values of n.

    -Dan
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Forum Admin topsquark's Avatar
    Joined
    Jan 2006
    From
    Wellsville, NY
    Posts
    9,899
    Thanks
    329
    Awards
    1
    Quote Originally Posted by Bartimaeus View Post
    Show that 43^n + 83 * 92 (to the power of) (3n-1) is divisible by 7 for all positive integers n



    Thanks for your time guys, really appreciate it and sorry about the dodgy math after the 92, I'm not very good when it comes to this computer stuff.
    If you don't know modular arithmetic, then consider n = 1:
    43^1 + 83 \cdot 92^{3 \cdot 1 - 1} = 43 + 83 \cdot 92^2 = 702555
    which is divisible by 7.

    Now assume the theorem to be true for some n = k.
    Assume that
    43^k + 83 \cdot 92^{3k - 1} = 7x
    where x is some integer.

    Consider the case for n = k + 1:
    43^{k + 1} + 83 \cdot 92^{3(k + 1) - 1}

    = 43 \cdot 43^k + 92^3 \cdot 83 \cdot 92^{3k - 1}
    This should be divisible by 7.

    Now, consider again:
    43^k + 83 \cdot 92^{3k - 1} = 7x

    Solving this for 83 \cdot 92^{3k - 1} gives:
    83 \cdot 92^{3k - 1} = 7x - 43^k

    Inserting this into the k + 1 expression gives:
    43 \cdot 43^k + 92^3 \cdot (7x - 43^k)

    = 43 \cdot 43^k + 7 \cdot (92^3x) - 92^3 \cdot 43^k

    = (43 - 92^3) \cdot 43^k + 7(92^3x)

    The last term is manifestly divisible by 7. Let's look at the first term:
    (43 - 92^3) \cdot 43^k

    The coefficient of the 43^k is
    43 - 92^3 = -778645 = 7(-111235)

    So
    43^{k + 1} + 83 \cdot 92^{3(k + 1) - 1} = 7(-111235) \cdot 43^k + 7(92^3x)
    where x is an integer. This is obviously divisible by 7.

    Thus 43^n + 83 \cdot 92^{3n - 1} is divisible by 7 for n = 1, thus for n = 2, thus etc.

    -Dan
    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. Show that there exist no positive integers ...
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: August 23rd 2011, 04:49 PM
  3. Positive integer not divisible by 7
    Posted in the Algebra Forum
    Replies: 5
    Last Post: January 15th 2011, 04:51 AM
  4. Divisible integers
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: October 18th 2010, 08:51 AM
  5. Replies: 3
    Last Post: February 3rd 2010, 09:30 AM

Search Tags


/mathhelpforum @mathhelpforum