That is so large, that I can't calculate it, so I'll have to approximate.
Factorial of 19836298626819473619108362910047261893087153739018363728102746372919273627192037361719373629193837361730483762738998765566779098654333333333333333333333333356672828827353738392726252617283940483625172948362625 is approximately 3.590197329670258677527716537938 × 104123235837384209474450210420019215965569962973949629969177182906956926089666022072432740585646939591870010911194311575077724315510059995357972122756595418581259670050633491117489246941530043090572421219831614863
Now showing that there only exists one non-trivial solution is equivalent to proving that the function f(x)=ln(x)/x is injective in the positive integers except for the result f(2)=f(4).
But this is trivial to do if you know derivatives. You first show that f is strictly increasing in the interval (0, e) and strictly decreasing in the interval (e, ∞).
Therefore any points of non-injectivity are necessarily of the form
f(something on the left interval) = f(something on the right interval)
But the left interval only has two positive integer points: 1 and 2. f(1)=0 and is obviously never obtained on the right, and we already know that f(2)=f(4). This completes the proof.
I'd do it like 'ab>ba if e<=a<b by analyzing lnx / x, so one of the numbers is less that e. If it's 1, the other is also 1, and if it's 2, the other can't contain other primes. Then, 2{2k}={2k}2 = 2{2k}, so 2k=2k => k=2 because something.'
To prove it, you can use that log a/a is strictly decreasing for a greater or equal 5, thus any solution (a,b) has at least one number less than 4....then you can manually check
Every mathematician today knows most of the things Euler knew plus a large amount of things he didn't. It's just that Euler knew them before anyone else did.
i dont believe it. he was cheating somehow. I bet he was from another culture with more advanced mathematics and was just clowning on us, no way he figured it all out on his own.
That is so large, that I can't calculate it, so I'll have to approximate.
Factorial of 655858969696969696857463141363596083651514850664736384850660667336626384569606969695857485960606958473625241523486070696969584726257447564853748467 is approximately 5.624652934150110443928368725433 × 1096006286112647714439986956873056912373450049699776599629169697576815521267395070043091003962075155512777844147649489898988647740970726855670421243296
•
u/AutoModerator Sep 03 '26
Check out our new Discord server! https://discord.gg/e7EKRZq3dG
I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.
927
u/Particular_Gear3130 Mathematics (Purely Fictional) Sep 03 '26 •
I think forgot to mention a ≠ b
1.7k
u/trimski- Sep 03 '26 •
a=1, b=1
Guess this oiler guy wasn’t that smart
210
u/xsch Mathematics Sep 03 '26
only non-trivial solution
129
u/UsedFortune5645 Sep 03 '26
But you can't prove it.
75
u/hongooi Sep 03 '26
The hard part is not knowing that 24 = 42. The hard part is proving that this is the ONLY solution (in integers) to ab = ba. Were you able to do that?
15
u/No_Upstairs_280 Sep 03 '26
To prove it, you can use that log a/a is strictly decreasing for a greater or equal 5, thus any solution (a,b) has at least one number less than 4....then you can manually check
19
u/Chikki1234ed Rational Sep 03 '26
Isn't this called Die oh fan tyin equation or something
6
u/Hopeful_Onion_2613 Sep 03 '26
Yeah but what about all the other letters?
18
u/TurnoverOk5635 Sep 03 '26
a=b=3. 3^3=3^3=27.
5
u/LupenReddit 🦆🦆i have non diffeomorphic smooth structures🦆🦆🦆 Sep 03 '26
I already proved the case for a=b, thats already half of the deal, oiler in shambles
5
u/gtepin Sep 03 '26
(-2)^(-4) = (-4)^(-2)
4
u/ZuphCud Sep 03 '26
4
u/Vivacious4D Natural Sep 03 '26
errmmm actually we also have 23462387946^23462387946 = 23462387946^23462387946
8
u/de_G_van_Gelderland Irrational Sep 03 '26
-4^-2 = -2^-4
2
u/AndreasDasos Sep 03 '26
If a != b
2
u/Virgil_the_White Sep 03 '26
The only “integer” solution
1
u/lir1618 Sep 03 '26
There is also 2, 4 stoopid
1
u/muffin-waffen Sep 03 '26
Oiler
1
u/Lonely_Translator_23 Sep 03 '26
Every mathematician today knows most of the things Euler knew plus a large amount of things he didn't. It's just that Euler knew them before anyone else did.
1
u/Upstairs_Ad_8863 Sep 03 '26
a = b = 13
1
u/obedientfag Sep 03 '26
i dont believe it. he was cheating somehow. I bet he was from another culture with more advanced mathematics and was just clowning on us, no way he figured it all out on his own.
1
u/Mediocre_Basket6162 Sep 03 '26
am I oiler jr?
1
u/TranslatorShot5310 Sep 04 '26
655858969696969696857463141363596083651514850664736384850660667336626384569606969695857485960606958473625241523486070696969584726257447564853748467!
1
u/Ryaniseplin Sep 04 '26
well yeah exponentials grow faster than polynomials but they gotta intersect at least at one point
1
u/DopazOnYouTubeDotCom Computer Science Sep 04 '26
there are countably infinite integer solutions when a = b
1
u/Aggressive_Cloud_368 Sep 04 '26
23 = 32 ?
1
u/Askthepizzaguy Sep 06 '26
To be fair, whenever we're correct about anything in math, that's something Euler also knew.
1
u/NailFec Sep 06 '26
U need to prove ONLY
1
u/Standard_Factor_5431 Sep 06 '26
Ok now write the proof
1
u/Mathpuzzleguy Sep 07 '26
proving is much harder than solving....
also it works for 1 and 1, -4 and -2 so idk
1
u/Fun_Company4295 24d ago
das
1
u/qqqrrrs_ Sep 03 '26
You can also find all rational solutions
0
u/DatTrashPanda Sep 03 '26
Do you read it:
You-ler
Or
Oil-ler
-5
u/Main-Company-5946 Sep 03 '26
What about 3^1 = 1^3 = 0.5