<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Binary_system on
Farooq's</title><link>http://far.chickenkiller.com/tags/binary_system/</link><description>
Recent content
in Binary_system
on
far.chickenkiller.com</description><managingEditor>
fkz on riseup dot net
(Farooq Karimi Zadeh)</managingEditor><webMaster>
fkz on riseup dot net
(Farooq Karimi Zadeh)</webMaster><generator>Hugo -- gohugo.io</generator><language>en-us</language><copyright>(C) Some rights are reserved under CC-BY-SA 4.0 for Farooq Karimi Zadeh</copyright><lastBuildDate>
Sun, 16 Jan 2022 21:49:16 +0330</lastBuildDate><atom:link href="http://far.chickenkiller.com/tags/binary_system/index.xml" rel="self" type="application/rss+xml"/><item><title>2^x+2^y=k</title><link>http://far.chickenkiller.com/math/2x-2y-k/</link><pubDate>Sun, 16 Jan 2022 21:49:16 +0330</pubDate><guid>http://far.chickenkiller.com/math/2x-2y-k/</guid><description>
&lt;p>2&lt;!-- raw HTML omitted -->x&lt;!-- raw HTML omitted --> + 2&lt;!-- raw HTML omitted -->y&lt;!-- raw HTML omitted --> = k where x, y and k are positive integers and k is a constant. The question&amp;rsquo;s that for different values of k how many solution does our equation have? For any odd k there is no solution and for positive powers of 2 there is one. We want a general solution for this equation.&lt;/p>
&lt;h3 id="solution-by-susam-pal">Solution by Susam Pal&lt;/h3>
&lt;p>We will take this fact for granted: Every positive integer can be uniquely expressed as the sum of distinct powers of 2. In other words, every positive integer has a unique binary representation.&lt;/p>
&lt;p>Now consider the case where x = y. Let m = x = y. Then k = 2&lt;!-- raw HTML omitted -->m&lt;!-- raw HTML omitted --> + 2&lt;!-- raw HTML omitted -->m&lt;!-- raw HTML omitted --> = 2&lt;!-- raw HTML omitted -->(m+1)&lt;!-- raw HTML omitted -->. Further, if k = 2&lt;!-- raw HTML omitted -->(m+1)&lt;!-- raw HTML omitted --> where m &amp;gt; 1, x = y = m is a solution. There cannot be a solution in which x != y because that would result in another binary representation of k apart from the existing representation of 2&lt;!-- raw HTML omitted -->(m+1)&lt;!-- raw HTML omitted --> which would contradict the uniqueness of the binary representation of k. Therefore there must be exactly 1 solution when k is a positive power of 2.&lt;/p>
&lt;p>Now consider the case where x != y. Let x = m and y = n. Then k = 2&lt;!-- raw HTML omitted -->m&lt;!-- raw HTML omitted --> + 2&lt;!-- raw HTML omitted -->n&lt;!-- raw HTML omitted --> = 2&lt;!-- raw HTML omitted -->n&lt;!-- raw HTML omitted --> + 2&lt;!-- raw HTML omitted -->m&lt;!-- raw HTML omitted -->. Thus both (x = m, y = n) and (x = n, y = m) are solutions. There cannot be a solution in which x = y because that would lead to k = 2&lt;!-- raw HTML omitted -->(x+1)&lt;!-- raw HTML omitted --> which violates the uniqueness of the binary representation of k. Also, there cannot be another solution in which either x or y does not belong to {m, n} because that would too violate the uniqueness of the binary representation of k. We conclude that there must be exactly 2 solutions when k is a sum of two distinct positive powers of 2.&lt;/p>
&lt;p>For any other positive integer k, no solutions are possible. We can show this by contradiction. Let k be such that it is neither a positive power of 2 nor a sum of two distinct positive powers of 2. If we assume that a solution exists for such k, then we have two positive integers x and y such that 2&lt;!-- raw HTML omitted -->x&lt;!-- raw HTML omitted --> + 2&lt;!-- raw HTML omitted -->y&lt;!-- raw HTML omitted --> = k. If x = y, it contradicts the fact that k is not a positive power of 2. If x != y, it contradicts the fact that k is a sum of two distinct positive powers of 2.&lt;/p>
&lt;p>Thus, we can conclude that the equation has exactly 1 solution when k is a positive power of 2, 2 solutions when k is a sum of two distinct positive powers of 2, no solutions otherwise.&lt;/p></description></item></channel></rss>