Results 1 to 2 of 2

Math Help - Congruence

  1. #1
    Newbie
    Joined
    Apr 2009
    Posts
    11

    Congruence

    Find all integer solutions to
    -2^0-2^1-2^2-...-2^{q-1} \equiv 0 \bmod q^{p-1}
    Where
     2p \geq q
    p is prime.

    I know that the only solution is 1,1 (Using brute force through my graphing calculator)
    This is actually part of another question in which I tried to solve and got stuck here. (I'm pretty sure what I've done before this is correct)
    So if p being prime is not used, it's alright.
    Last edited by LegendWayne; April 14th 2009 at 05:50 AM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Apr 2009
    From
    Atlanta, GA
    Posts
    408

    Please clarify

    Are these minus signs?

    <br />
-2^0-2^1-2^2-...-2^{q-1} \equiv 0 \bmod q^{p-1}<br />
    Then you are asking us to solve the congruence, given arbitrary q, find a prime p \geq q/2 such that: q^{p-1}|2^q-1

    But you said the only solution is p=1,q=1, which is true, except that p is not prime.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Congruence
    Posted in the Number Theory Forum
    Replies: 7
    Last Post: May 12th 2009, 10:19 AM
  2. Congruence
    Posted in the Geometry Forum
    Replies: 1
    Last Post: November 10th 2008, 01:52 PM
  3. congruence
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: September 30th 2008, 05:04 PM
  4. Congruence
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: September 30th 2008, 09:11 AM
  5. Congruence
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: September 29th 2008, 10:57 AM

Search Tags


/mathhelpforum @mathhelpforum