Nick's Mathematical Puzzles: Solution 118



Nick's Mathematical Puzzles: Solution 118

Solution to puzzle 118: Powers of 2: deleted digit

Skip restatement of puzzle.Find all powers of 2 such that, after deleting the first digit, another power of 2 remains.  (For example, 25 = 32.  On deleting the initial 3, we are left with 2 = 21.)  Numbers are written in standard decimal notation, with no leading zeroes.


Suppose the first digit of 2n is a, and that after deleting that digit, we are left with 2m.
Then 2n = 10ka + 2m, for some integer k.
Hence 2n − 2m = 10ka, and so 2n−m − 1 = 2k−m5ka is divisible by 5.
If 2n−m − 1 > 0 is divisible by 5, then n − m = 4r, for some positive integer r.  (Consider the powers of 2, modulo 5.)

Hence 10ka = 2m(24r − 1).
 = 2m(22r + 1)(22r − 1).
 = 2m(22r + 1)(2r + 1)(2r − 1).(1)

Note that, since 1 less than or equal to a less than or equal to 9, the left-hand side of (1) contains at most two distinct odd prime factors.
We will show that, if r > 1, the right-hand side of (1) must contain at least three distinct odd prime factors.

Note that 22r + 1 and 22r − 1 are odd integers that differ by 2.  Hence they are relatively prime.  (Their greatest common divisor must divide their difference, 2, and therefore must be equal to 1, as the integers are odd.)
Since 22r − 1 = (2r + 1)(2r − 1), 22r + 1 is relatively prime with 2r + 1 and with 2r − 1.
Similarly, 2r + 1 and 2r − 1 are odd integers that differ by 2, and are therefore relatively prime.
In conclusion, 22r + 1, 2r + 1, and 2r − 1 are all odd, pairwise relatively prime integers.

If r > 1, all of the integers are greater than 1, and hence each must have a distinct odd prime factor.
This contradicts the fact, noted above, that the left-hand side of (1) has at most two distinct odd prime factors.
We conclude that, for any solution, r = 1.

If r = 1, then 10ka = 2m · 3 · 5.
Hence k = 1, and a = 2m−1 · 3.
Since a less than or equal to 9, we must have (m, a) = (1, 3) or (2, 6).

Therefore, the only powers of 2 such that, on deleting the first digit, another power of 2 remains, are 25 = 32 and 26 = 64.


Read full article from Nick's Mathematical Puzzles: Solution 118


No comments:

Post a Comment

Labels

Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

Popular Posts