My Math Forum  

Go Back   My Math Forum > College Math Forum > Number Theory

Number Theory Number Theory Math Forum

Thanks Tree1Thanks
  • 1 Post By johng40
LinkBack Thread Tools Display Modes
April 13th, 2017, 11:13 AM   #1
Senior Member
Joined: Dec 2006

Posts: 167
Thanks: 3

For odd n and prime p, (p | (3^n+1)) ⇒ 3|(p-1)

Show that if $p> 2$ is a prime, $n > 1$ is odd and $p\mid (3^n+1)$,
then $p\equiv 1\pmod{3}$
elim is offline  
April 13th, 2017, 08:18 PM   #2
Senior Member
Joined: Aug 2012

Posts: 2,426
Thanks: 759

Fiendish. It has something to do with the binomial coefficients, that's my current theory. I'm writing $3^n$ as $(2 + 1)^n$ and noting that the sum of the elements of each row of Pascal's triangle are alternately $1$ and $2$ mod $3$. Can't get any farther than that.

Anyone else hacking away at this?

Last edited by Maschke; April 13th, 2017 at 08:20 PM.
Maschke is offline  
April 14th, 2017, 01:44 AM   #3
Global Moderator
Joined: Dec 2006

Posts: 21,110
Thanks: 2326

Where did this problem come from?
skipjack is offline  
April 14th, 2017, 07:50 PM   #4
Joined: Jan 2016
From: Athens, OH

Posts: 93
Thanks: 48

This is almost an immediate consequence of the quadratic reciprocity theorem - link, a lot of information. The following just defines the relevant notation and some preliminary facts before the proof of the statement.

Thanks from Maschke
johng40 is offline  

  My Math Forum > College Math Forum > Number Theory

3|p1, , odd, prime

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Primorial + prime = prime momo Number Theory 4 June 3rd, 2017 04:29 PM
Pythagorean prime in every prime twin blind887 Algebra 2 April 12th, 2017 03:35 AM
For every prime (x+y) exist a prime (x-y) M_B_S Number Theory 59 October 6th, 2014 12:52 AM
Mod prime gaussrelatz Number Theory 4 September 1st, 2012 12:06 PM
If P is prime imply that a is prime momo Number Theory 14 September 26th, 2008 08:21 AM

Copyright © 2019 My Math Forum. All rights reserved.