# Tagged Questions

**3**

votes

**0**answers

120 views

### polynomials in many variables and Hasse principle

I was wondering whether there exists any result of the form
"if $f \in \mathbb{Z}[x_1, ..., x_k]$ is a polynomial (not form! I don't require homogeneity) of total degree $n$, with $k \geq \delta ...

**0**

votes

**0**answers

78 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 ...

**5**

votes

**1**answer

291 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 ...

**5**

votes

**6**answers

524 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 ...

**10**

votes

**0**answers

314 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 ...

**16**

votes

**2**answers

610 views

### Lower bounds on the easier Waring problem

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 ...

**0**

votes

**1**answer

345 views

### An asymptotic expression for the solution to the squares problem suggested by statistical mechanics

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 ...