mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2017-01-02, 15:18   #1
Xyzzy
 
Xyzzy's Avatar
 
"Mike"
Aug 2002

11110101101102 Posts
Default January 2017

https://www.research.ibm.com/haifa/p...nuary2017.html
Xyzzy is offline   Reply With Quote
Old 2017-02-15, 16:00   #2
Xyzzy
 
Xyzzy's Avatar
 
"Mike"
Aug 2002

2×3,931 Posts
Default

https://www.research.ibm.com/haifa/p...nuary2017.html
Xyzzy is offline   Reply With Quote
Old 2017-02-15, 16:32   #3
R. Gerbicz
 
R. Gerbicz's Avatar
 
"Robert Gerbicz"
Oct 2005
Hungary

58B16 Posts
Default

My sent solution with code(!):

x=(1+1/80)^80
y=(1+1/80)^81
the first and last ten digits of x: 2701484940, 6337890625
the first and last ten digits of y: 2735253502, 1142578125

For positive integer n value it is known that x=(1+1/n)^n and y=(1+1/n)^(n+1)
gives a rational solution of the equation, because:
x^y=((1+1/n)^n)^((1+1/n)^(n+1))=(1+1/n)^((n+1)^(n+1)/n^n)
y^x=((1+1/n)^(n+1))^((1+1/n)^n)=(1+1/n)^((n+1)^(n+1)/n^n)
hence x^y=y^x. If we want x, where we can see the last eight (or some) digits
then n=2^a*5^b for some non-negative a,b integers.
Restricting the search for a,b<10 we have found 3 solutions,
the simple PARI-GP solution, using only integer arithmetic:

for(a=0,9,for(b=0,9,n=2^a*5^b;e=max(a,b);M=10^8;\
r=Mod(n+1,M)^n*Mod(2,M)^(n*(e-a))*Mod(5,M)^(n*(e-b));\
r=lift(r);test=1;v=vector(10,i,0);for(i=1,8,\
res=1+(r%10);r\=10;v[res]+=1;if(v[res]>1,test=0));\
if(test,X=[a,b,n];print([a,b,n]))))

what has found n=80;3125;1953125 as a solution,
this gives for example that x=(1+1/80)^80 and y=(1+1/80)^81 a solution.

A "cut" function used to get the first and last
L digits of a positive rational number:

cut(r,L)={tmp=r;d=10^L;while(type(tmp)!="t_INT",tmp*=10);\
t=tmp;while(tmp>=d,tmp\=10);return([tmp,t%d])}

In the second email:

Just for small correction obvioulsy
x starts as 2.701484940
and y with 2.735253502
if you needed also the first (ten) digits with a decimal point.

ps. use cut() only if r>0 has a finite representation in base 10.
R. Gerbicz is offline   Reply With Quote
Old 2017-02-17, 01:20   #4
uau
 
Jan 2017

79 Posts
Default

It's pretty easy to directly show starting from the question rationals of that form are answers and are the only rational answer:

x^y = y^x
Let 'a' be such that x^a = y, and replace y by that in above
x ^ x ^ a = x ^ (a*x)
Take x-based logarithm
x ^ a = a*x
Since x^a = y, this means a = y/x, thus rational too
Let 'b' be such that a = x^b
x ^ x ^ b = x^b * x
Take x-based logarithm
x^b = b + 1
x^b equals a, thus b = a-1 and rational
Let x = p/q, b = n/m where p,q,n,m integers
(p/q)^(n/m) = (n+m)/m
If the value on the left is rational (as per above it equals a and must be rational for a valid solution), it must be n:th power of one. Thus the value on the right must be too. So (n+m) and m are n:th powers. But it's not possible for two integers n apart (m and n+m) to both be n:th powers unless n=1. Thus:
(p/q)^(1/m) = (1+m)/m
p/q = ((1+m)/m)^m
And this gives a solution for any integer m.

Last fiddled with by uau on 2017-02-17 at 01:20
uau is offline   Reply With Quote
Old 2017-02-22, 21:34   #5
R. Gerbicz
 
R. Gerbicz's Avatar
 
"Robert Gerbicz"
Oct 2005
Hungary

3·11·43 Posts
Default

A longer article on this topic: http://www.komal.hu/cikkek/loczy/pow...mpower.e.shtml in English, but the original was in Hungarian from 2000 in Kömal (http://db.komal.hu/KomalHU/showpdf.p...Cikk&id=200047).
R. Gerbicz is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
January 2018 Xyzzy Puzzles 0 2018-01-02 03:09
January 2016 R. Gerbicz Puzzles 17 2016-02-04 17:00
January 2015 Xyzzy Puzzles 1 2015-02-02 17:17
January 2008 Status Wacky NFSNET Discussion 0 2008-01-14 00:33
Records in January wblipp ElevenSmooth 10 2004-03-22 01:26

All times are UTC. The time now is 22:23.

Tue Dec 1 22:23:30 UTC 2020 up 82 days, 19:34, 1 user, load averages: 2.31, 1.91, 1.92

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.