中文
相关论文

相关论文: On sums of three squares

200 篇论文

Let $a_k(n)$ denotes the number of representations of a non-negative integer $n$ as sum of $k$ quadratic forms of the type $x^2+xy+y^2$ and $a_{\lambda_1,\lambda_2,\lambda_3\dots\lambda_k}(n)$ denotes the number of representations $n$ as a…

历史与综述 · 数学 2024-01-23 Kritika Kashyap

Recently, Jha (arXiv:2007.04243, arXiv:2011.11038) has found identities that connect certain sums over the divisors of $n$ to the number of representations of $n$ as a sum of squares and triangular numbers. In this note, we state a…

数论 · 数学 2024-09-04 Subhajit Bandyopadhyay , Nayandeep Deka Baruah

We prove that the greatest positive integer that is not expressible as a linear combination with integer coefficients of elements of the set $\{n^2,(n+1)^2,\ldots \}$ is asymptotically $O(n^2)$, verifying thus a conjecture of Dutch and…

数论 · 数学 2015-04-14 Alessio Moscariello

We use a representability theorem of G. L. Watson to examine sums of squares in Quaternion rings with integer coefficients. This allows us to determine a large family of such rings where every element expressible as the sum of squares can…

数论 · 数学 2022-03-09 Tim Banks , Spencer Hamblen , Tim Sherwin , Sal Wright

We prove an asymptotic formula for the number of $n$-dimensional representations of the group $\mathrm{SU}(3)$. Main tools for the proof are Wright's Circle Method and the Saddle Point Method.

表示论 · 数学 2021-07-08 Kathrin Bringmann , Johann Franke

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…

数论 · 数学 2020-10-30 Jorge Urroz

In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…

数论 · 数学 2026-03-23 Kathrin Bringmann , Min-Joo Jang , Ben Kane , Cheuk Hin Alvin Tse

We prove some cases of a conjecture by Farhi on the representation of every positive integer as the sum of three terms of the sequence $ \left\lfloor\frac{n^2}{a}\right\rfloor$. This is done by generalizing a method used by Farhi in his…

We prove that a positive integer not of the form, 4^{k}(8m+7) can be expressible as a sum of three or fewer squares by using some results of Kane and Sun on mixed sums of squares and triangular numbers.

数论 · 数学 2008-12-05 Agustin Moreno

In this paper, we study the number of representations of a positive integer $n$ by two positive integers whose product is a multiple of a polygonal number.

数论 · 数学 2017-09-20 Hao Zhong , Tianxin Cai

For a given integer $m$ and any residue $a \pmod{m}$ that can be written as a sum of 3 squares modulo $m$, we show the existence of infinitely many integers $n \equiv a \pmod{m}$ such that the number of representations of $n$ as a sum of…

数论 · 数学 2024-12-04 Michael Filaseta , Jonah Klein , Cihan Sabuncu

We prove part of a conjecture of Borwein and Choi concerning an estimate on the square of the number of solutions to n=x^2+Ny^2 for a squarefree integer N.

数论 · 数学 2021-02-03 Ram Murty , Robert Osburn

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…

数论 · 数学 2019-09-16 Alessandro Languasco , Alessandro Zaccagnini

In this paper, we prove a conjecture of Chan and Chua for the number of representations of integers as sums of 8s integral squares. The proof uses a theorem of Imamo\={g}lu and Kohnen, and the double shuffle relations satisfied by the…

数论 · 数学 2012-01-18 Koji Tasaka

In this paper, we derive the following asymptotic formula $$ \mathop{{\sum}'}_{n\leqslant x}\dfrac{r(n)}{r(n+1)} = {x}{(\ln x)^{-3/4}}(c+o(1)),\ \ x \to +\infty,$$ where $r(n)$ is the number of representations of $n$ as a sum of two…

数论 · 数学 2025-08-06 Vitalii V. Iudelevich

By using techniques of poset representation theory, we present a formula for the number of partitions of a positive integer into three polygonal numbers.

组合数学 · 数学 2008-12-02 Agustin Moreno

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

数论 · 数学 2010-06-29 Siu-lun Alan Lee

I discuss a variety of results involving s(n), the number of representations of n as a sum of three squares. One of my objectives is to reveal numerous interesting connections between the properties of this function and certain modular…

数论 · 数学 2012-07-05 Alexander Berkovich

Let $r_k(n)$ denote the number of representations of the positive integer $n$ as the sum of $k$ squares. In 1934, the Russian mathematician A.~I.~Popov stated, but did not rigorously prove, a beautiful series transformation involving…

数论 · 数学 2016-10-26 Bruce C. Berndt , Atul Dixit , Sun Kim , Alexandru Zaharescu

Which integers can be written as a quotient of sums of distinct powers of three? We outline our first steps toward an answer to this question, beginning with a necessary and almost sufficient condition. Then we discuss an algorithm that…