中文
相关论文

相关论文: Representations of integers as sums of four polygo…

200 篇论文

We give an asymptotic formula for the mean value of the number of representations of an integer as sum of two squares known as the Gauss circle problem.

综合数学 · 数学 2023-05-09 Nikolaos D. Bagis

It is known that any $m$-gonal form of $\rank n \ge 5$ is almost regular. In this article, we study the sufficiently large integers which are represented by (almost regular) $m$-gonal forms of $\rank n \ge 6$.

数论 · 数学 2021-08-18 Dayoon Park

For a set of nonnegative integers $A$, denote by $R_{A}(n)$ the number of unordered representations of the integer $n$ as the sum of two different terms from $A$. In this paper we partially describe the structure of the sets, which have…

数论 · 数学 2020-01-07 Sándor Z. Kiss , Csaba Sándor

In this paper we give unified formulas for the numbers of representations of positive integers as sums of four generalized $m$-gonal numbers, and as restricted sums of four squares under a linear condition, respectively. These formulas are…

数论 · 数学 2025-06-23 Jialin Li , Haowu Wang

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

综合数学 · 数学 2025-08-05 Julius Stricker

A representation number is a function which expresses the number of ways an integer can be written as a sum of elements of chosen sets. One of the oldest number-theoretic results on representation numbers is Fermat's theorem which says that…

数论 · 数学 2024-10-11 Naomi Bazlov

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

组合数学 · 数学 2026-04-29 Alexander Povolotsky

In this article, we consider the representation of $m$-gonal forms over $\mathbb N_0$. We show that any $m$-gonal forms over $\mathbb N_0$ of rank $\ge 5$ is almost regular and ponder the sufficiently large integers which are indeed…

数论 · 数学 2021-10-06 Dayoon Park

The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…

数论 · 数学 2011-09-05 Ala Avoyan , David Tsirekidze

An integer of the form $p_m(x)= \frac{(m-2)x^2-(m-4)x}{2} \ (m\ge 3)$, for some integer $x$ is called a generalized polygonal number of order $m$. A ternary sum $\Phi_{i,j,k}^{a,b,c}(x,y,z)=ap_{i+2}(x)+bp_{j+2}(y)+cp_{k+2}(z)$ of…

数论 · 数学 2021-02-10 Jangwon Ju , Byeong-Kweon Oh , Bangnam Seo

We determine explicit formulas for the number of representations of a positive integer $n$ by quaternary quadratic forms with coefficients $1$, $2$, $5$ or $10$. We use a modular forms approach.

数论 · 数学 2016-07-13 Ayşe Alaca , Mada Altiary

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

数论 · 数学 2024-01-04 Yuhui Liu

Generalized octagonal numbers are those $p_8(x)=x(3x-2)$ with $x\in\mathbb Z$. In this paper we mainly show that every positive integer can be written as the sum of four generalized octagonal numbers one of which is odd. This result is…

数论 · 数学 2015-12-18 Zhi-Wei Sun

In the present article, real number representations, that are generalizations of classical positive and alternating representations of numbers, are introduced and investigated. The main metric relation, properties of cylinder sets are…

数论 · 数学 2021-01-05 Symon Serbenyuk

In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required…

We use representations and differentiation algorithms of posets, in order to obtain results concerning unsolved problems on figurate numbers. In particular, we present criteria for natural numbers which are the sum of three octahedral…

数论 · 数学 2008-06-17 Agustin Moreno C

Let $\{U_n\}_{n \geqslant 0}$ and $\{G_m\}_{m \geqslant 0}$ be two linear recurrence sequences defined over the integers. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as…

数论 · 数学 2020-06-18 Daodao Yang

We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{\alpha,\beta}$, where $\alpha>1$ is irrational and of finite type.

数论 · 数学 2015-06-26 William D. Banks , Ahmet M. Guloglu , C. Wesley Nevans

This paper is concerned with the function $r_{k,s}(n)$, the number of (ordered) representations of $n$ as the sum of $s$ positive $k$-th powers, where integers $k,s\ge 2$. We examine the mean average of the function, or equivalently,…

数论 · 数学 2022-11-22 Pengyong Ding

At a conference in Debrecen in October 2010 Nathanson announced some results concerning the arithmetic diameters of certain sets. He proposed some related results on the representation of integers by sums or differences of powers of 2 and…

数论 · 数学 2011-08-19 Lajos Hajdu , Rob Tijdeman