Skip to main content
MathOverflow

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

26
  • 4
    $\begingroup$ This affine varietiy has rational points, like $(4/3,1/3,1/6)$ which, presumably, makes Brauer-Manin obstruction "stuff" harder to use. $\endgroup$ Commented Mar 10 at 9:48
  • 1
    $\begingroup$ For what it worth, $x$ can not be odd: we have $y^2\equiv 2\pmod x$, thus all prime divisors of $x$ are $\pm 1 \pmod 8$, thus so is $x$, but both cases are impossible modulo 8 $\endgroup$ Commented Mar 10 at 10:44
  • 2
    $\begingroup$ Yes, moreover, modulo $16$ analysis return only two even values for $x$, $2$ and $6$. Because all prime divisors of $x/2$ are $\pm 1$ mod $8$, $6$ is impossible. Further, modulo $9$ analysis shows that $x$ is $1$ mod $3$. Hence, $x$ is $34$ mod $48$. $\endgroup$ Commented Mar 10 at 13:50
  • 4
    $\begingroup$ Since $3x-1$ and $x$ have to have the same sign, the equation is positive definite in $y,z$ and so $y$ and $z$ both must be $O(x)$. The heuristic probability that a solution exists for fixed $x$ is going to be $O(1/x)$, and then unless the constant in the big $O$ is very large, summing only over $x$ congruent to $34$ mod $48$ is going to give a prediction for the number of solutions with $x<X $ that is a small constant times $\log X$. So maybe the search just isn't big enough. $\endgroup$ Commented Mar 10 at 18:38
  • 1
    $\begingroup$ Now checked for |y| up to three billions ($3\cdot 10^9), still no solutions. I will stop search here, at least temporary. $\endgroup$ Commented Mar 14 at 18:30