中文
相关论文

相关论文: An improvement of Prouhet's 1851 result on multigr…

200 篇论文

Let $(m, n, k)$ be a tuple of integers with the property that if $i \leq k$, then $m + i$ and $n + i$ have the same radical. Using a result on the abc Conjecture, we bound $k$ from above, improving a result of Balasubramanian, Shorey, and…

数论 · 数学 2025-07-15 Noah Lebowitz-Lockard

The generalized Waring problem asks exactly which positive integers cannot be expressed as the sum of $j$ positive $k$-th powers? Using computational techniques, this paper refines an approach introduced by Zenkin, establishes results for…

数论 · 数学 2025-04-01 Brennan Benfield , Oliver Lippard

Let $f(n)$ denote the maximum sum of the side lengths of $n$ non-overlapping squares packed inside a unit square. We prove that $f(n^2+1) = n$ for all positive integers $n$ if and only if the sum $\sum_{k\geq 1}(f(k^2+1)-k)$ converges. We…

组合数学 · 数学 2025-12-23 Anshul Raj Singh

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

数论 · 数学 2013-04-18 Zhi-Wei Sun

E26 in the Enestrom index. Translated from the Latin original, "Observationes de theoremate quodam Fermatiano aliisque ad numeros primos spectantibus" (1732). In this paper Euler gives a counterexample to Fermat's claim that all numbers of…

历史与综述 · 数学 2008-04-15 Leonhard Euler

For positive integers $k < n$ such that $k$ divides $n$, let $(n)^k_{\hom}$ be the set of homogeneous $k$-partitions of $\{1, \dots, n\}$, that is, the set of partitions of $\{1, \dots, n\}$ into $k$ classes of the same cardinality. In the…

组合数学 · 数学 2019-07-16 Jose G. Mijares

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

数论 · 数学 2025-06-04 Ritesh Dwivedi , Rohit Yadav

In this paper, we explore identities that allow for representation of positive integers raised to positive integral powers as sums of nested sums of smaller positive integral powers. We begin by establishing the base identity involving…

数论 · 数学 2025-07-01 Nikita Gurin

In 1876, Edouard Lucas showed that if an integer $b$ exists such that $b^{n-1} \equiv 1 (\mathrm{mod} \ n)$ and $b^{(n-1)/p} \not\equiv 1( \mathrm{mod} \ n)$ for all prime divisors $p$ of $n-1$ , then $n$ is prime, a result known as Lucas's…

数论 · 数学 2021-04-13 Ariko Stephen Philemon

Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…

数论 · 数学 2024-12-30 Enxun Huang , Tengyou Zhu

The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…

数论 · 数学 2025-06-27 Jean-Marc Deshouillers , Sunil Naik

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

数论 · 数学 2025-05-30 Dohoon Choi , Youngmin Lee

In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…

数论 · 数学 2021-06-15 Chi Zhang

Let $A$ be a sequence of positive integers and $P(A)$ be the set of all integers which are the finite sum of distinct terms of $A$. For given positive integers $u\in\{4,7,8\}\cup\{u:u\ge11\}$ and $v\ge 3u+5$ we know that $u+v+1$ is the…

数论 · 数学 2020-07-22 Xiao-Hui Yan , Bing-Ling Wu

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

数论 · 数学 2022-01-27 Yong-Gao Chen , Yuchen Ding

Let $\mathcal{R}$ denote the set of integers $n$ that can be represented as the sum $n = x^2 + y^2$ with $(x,y) = 1$. Let $a$ and $b$ be integers with $a>0$, $a \nmid b$. We show that for sufficiently large positive integer $N$ there are…

数论 · 数学 2026-05-26 Artyom Radomskii

In this note we prove that \[ j!\,2^N \, \binom{N+j-1}{j} \, {}_2F_1\left(\begin{matrix}-j,-2j \\ -N-j+1 \end{matrix};-1\right) = \sum_{l=0}^N \binom{N}{l}\prod_{i=0}^{j-1}2(2i+1+l), \] where $ N $ and $ j $ are positive integers, which…

经典分析与常微分方程 · 数学 2024-01-19 Maxim L. Yattselev

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

In 1950 G. Giuga studied the congruence $\sum_{j=1}^{n-1} j^{n-1} \equiv -1$ (mod $n$) and conjectured that it was only satisfied by prime numbers. In this work we generalize Giuga's ideas considering, for each $k \in \mathbb{N}$, the…

数论 · 数学 2011-03-18 José María Grau , Antonio M. Oller-Marcén

We show that whenever $s>k(k+1)$, then for any complex sequence $(\mathfrak a_n)_{n\in \mathbb Z}$, one has $$\int_{[0,1)^k}\left| \sum_{|n|\le N}\mathfrak a_ne(\alpha_1n+\ldots +\alpha_kn^k) \right|^{2s}\,{\rm d}{\mathbf \alpha}\ll…

经典分析与常微分方程 · 数学 2024-07-01 Trevor D. Wooley