Greatest integer divides p^4 -1

  • Context: Undergrad 
  • Thread starter Thread starter yxgao
  • Start date Start date
  • Tags Tags
    Integer
Click For Summary

Discussion Overview

The discussion revolves around determining the greatest integer that divides \( p^4 - 1 \) for every prime number \( p \) greater than 5. The scope includes mathematical reasoning and exploration of divisibility properties.

Discussion Character

  • Mathematical reasoning
  • Exploratory

Main Points Raised

  • One participant claims that the greatest integer dividing \( p^4 - 1 \) for primes \( p > 5 \) is 240.
  • Another participant suggests factoring \( p^4 - 1 \) as \( (p^2 + 1)(p - 1)(p + 1) \) to analyze its divisibility.
  • A participant details the divisibility by 16, 3, and 5, concluding that \( p^4 - 1 \) is divisible by \( 16 \times 3 \times 5 = 240 \).
  • One participant acknowledges a misunderstanding of the problem but confirms that 240 divides \( p^4 - 1 \) for any prime \( p > 5 \) and suggests looking at specific examples to further validate the claim.

Areas of Agreement / Disagreement

Participants generally agree that 240 divides \( p^4 - 1 \) for primes greater than 5, but there is no consensus on whether it is the greatest integer that does so, as the discussion remains open to further exploration and examples.

Contextual Notes

The discussion does not resolve whether 240 is the greatest integer, as it focuses on verifying divisibility rather than establishing a maximum divisor. There may be additional conditions or assumptions regarding the primes considered.

yxgao
Messages
122
Reaction score
0
What is the greatest integer divides p^4 -1 for every prime number p greater than 5?

It is 240. Why?

Thanks!
 
Physics news on Phys.org
Try factoring [itex]p^4-1[/itex].
 
I already figured this out. (p^4-1) = (p^2+1)(p-1)(p+1).
i.) Each term is divisible by 2 since p is odd. Also, either p-1 or p+1 is divisible by 4.
So divisible by 16.
ii.) either p mod 3 = 1 or p mod 3 = 2. If the first case, p-1 = 0 mod 3, second case, p^2 -1 = 0 mod 3.
So divisible by 3.
iii.) either p mod 5 = 1, p mod 5 = 2, p mod 5 = 3, or p mod 5 = 4.
If p mod 5 = 1, p-1 = 0 mod 5. If p mod 4 = 1, p+1 = 0 mod 5, and if p mod 5 = 2 or p mod 3 = 1, then p^2+1 = 0 mod 5.
So divisible by 5.

Hence, divisible by 16*3*5 = 240.
 
Er, my mistake, I misread the problem.

Well, you've verified that [itex]240 | p^4 - 1[/itex] for any prime number greater than 5, correct? (In fact, [itex]240 | n^4 - 1[/itex] if [itex](240, n) = 1[/itex])

The easiest way to proceed from here is, I think, to start looking at some explicit examples, and finish the proof from a small number of those. For instance, if [itex]m | p^4 - 1[/itex] for all primes [itex]p > 5[/itex], then [itex]m | 7^4 - 1 = 2400[/itex].
 

Similar threads

Replies
48
Views
7K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 21 ·
Replies
21
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
Replies
9
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 33 ·
2
Replies
33
Views
5K
  • · Replies 31 ·
2
Replies
31
Views
4K