Results 1 to 2 of 2

Math Help - Modulo Proof

  1. #1
    Member
    Joined
    Mar 2009
    Posts
    182
    Thanks
    1

    Modulo Proof

    Im terrible at proofs....!

    Let n be a natural number and let a, b ∈ Z. Use the definition of congruence, Lemma and induction to show that if a ≡ b (mod n) then


    a^k b^k (mod n), for all integers k ≥ 0
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Banned
    Joined
    Oct 2009
    Posts
    4,261
    Thanks
    2
    Quote Originally Posted by sirellwood View Post
    Im terrible at proofs....!


    Let n be a natural number and let a, b ∈ Z. Use the definition of congruence, Lemma and induction to show that if a ≡ b (mod n) then


    a^k b^k (mod n), for all integers k ≥ 0

    You ask lots of questions, some of which are very long and which look like homework, and you show no self work at all....show what you've done and where you're stuck.

    Tonio
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. modulo arithmetic proof
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: May 31st 2011, 09:27 AM
  2. Modulo/congruence proof help
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: February 1st 2009, 12:39 PM
  3. Modulo proof
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: July 16th 2008, 05:22 PM
  4. Modulo proof help
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: July 14th 2008, 07:24 PM
  5. proof on inverse modulo
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: October 16th 2006, 06:42 PM

Search Tags


/mathhelpforum @mathhelpforum