mersenneforum.org > Math Modified fermat's last theorem
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2007-05-11, 23:42 #1 Citrix     Jun 2003 7·233 Posts Modified fermat's last theorem I found this problem on a website (lost link to the website). The problem asks for solutions of x^x*y^y=z^z Are any solutions possible? If possible I think x and y have to be smooth. Any thoughts on how to approach this? Last fiddled with by Citrix on 2007-05-11 at 23:43
2007-05-12, 03:34   #2
wblipp

"William"
May 2003
Near Grandkid

94716 Posts

Quote:
 Originally Posted by Citrix The problem asks for solutions of x^x*y^y=z^z Are any solutions possible?
I suppose you want to exclude x=1 and the symmetric y=1?

 2007-05-12, 15:05 #3 Citrix     Jun 2003 7×233 Posts yes
 2007-05-15, 06:58 #4 nibble4bits     Nov 2005 2·7·13 Posts It almost has to involve logorythms but I may be wrong in this intuition. :LOL: Likely! Did you mean (x^x)*(y^y)=z^z? Or x^(x(y^y))=z^z? Last fiddled with by nibble4bits on 2007-05-15 at 06:59
2007-05-15, 16:56   #5
victor

Oct 2005
Fribourg, CH

22×32×7 Posts

Quote:
 Originally Posted by nibble4bits It almost has to involve logorythms but I may be wrong in this intuition. :LOL: Likely! Did you mean (x^x)*(y^y)=z^z? Or x^(x(y^y))=z^z?
He meant x^x*y^y=z^z
And this means (x^x)*(y^y)=z^z

I think we can conjecture there is no integer solution.

btw, I tested $x^x \cdot y^y=z^z$ for each $x, y, z \in [2; 500]$

2007-05-15, 21:31   #6
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

2·3·31·41 Posts

Quote:
 Originally Posted by victor He meant x^x*y^y=z^z And this means (x^x)*(y^y)=z^z I think we can conjecture there is no integer solution. btw, I tested $x^x \cdot y^y=z^z$ for each $x, y, z \in [2; 500]$
(1) This conjecture can not be considered as even remotely related to FLT.
FLT is a conjecture about algebraic (abelian) varieties. This is not one.

(2) Proving that this equation has no solution is easy. Hint: if a prime
divides the right side count how many times that it does. It must
divide the left side the same number of time.

This leads to a simple additive relation between x,y, and z. Which then
leads to the impossibility.

 2007-05-15, 22:11 #7 victor     Oct 2005 Fribourg, CH 22×32×7 Posts 1) I didn't said it was related to FLT 2) Thanks a lot for these specifications, really interresting
 2007-05-16, 04:53 #8 Citrix     Jun 2003 7×233 Posts Doesn't make a difference if it is related to FLT or not. lets say for a given prime p, such that x=p^l*a and y=p^m*b and z=p^n*c we have l*x+m*y=n*z How does one proceed from here?
2007-05-16, 09:31   #9
akruppa

"Nancy"
Aug 2002
Alexandria

2,467 Posts

Quote:
 Originally Posted by victor 1) I didn't said it was related to FLT
No, but Citrix originally did. See thread title.

Alex

2007-05-16, 09:34   #10
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

762610 Posts

Quote:
 Originally Posted by Citrix Doesn't make a difference if it is related to FLT or not. lets say for a given prime p, such that x=p^l*a and y=p^m*b and z=p^n*c we have l*x+m*y=n*z How does one proceed from here?

Select a prime that only divides z to the first power.

2007-05-16, 09:51   #11
Citrix

Jun 2003

7·233 Posts

Quote:
 Originally Posted by R.D. Silverman Select a prime that only divides z to the first power.
How does this help? Sorry, I can't see the solution. If a prime divides Z, it must be a factor of x or y? So if n>0 then m or l must be >0 or =n.

Alex: the website called it modified LFT (not me)

 Similar Threads Thread Thread Starter Forum Replies Last Post devarajkandadai Number Theory Discussion Group 12 2017-12-25 05:43 devarajkandadai Number Theory Discussion Group 14 2017-11-12 20:04 devarajkandadai Number Theory Discussion Group 1 2017-07-07 13:56 devarajkandadai Number Theory Discussion Group 0 2017-06-24 12:11 devarajkandadai Number Theory Discussion Group 2 2017-06-23 04:39

All times are UTC. The time now is 21:43.

Sun Sep 24 21:43:12 UTC 2023 up 11 days, 19:25, 0 users, load averages: 0.99, 1.04, 1.06

Copyright ©2000 - 2023, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔