MathLinks Forum LaTeX Help AoPS Classes Books Classroom MathLinks Contest Math Resources
The time now is Tue Feb 09, 2010 6:50 pm
All times are UTC + 2
View posts since last visit
View unanswered posts
View previous topicView next topic
7 Posts • Page 1 of 1
Author Message
Svejk
Yang-Mills Theory
Yang-Mills Theory


Offline
Joined: 23 Nov 2006
Posts: 595
Location: Mures / Bucharest ,Romania
Romania

To rate posts you must be logged in
#1
n^3|(2^{n^2}+1)
Gh Lazar contest 2007

Let n \in \mathbb N if n^{3}|(2^{n^{2}}+1) then prove that m^{3}|(2^{m^{2}}+1) ,where m=\frac{2^{n^{2}}+1}{n^{2}}
_________________
Radu Titiu

PostPosted: Sun Mar 25, 2007 11:32 am
RDeepMath91
Riemann Hypothesis
Riemann Hypothesis


Offline
Joined: 29 Mar 2006
Posts: 333
Location: Bekasi and Jakarta
Indonesia

To rate posts you must be logged in
#2
In IMO 1990 no. 3, the solution for n where n | 2^{n}+1 is n = 1 or n = 3. (Will be proved if necesarry)
Thus, if n^{2}| n^{3}| 2^{n^{2}}+1, we obtain n = 1 \Rightarrow m = 3
Hence, since 27 | 2^{9}+1, it follows that m^{3}| 2^{m^{2}}+1. Mr. Green
_________________
In most sciences, one generation tears down what another has built and what one has established another undoes. In Mathematics alone, each generation builds a new story to the old structure.

PostPosted: Sun Mar 25, 2007 5:17 pm
Svejk
Yang-Mills Theory
Yang-Mills Theory


Offline
Joined: 23 Nov 2006
Posts: 595
Location: Mures / Bucharest ,Romania
Romania

To rate posts you must be logged in
#3
I don't think that n|2^{n}+1 implies only n=1 or n=3
_________________
Radu Titiu

PostPosted: Sun Mar 25, 2007 6:41 pm
zscool
Riemann Hypothesis
Riemann Hypothesis


Offline
Joined: 23 Jun 2003
Posts: 482

To rate posts you must be logged in
#4
the actual IMO question is if n^{2}|2^{n}+1 where n is a positive integer then n=1 or 3, so it doesn't quite apply.

PostPosted: Sun Mar 25, 2007 8:03 pm
Rust
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer

Offline
Joined: 10 Feb 2006
Posts: 3695

To rate posts you must be logged in
#5
There are infinetely many solutions, suth that n^{3}|2^{n^{2}}+1.
For example n=3 give m=57, n=57 give m=\frac{2^{3249}+1}{3249} e t.c.
Proofe. If 2^{n^{2}}+1=kn^{3}, then m=kn, k,n,m - are odd.
Therefore 2^{m^{2}}+1=(2^{n^{2}}+1)(2^{(k^{2}-1)n^{2}}-2^{(k^{2}-2)n^{2}}+...+1). We have 2^{n^{2}}+1=m*n^{2}, therefore 2^{an^{2}}=(m*n^{2}-1)^{a} and
\sum_{a=0}^{k^{2}-1}(-1)^{a}2^{an^{2}}=\sum_{a=0}^{k^{2}-1}(1-mn^{2})^{a}=k^{2}-\frac{k^{2}(k^{2}-1)}{2}mn^{2}+O(m^{2}).
It mean
2^{m^{2}}+1=mn^{2}k^{2}(1-\frac{k^{2}-1}{2}mn^{2})+O(m^{3})=m^{3}(1-\frac{k^{2}-1}{2}mn^{2}})+O(m^{3})=O(m^{3}).

PostPosted: Mon Mar 26, 2007 8:22 am
me@home
Navier-Stokes Equations
Navier-Stokes Equations


Offline
Joined: 03 May 2005
Posts: 2250
Location: Portland, OR - Check out the Oregon Forum!!!
United States

To rate posts you must be logged in
#6
\sum_{a=0}^{k^{2}-1}(-1)^{a}2^{an^{2}}=\sum_{a=0}^{k^{2}-1}(1-mn^{2})^{a}=k^{2}-\frac{k^{2}(k^{2}-1)}{2}mn^{2}+O(m^{2}).
In the final expression, what if there are binomial coefficients which divide m^{2}?
_________________
↓What did the Buddhist monk say when ordering a hamburger?
↓Make me one with everything.
↓Check out my website... I mean, when was the last time you visited a url with "hamburger" embedded into it?

PostPosted: Tue Mar 27, 2007 11:55 am
Rust
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer

Offline
Joined: 10 Feb 2006
Posts: 3695

To rate posts you must be logged in
#7
Let k=\frac{2^{n^{2}}+1}{n^{3}},m=kn.
Then
2^{m^{2}}+1=(2^{n^{2}})^{k^{2}}+1=1+(mn^{2}-1)^{k^{2}}=\sum_{i=1}^{k^{2}}C_{k^{2}}^{i}(-1)^{i-1}m^{i}n^{2i}=k^{2}n^{2}m-k^{2}...

PostPosted: Tue Mar 27, 2007 12:14 pm
Display posts from previous:   Sort by:   
7 Posts • Page 1 of 1
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