Search arXivSearch

arXiv · 1701.02687

On the sums of many biquadrates in two different ways

Abstract

The beautiful quartic Diophantine equation $A^4+hB^4=C^4+hD^4$, where $h$ is a fixed arbitrary positive integer, has been studied by some mathematicians for many years. Although Choudhry, Gerardin and Piezas presented solutions of this equation for many values of $h$, the solutions were not known for arbitrary positive integer values of $h$. In a separate paper (see the arxiv), the authors completely solved the equation for arbitrary values of $h$, and worked out many examples for different values of $h$, in particular for the values which has not already been given a solution. Our method, give rise to infinitely many solutions and also infinitely many parametric solutions for the equation for arbitrary rational values of $h$. In the present paper, we use the above solutions as well as a simple idea to show that how some numbers can be written as the sums of two, three, four, five, or more biquadrates in two different ways. In particular we give examples for the sums of $2$, $3$, $\cdots$, and $10$, biquadrates expressed in two different ways.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Farzali Izadi, Mehdi Baghalagdam. 2017-01-09. On the sums of many biquadrates in two different ways. https://arxiv.org/abs/1701.02687

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT