Re: a problem in elementary number theory

Factor it and look at the factors modulo small powers of small primes.

<dmitry.sustretov@xxxxxxxxx> wrote in message
news:1193777979.713787.161730@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Hello,

I am stuck solving this problem from GRE Math training booklet:

Find the maximal integer x such that x divides p^4-1 for all prime
numbers p > 5.

[they actually have a list to choose from: 12, 30, 48, 120, 240]

Do you have any ideas?

--
Dmitry Sustretov



.

Relevant Pages

  • Re: Self Study problem help - Group theory
    ... > numerator and the denominator will decompose into powers of the primes ... Where do the *powers* of primes come from? ... > the bottom, and none of them are 2, so no matter what we can never ...
    (sci.math)
  • Re: Why is my code faster with append() in a loop than with a large list?
    ... DA> primes, rather than trying every possible int. ... XXX yield p ... (the powers are returned one higher than the actual value) ... num /= factor ...
    (comp.lang.python)
  • Re: What is Sum(1/p log p)?
    ... I know PNT. ... split the sum according to powers of 2 (see below for what ... the difference of number of primes between two consecutive ...
    (sci.math.research)
  • Re: A question on "sufficiently large".
    ... large even integer is a sum of two primes and exactly 13 powers ... Roger Heath-Brown didn't prove that every sufficiently large even number is a sum of 2 primes, ... large even number is a sum of 2 primes and 13 powers of 2. ...
    (sci.logic)
  • Re: Hashtable efficiency
    ... Probably because finding primes is a lot more difficult that finding ... powers of 2. ... The *reason* why you use prime hash table sizes is that it's the simplest ...
    (comp.lang.java.programmer)