Page 1 of 1

BdMO National 2012: Higher Secondary, Secondary 06

Posted: Sat Feb 11, 2012 11:22 pm
by Moon
Problem:
Show that for any prime $p$, there are either infinitely many or no positive integer $a$, so that $6p$ divides $a^p + 1$. Find all those primes for which there exists no solution.

Re: BdMO National 2012: Higher Secondary, Secondary 06

Posted: Sun Feb 12, 2012 9:42 pm
by photon
6 divides $a^p+1$,so, a is odd,$a^p$ is in form 3n-1.so p cannot be 2.
so, a is in form $12n-1$ and $12n+5$ form.(respectively in form $4k-1,4k+1$)
(a,p)=1 so,
p divides $a^p-a$
p divides $a^p+1$
:arrow: p divides $a+1$
if a is in form $12n-1$,$a+1=12n$,then p divides 12n :arrow: p divides n
if a is in form $12n+5$,$a+1=6(2n+1)$ then p divides 2n+1
set of a={12n:p divides n} U {12n+5:p divides 2n+1}
except 2 any prime p it happens.
is it ok?(sorry for not using latex properly)

Re: BdMO National 2012: Higher Secondary, Secondary 06

Posted: Sun Feb 12, 2012 9:55 pm
by FahimFerdous
You're right.

I just took a=6kp-1. It kills the problem.

Re: BdMO National 2012: Higher Secondary, Secondary 06

Posted: Mon Feb 13, 2012 5:27 pm
by nafistiham
when $p$ is not $2$, $p$ is odd.so,
\[a+1|a^p+1\]
so, $a$ has infinitely many solutions
when $p=2$, $a \neq 2k$ as $6p=12$ is even
if, $a=2k+1$
suppose,
\[12|a^2+1\]
\[\rightarrow 12| 4k^2 + 4k + 1 + 1\]
\[\rightarrow 6 | 2(k^2+k)+1\]

contradiction ;)

Re: BdMO National 2012: Higher Secondary, Secondary 06

Posted: Mon Feb 13, 2012 11:12 pm
by abdullah al munim
For p=2,there is no quadratic residue of a number modulo 12 which equals -1.for the odd primes, a=6p-1+6kp will satisfy the condition for every k.

Re: BdMO National 2012: Higher Secondary, Secondary 06

Posted: Sat Feb 25, 2012 6:47 pm
by nafistiham
Masum vaia wrote: Right now, my number of posts is a palindromic cube of $3$ digits. Find the number of my posts.
I think this problem is even better. :(
$4^3,100,10^3=1000$
trying $5,6,7,8,9$, the palinedrome is $343=7^3$
how can i do it without trial and error :?