Find all $n$s

For students of class 9-10 (age 14-16)
User avatar
Phlembac Adib Hasan
Posts:1016
Joined:Tue Nov 22, 2011 7:49 pm
Location:127.0.0.1
Contact:
Find all $n$s

Unread post by Phlembac Adib Hasan » Fri May 18, 2012 5:03 pm

Find all positive integer $n$ such that $n^{14}+(n^2+1)(n+1)$ is a prime.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules

User avatar
Phlembac Adib Hasan
Posts:1016
Joined:Tue Nov 22, 2011 7:49 pm
Location:127.0.0.1
Contact:

Re: Find all $n$s

Unread post by Phlembac Adib Hasan » Sat May 19, 2012 8:37 pm

Nobody interested?Well, I'm giving the solution.
Try to prove $n^4+n^3+n^2+n+1|n^{14}+(n^2+1)(n+1)$.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules

User avatar
Nadim Ul Abrar
Posts:244
Joined:Sat May 07, 2011 12:36 pm
Location:B.A.R.D , kotbari , Comilla

Re: Find all $n$s

Unread post by Nadim Ul Abrar » Mon May 21, 2012 8:52 pm

How did you figure that out ?
$(n-1)[n^{14}+(n^2+1)(n+1)]=n^{15}-n^{14}+(n-1)(n^3+n^2+n+1)=n^{15}-n^{14}+n^4-1$

now
Since $ x^5\equiv 1mod x^5-1$, $n^{15}-n^{14}+n^4-1 \equiv 0 mod x^5-1$ :p
$\frac{1}{0}$

User avatar
Phlembac Adib Hasan
Posts:1016
Joined:Tue Nov 22, 2011 7:49 pm
Location:127.0.0.1
Contact:

Re: Find all $n$s

Unread post by Phlembac Adib Hasan » Sat May 26, 2012 6:06 pm

Nadim Ul Abrar wrote:How did you figure that out ?
$(n-1)[n^{14}+(n^2+1)(n+1)]=n^{15}-n^{14}+(n-1)(n^3+n^2+n+1)=n^{15}-n^{14}+n^4-1$

now
Since $ x^5\equiv 1mod x^5-1$, $n^{15}-n^{14}+n^4-1 \equiv 0 mod x^5-1$ :p
This problem is self-made.Let $f(n)=n^{14}+(n^2+1)(n+1)$.Note that unity has five fifth roots namely $1,\omega,\omega^2,\omega^3,\omega^4$.First expand that thing.Then notice the powers form a complete residue system of $5$.Then this idea comes to put values of the fifth roots of unity to that function.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules

Post Reply