Results 1 to 2 of 2

Thread: Congruence Theory Proof

  1. November 1st 2009, 07:14 PM #1
    MichaelG
    MichaelG is offline
    Newbie
    Joined
    Oct 2009
    Posts
    24

    Congruence Theory Proof

    For n>(or equal to) 1, use a congruence theory to prove

    27 divides 2^(5n+1) + 5^(n+2)

    43 divides 6^(n+2) + 7^(2n+1)
    Follow Math Help Forum on Facebook and Google+
  2. November 2nd 2009, 03:48 AM #2
    PaulRS
    PaulRS is offline
    Super Member PaulRS's Avatar
    Joined
    Oct 2007
    Posts
    571
    Note that: 2^5=32\equiv{5}(\bmod.27) and 7^2=49\equiv{6}(\bmod.43) try to go on from there
    Last edited by PaulRS; November 3rd 2009 at 03:08 AM.
    Follow Math Help Forum on Facebook and Google+
« a^p=b^p mod p ==> a^p=b^p mod p^2 | Infinite Primes Proof is complete ? »

Similar Math Help Forum Discussions

  1. Congruence Proof
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: October 19th 2011, 10:59 PM
  2. Group theory problem with congruence relations
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: April 1st 2010, 12:02 PM
  3. Congruence proof
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: November 10th 2009, 10:03 AM
  4. [SOLVED] Linear Congruence Theory
    Posted in the Number Theory Forum
    Replies: 9
    Last Post: February 9th 2009, 07:40 AM
  5. Proof congruence
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: November 19th 2007, 09:13 AM

Search Tags


/mathhelpforum @mathhelpforum