中文
相关论文

相关论文: On the number of representations of n as a linear …

200 篇论文

Let k_1,...,k_d be positive integers, and D be a subset of [k_1]x...x[k_d], whose complement can be decomposed into disjoint sets of the form {x_1}x...x{x_{s-1}}x[k_s]x{x_{s+1}}x...x{x_d}. We conjecture that the number of elements of D can…

组合数学 · 数学 2008-07-08 Andrzej P. Kisielewicz , Krzysztof Przesławski

Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…

数论 · 数学 2022-12-01 Bartosz Sobolewski , Maciej Ulas

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

For every positive integer $n$ greater than $4$ there is a set of Latin squares of order $n$ such that every permutation of the numbers $1,\ldots,n$ appears exactly once as a row, a column, a reverse row or a reverse column of one of the…

组合数学 · 数学 2020-06-11 Stephan Foldes , András Kaszanyitzky , Laszlo Major

In 1997 K. Ono and K. Soundararajan [Invent. Math. 130(1997)] proved that under the generalized Riemann hypothesis any positive odd integer greater than 2719 can be represented by the famous Ramanujan form $x^2+y^2+10z^2$, equivalently the…

数论 · 数学 2010-08-18 Ben Kane , Zhi-Wei Sun

For each integer $m\ge3$, let $P_m(x)$ denote the generalized $m$-gonal number $\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in\mathbb{Z}$. Given positive integers $a,b,c,k$ and an odd prime number $p$ with $p\nmid c$, we employ the theory of ternary…

数论 · 数学 2020-07-21 Hai-Liang Wu

Lagrange's four-square theorem states that every natural number $n$ can be represented as the sum of four integer squares: $n=x_1^2+x_2^2+x_3^2+x_4^2$. Ramanujan generalized Lagrange's result by providing, up to equivalence, all $54$…

数论 · 数学 2018-05-14 Jesús Lacalle , Laura N. Gatti

By the theory of elliptic curves, we study the integers representable as the product of the sum of four integers with the sum of their reciprocals and give a sufficient condition for the integers with a positive representation.

数论 · 数学 2016-08-12 Yong Zhang

For any integer $x$, let $T_x$ denote the triangular number $\frac{x(x+1)}{2}$. In this paper we give a complete characterization of all the triples of positive integers $(\alpha, \beta, \gamma)$ for which the ternary sums $\alpha x^2…

数论 · 数学 2011-01-19 Wai Kiu Chan , Anna Haensch

Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. For a $k$-tuple of positive integers $\underline{\lambda} = (\lambda_{1}, \dots{} ,\lambda_{k})$ with $1 \le \lambda_{1} < \lambda_{2} < \dots{} < \lambda_{k}$, we…

数论 · 数学 2023-03-20 Sándor Z. Kiss , Csaba Sándor

Let $m$, $k_1$, and $k_2$ be three integers with $m\ge 2$. For any set $A\subseteq \mathbb{Z}_m$ and $n\in \mathbb{Z}_m$, let $\hat{r}_{k_1,k_2}(A,n)$ denote the number of solutions of the equation $n=k_1a_1+k_2a_2$ with $a_1,a_2\in A$. In…

数论 · 数学 2014-09-16 Quan-Hui Yang , Yong-Gao Chen

Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let the representation function $R_{S}(n)$ denote the number of solutions of the equation $n=s+s'$ with $s, s'\in S$ and $s<s'$. In…

数论 · 数学 2022-08-16 Cui-Fang Sun , Hao Pan

We prove an upper bound for the number of representations of a positive integer $N$ as the sum of four $k$-th powers of integers of size at most $B$, using a new version of the Determinant method developed by Heath-Brown, along with recent…

数论 · 数学 2010-12-23 Oscar Marmon

It is proved that all sufficiently large integers $n$ can be represented as $$n=x_1^2+x_2^3+\cdots+x_{13}^{14},$$ where $x_1,\ldots,x_{13}$ are positive integers. This improves upon the current record with $14$ variables in place of $13$.

数论 · 数学 2021-05-28 Jianya Liu , Lilu Zhao

For all natural numbers $n$, we discuss the evaluation of the convolution sum, $\underset{\substack{{(l,m) \in \mathbb{N}_0^2} \\ {\alpha\,l+\beta\,m=n} } }{\sum}\sigma(l)\sigma(m)$, where $\alpha\beta=14,22,26$. We generalize the…

数论 · 数学 2016-06-07 Ayşe Alaca , Şaban Alaca , Ebénézer Ntienjem

In this paper, we consider the simultaneous representation of pairs of sufficiently large integers. We prove that every pair of large positive odd integers can be represented in the form of a pair of one prime, four cubes of primes and 231…

数论 · 数学 2022-03-07 Xin Chen

Let $\mathbb{N}$ be the set of all nonnegative integers. For any integer $r$ and $m$, let $r+m\mathbb{N}=\{r+mk: k\in\mathbb{N}\}$. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_{S}(n)$ denote the number of solutions of the…

数论 · 数学 2022-08-17 Cui-Fang Sun , Hao Pan

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

Let $a$, $b$, $c$ be fixed coprime positive integers with $\min\{ a,b,c \} >1$. Let $N(a,b,c)$ denote the number of positive integer solutions $(x,y,z)$ of the equation $a^x + b^y = c^z$. We show that if $(a,b,c)$ is a triple of distinct…

数论 · 数学 2022-07-15 Maohua Le , Reese Scott , Robert Styer

A number $N$ is a triangular number if it can be written as $N = t(t + 1)/2$ for some nonnegative integer number $t$. A triangular number $N$ is called square if it is a perfect square, that is, $N = d^2$ for some integer number $d$. Square…

数论 · 数学 2026-02-20 Vladimir Gurvich , Mariya Naumova