Results 1 to 2 of 2

Math Help - Congruence question

  1. #1
    Newbie
    Joined
    Jul 2007
    Posts
    12

    Congruence question

    Hey everyone. I have a question about a congruence problem. I guess I'm just unsure about how to approach it:

    If p is a prime number and if a is not congruent to 0 (mod p), then Fermat's Little Theorem tells us that a^(p-1)≡ 1 (mod p).

    The congruence 7^1734250 ≡ 1660565 (mod 1734251) is true. Can you conclude that 1734251 is a composite number?
    Last edited by meebo0129; October 7th 2007 at 02:30 PM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    9
    What is so special about 1660565?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. congruence question
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: May 8th 2011, 10:09 AM
  2. congruence question
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: May 6th 2010, 07:20 AM
  3. Possible Congruence Question
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: December 3rd 2009, 03:32 PM
  4. Congruence question
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: September 13th 2009, 09:51 AM
  5. Congruence question
    Posted in the Number Theory Forum
    Replies: 10
    Last Post: January 6th 2009, 08:46 AM

Search Tags


/mathhelpforum @mathhelpforum