A community for students. Sign up today!
Here's the question you clicked on:
 0 viewing
 2 years ago
Let m and n be two positive integers. Show that (36 m+ n)(m+36 n) cannot be a power of 2.
 2 years ago
Let m and n be two positive integers. Show that (36 m+ n)(m+36 n) cannot be a power of 2.

This Question is Closed

sauravshakya
 2 years ago
Best ResponseYou've already chosen the best response.0LET (36m+n)=2^x AND (m+36n)=2^y THEN, (36m+n)(m+36n)=2^(x+y) AlSO, x and y must me both integers

sauravshakya
 2 years ago
Best ResponseYou've already chosen the best response.0Now, n=2^x  36m THEN, m+36n=2^y m+36(2^x36m)=2^y 36 * 2^x 1295m=2^y

sauravshakya
 2 years ago
Best ResponseYou've already chosen the best response.0Now, I think I have to prove that y is never a integer

sauravshakya
 2 years ago
Best ResponseYou've already chosen the best response.02^y=36*2^x1295m 2^y=2^x(361295m/2^x) Now, 2^y must be positive so, (361295m/2^x) must be positive... Now let 2^z=361295m/2^x HERE z also must be an positive integer..... So, 2^z can be 4,8,16,32 NOW,

sauravshakya
 2 years ago
Best ResponseYou've already chosen the best response.0361295m/2^x= 4, 8, 16, 32 1295m/2^x=32, 28 ,16 ,4 2^x=1295m/32 , 1295m/28 , 1295m/16 , 1295m/4

sauravshakya
 2 years ago
Best ResponseYou've already chosen the best response.0Now, 2^x=1295m/32 , 1295m/28 , 1295m/16 , 1295m/4 2^x=40.47 m , 46.25m , 80.94m ,323.75m Thus, for no positive integer value of m we will get x a integer value......

sauravshakya
 2 years ago
Best ResponseYou've already chosen the best response.0Hence, (36 m+ n)(m+36 n) cannot be a power of 2.

sauravshakya
 2 years ago
Best ResponseYou've already chosen the best response.0I have jumped some step......... I hope I made it clear

mukushla
 2 years ago
Best ResponseYou've already chosen the best response.3for \(m=n\) the statement is true suppose \(m\ge n\) in order for \((36 m+ n)(m+36 n)\) to be a power of \(2\) \[36m+n=2^a\]\[m+36n=2^b\]\[a> b\]\[\frac{36m+n}{m+36n}=2^{ab}=2^c \ \ \ c\ge 1\]\[m+36n  36m+n\]\[m+36n36(m+36n)(36m+n)=1295n\]since \(\gcd(m+36n \ , \ n)=1\) so \(m+36n\) is a divisor of \(1295\) so \((36 m+ n)(m+36 n)\) is not a power of 2

experimentX
 2 years ago
Best ResponseYou've already chosen the best response.0looks like gcd is very important ... i never liked it.

eliassaab
 2 years ago
Best ResponseYou've already chosen the best response.3Here is my proof. Suppose not, let m and n be the smallest such that this product is a power of 2. It is easy to see that m and n are divisible by 2. So m = 2 M and n = 2 N. Since ( 36 (2M) + 2 N)(36(2N)+2 M) is a power of 2,then ( 36 ( M) + N)(36( N+ M) is a power of 2 (contradiction).
Ask your own question
Ask a QuestionFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.