Hungery-1911/3 (BOMC-2)

Discussion on Bangladesh National Math Camp
User avatar
sm.joty
Posts:327
Joined:Thu Aug 18, 2011 12:42 am
Location:Dhaka
Hungery-1911/3 (BOMC-2)

Unread post by sm.joty » Wed Mar 28, 2012 12:35 pm

An one for you :)
Prove that,
$3^n+1$ is not divisible by $2^n $ for any integer $n$
হার জিত চিরদিন থাকবেই
তবুও এগিয়ে যেতে হবে.........
বাধা-বিঘ্ন না পেরিয়ে
বড় হয়েছে কে কবে.........

User avatar
SANZEED
Posts:550
Joined:Wed Dec 28, 2011 6:45 pm
Location:Mymensingh, Bangladesh

Re: Hungery-1911/3 (BOMC-2)

Unread post by SANZEED » Wed Mar 28, 2012 1:45 pm

Vaia,I think $3^{n}+1$ is divisible by $2^{n}$ when $n=0,1$.So it is not true for all integers. :|
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$

User avatar
FahimFerdous
Posts:176
Joined:Thu Dec 09, 2010 12:50 am
Location:Mymensingh, Bangladesh

Re: Hungery-1911/3 (BOMC-2)

Unread post by FahimFerdous » Wed Mar 28, 2012 2:05 pm

Just taking mod 8 kills it.
Your hot head might dominate your good heart!

User avatar
FahimFerdous
Posts:176
Joined:Thu Dec 09, 2010 12:50 am
Location:Mymensingh, Bangladesh

Re: Hungery-1911/3 (BOMC-2)

Unread post by FahimFerdous » Wed Mar 28, 2012 2:06 pm

Yeah, Sanzeed is right. For n=0,1 it doesn't stand.
Your hot head might dominate your good heart!

User avatar
SANZEED
Posts:550
Joined:Wed Dec 28, 2011 6:45 pm
Location:Mymensingh, Bangladesh

Re: Hungery-1911/3 (BOMC-2)

Unread post by SANZEED » Wed Mar 28, 2012 2:28 pm

Fahim vai,post the full solution,not necessarily formal...
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$

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

Re: Hungery-1911/3 (BOMC-2)

Unread post by Nadim Ul Abrar » Wed Mar 28, 2012 2:55 pm

if n is odd
then $3^n+1\equiv 1.3+1 \equiv 4 (mod8)$ ( $3^2\equiv 1mod8$)

if even then
$3^n+1\equiv 1+1 \equiv 2 (mod8)$
$\frac{1}{0}$

User avatar
FahimFerdous
Posts:176
Joined:Thu Dec 09, 2010 12:50 am
Location:Mymensingh, Bangladesh

Re: Hungery-1911/3 (BOMC-2)

Unread post by FahimFerdous » Wed Mar 28, 2012 5:51 pm

Nadim's solution is same as mine.
Your hot head might dominate your good heart!

User avatar
Sazid Akhter Turzo
Posts:69
Joined:Sat Feb 18, 2012 9:15 am
Location:Sirajganj
Contact:

Re: Hungery-1911/3 (BOMC-2)

Unread post by Sazid Akhter Turzo » Wed Mar 28, 2012 7:04 pm

same as Fahim vaia.
Turzo

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

Re: Hungery-1911/3 (BOMC-2)

Unread post by Phlembac Adib Hasan » Thu Mar 29, 2012 11:19 am

Very easy.Same to Fahim vaia.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules

User avatar
sm.joty
Posts:327
Joined:Thu Aug 18, 2011 12:42 am
Location:Dhaka

Re: Hungery-1911/3 (BOMC-2)

Unread post by sm.joty » Thu Mar 29, 2012 1:41 pm

I use induction. But Fahim & othrs method is quite easy than mine. :D
And for $n=0,1$ this relation is false. (this is not my fault.It is a fault of Hungarian Olympiad Committee :mrgreen: )
হার জিত চিরদিন থাকবেই
তবুও এগিয়ে যেতে হবে.........
বাধা-বিঘ্ন না পেরিয়ে
বড় হয়েছে কে কবে.........

Post Reply