5
$\begingroup$

Here $a,b,c,d,e$ are distinct and all greater than $1$.

This question was formerly posted on Math.Stackexchange, precisely here, but seems to be more general than some other tough number theory problems found there.

Modular arithmetic does not seem helpful and I haven't seen many theories relating to exponential diophantine equations where the base(s) are variables as well or where the variables are "permuted" and taken as sums. These considerations give rise to the following related subquestions:

  1. Are there any equations that are simpler and similar to this one where more information is known?

  2. What if $e$ is fixed, or perhaps specifically $e=2$?

The motivation is that there are clearly very many solutions (many simple) even when bounding the solutions by a small constant when one allows lack of distinctness, but seemingly none with distinctness.

Improve this question
$\endgroup$
2
  • 1
    $\begingroup$ I downvoted because there is no motivation for the requirement that $a,b,c,d,e$ are all distinct, and because the MathStackExchange question in fact acts about $a\neq b\neq c\neq d\neq e\neq a$ (allowing $a=c$ and the like), which is equally unmotivated but different. $\endgroup$
    – user44143
    Commented Oct 24, 2021 at 6:53
  • 6
    $\begingroup$ @MattF. It is clear to anyone the poster meant the distinctness requirement, but did not understand the non-transivity of $\neq$. Your suggestion otherwise is completely arbitrary, and I don't think anyone on MSE thought that's what they meant. The motivation is that there are clearly very many solutions (many simple) even when bounding the solutions by a small constant when one allows lack of distinctness, but seemingly none with distinctness. $\endgroup$
    – Derek Luna
    Commented Oct 24, 2021 at 6:57

0

Reset to default

You must log in to answer this question.