MathLinks Forum LaTeX Help AoPS Classes Books Classroom MathLinks Contest Math Resources

The time now is Tue Feb 09, 2010 7:28 pm
All times are UTC + 2		 View posts since last visit
View unanswered posts
D 5
View previous topicView next topic
Home » Forum » Olympiad Section » Number Theory » PEN » Official PEN problems » Arithmetic in Zn » Congruences
 
 
2 Posts • Page 1 of 1
Author Message
Peter
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer


Offline
Joined: 05 May 2004
Posts: 5214
Location: Ghent
Belgium
To rate posts you must be logged in
#1
D 5
Putnam 1997/B5
Prove that for n\geq 2, \underbrace{2^{2^{\cdots^{2}}}}_{n\text{ terms}}\equiv \underbrace{2^{2^{\cdots^{2}}}}_{n-1\text{ terms}}\; \pmod{n}.

PostPosted: Fri May 25, 2007 2:24 am
ZetaX
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer


Offline
Joined: 21 Dec 2004
Posts: 6168
Location: München
Germany
To rate posts you must be logged in
#2
Taking a closer look at my proof in http://www.mathlinks.ro/viewtopic.php?p=849418.

PostPosted: Fri May 25, 2007 2:24 am
Display posts from previous:   Sort by:   
2 Posts • Page 1 of 1
Home » Forum » Olympiad Section » Number Theory » PEN » Official PEN problems » Arithmetic in Zn » Congruences
 
View previous topicView next topic
Jump to:  


You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum

Created and Maintained by Valentin Vornicu - (c) AoPS Inc. 2004-2008