Page 3 of 4

Re: ONTC Final Exam

Posted: Thu Sep 03, 2015 10:19 am
by Epshita32
In p5 can I use the cyclic version instead of the given one ?

Re: ONTC Final Exam

Posted: Thu Sep 03, 2015 3:41 pm
by Epshita32
In p2 , 2^m-1 according to m makes a sequence - if m = 1 , then 2^m-1 = 1 . For m as 2 , 2^m-1 = 3 . For m as 3 , 2^m-1 = 7 . Let 2^m-1 = X . The sequence - Xn = 2*X(n-1) + 1 where X1 = 1 . In the whole sequence only when m = 1 , X divides n^2+1 . For ex : n^2+1 = 1, 2 (mod 3) etc . My proof is poor . I can't post it . Can anyone give me any hints ? :cry:

Re: ONTC Final Exam

Posted: Fri Sep 04, 2015 4:01 am
by Masum
Epshita32 wrote:In p5 can I use the cyclic version instead of the given one ?
Yeah. no problem

Re: ONTC Final Exam

Posted: Fri Sep 04, 2015 4:03 am
by Masum
Epshita32 wrote:In p2 , 2^m-1 according to m makes a sequence - if m = 1 , then 2^m-1 = 1 . For m as 2 , 2^m-1 = 3 . For m as 3 , 2^m-1 = 7 . Let 2^m-1 = X . The sequence - Xn = 2*X(n-1) + 1 where X1 = 1 . In the whole sequence only when m = 1 , X divides n^2+1 . For ex : n^2+1 = 1, 2 (mod 3) etc . My proof is poor . I can't post it . Can anyone give me any hints ? :cry:
Epshita, try to learn latex gradually :D
Now, as for your proof, it's not really a proof, more like an observation.
Killer hint: A prime divisor of $a^2+b^2$ where $\gcd(a,b)=1$ is of the form $4k+1$. Try now!

Re: ONTC Final Exam

Posted: Fri Sep 04, 2015 11:09 am
by Epshita32
Masum bai , I know this is not a proof . I was talking about my proof that I haven't posted yet . And thank you . My solution consists of the hint you gave . I was thinking of this was correct or not .

Re: ONTC Final Exam

Posted: Fri Sep 04, 2015 11:13 pm
by Masum
You can post the full solution if you want.
And bai, bai? Seriously? :|

Re: ONTC Final Exam

Posted: Sun Sep 06, 2015 10:54 am
by Epshita32
When will you post the solutions ? And I was thinking of new ways to solve p2 . Can it be done by congruence ?

Re: ONTC Final Exam

Posted: Mon Sep 07, 2015 1:18 am
by Masum
I posted the solutions of the first one in my new blog. But my laziness is getting the better of me again. When that passes, I will start writing again there. Stay tuned lol

Re: ONTC Final Exam

Posted: Fri Sep 11, 2015 12:49 pm
by tanmoy
$\text {Solution of problem 2}$:
Suppose,$p$ is an odd divisor of $n^{2}+1$.So, $p$ is either of the form $4x+1$ or $4x+3$,where $x$ any integer.Let $p$ is of the form $4x+3$.Then $n^{2} \equiv -1 (mod p)$.Or $n^{p-1} \equiv (n^{2})^{2x+1} \equiv -1 (mod p)$,which contradicts Fermat's little theorem.
So,$p$ is of the form $4x+1$.So, $2^{m}-1$ is of the form $4x+1$.So, $m=1$ is the only solution. :)

Re: ONTC Final Exam

Posted: Sat Sep 12, 2015 7:22 pm
by Masum
Ya, this is the way to do it.