Tagged Questions

76 views

Using the circle method to prove that there are no solutions to diophantine equaltions

Would it be possible to use the circle method to prove that there are no solutions to certain diophantine equations. For example, could one use the circle method to prove the fact that there are no ...
289 views

What analytic tools can provide a lower bound for this Diophantine equation?

The resolution of the Diophantine equation $$m! = n(n+1)$$ was asked on M.SE. My intuition says that this cannot be solved by elementary means - apologies if I am mistaken. I felt that the following ...
517 views

Representations with Triangular Numbers

A well known theorem of Gauss says that any natural number $n$ may be written as the sum of three triangular numbers - $$n={a_{1} \choose 2}+{a_{2} \choose 2}+{a_{3} \choose 2}$$ The following ...
310 views

Growth of $n=n(k)$ for which there's a non-trivial solution to $x_1^k+\cdots+x_n^k=y^k$?

Walter Hayman just asked me the following question. What, if anything, is known about the growth of the function $n(k)$, where $k\geq1$ is an integer, and $n=n(k)\geq2$ is the smallest integer for ...
The easier Waring problem asks for the least number $v=v(k)$ such that every every integer is a sum of $v$ $k$'th powers with signs, i.e. every $n\in \mathbb{N}$ is of the form n=x_1^k\pm ...
The $s$ squares problem is to count the number $r_s (n)$ of integer solutions $(x_1,x_2,...,x_s)$ of the Diophantine equation $x_{1}^{2}+x_{2}^{2}+...+x_{s}^{2}=n$ in which changing the sign or ...