Related papers: Extended Lagrange's four-square theorem
The Hasse principle and weak approximation is established for equations of the shape P(t)=N(x_1,x_2,x_3,x_4), where P is an irreducible quadratic polynomial in one variable and N is a norm form associated to a quartic extension of the…
In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p=2m+1 is a prime congruent to 3 modulo 4 if and…
A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, with $F_{n+1} = F_n + F_{n-1}$ and $F_1=1, F_2=2$. If instead we allow the…
In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…
We consider a system of $R$ cubic forms in $n$ variables, with integer coefficients, which define a smooth complete intersection in projective space. Provided $n\geq 25R$, we prove an asymptotic formula for the number of integer points in…
In this paper we present a variety of statements that are in the spirit of the famous theorem of Pascal, often referred to as the Mystic Hexagon. We give explicit equations describing the conditions for $d+4$ points to lie on rational…
Let $F$ be a quadratic form in four variables, let $m\in\mathbb{N}$ and let $\mathbf{k}\in \mathbb{Z}^4$. We count integer solutions to $F(\mathbf{x})=0$ with $\mathbf{x}\equiv \mathbf{k}\:\mathrm{mod}(m)$. One can compare this to the…
Fermat's Last theorem (FLT) famously states that the equation $x^n+y^n=z^n$ has no solution in positive integers $x, y, z$ for any integer exponent $n>2$. But does this theorem have a quantitative version? Upon initial investigation we…
By considering a limiting case of a Kronecker-type identity, we obtain an identity found by both Andrews and Crandall. We then use the Andrews-Crandall identity to give a new proof of a formula of Gauss for the representations of a number…
Let gamma denote the golden ratio. H. Davenport and W. M.Schmidt showed in 1969 that, for each non-quadratic irrational real number xi, there exists a constant c>0 with the property that, for arbitrarily large values of X, the inequalities…
Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab + cd with min(a, b) > max(c, d) of two ordered products. This gives a new proof Fermat's Theorem expressing primes of the form 1 + 4N as sums of two squares 1 .
Let $p$ and $q$ be arbitrary positive numbers. It is shown that if $q < p$, then all solutions to the difference equation \tag{E} x_{n+1} = \frac{p+q x_n}{1+x_{n-1}}, \quad n=0,1,2,..., \quad x_{-1}>0, x_0>0 converge to the positive…
A nonzero rational number is called a cube sum if it is of form $a^3+b^3$ with $a,b\in \mathbb{Q}^\times$. In this paper, we prove that for any odd integer $k\geq 1$, there exist infinitely many cube-free odd integers $n$ with exactly $k$…
We study the equidistribution of integers of the form $n= x_1^2 + \cdots + x_d^2$ under the arithmetic constraints given by $(\mathbb{Z}/p\mathbb{Z})^d$. The first step in addressing this problem is to construct modular forms whose Fourier…
Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…
In this paper, we show that if $p\equiv 1\pmod 4$ is prime, then $4F_p$ admits a representation of the form $u^2-pv^2$ for some integers $u$ and $v$, where $F_n$ is the $n$th Fibonacci number. We prove a similar result when $p\equiv -1\pmod…
A triangular form is defined to be an integer-valued quadratic polynomial of the form $a_1P_3(x_1)+a_2P_3(x_2)+\cdots+a_kP_3(x_k)$ where $a_i's$ are positive integers and $P_3(x)=x(x+1)/2$. A triangular form is called regular if it…
Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. Once this has been shown, it's natural to ask how many summands are needed. Using a continued fraction approach,…
The Ramanujan--Mordell Theorem for sums of an even number of squares is extended to other quadratic forms and quadratic polynomials.
We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…