中文
相关论文

相关论文: On the representation of friable integers by linea…

200 篇论文

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

数论 · 数学 2017-12-04 Zhi-Wei Sun

The Frobenius number of relatively prime positive integers $a_1, \ldots, a_n$ is the largest integer that is not a nononegative integer combination of the $a_i.$ Given positive integers $a_1, \ldots, a_n$ with $n \ge 2,$ the set of…

组合数学 · 数学 2016-11-08 Bobby Shen

Let $N \geq2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. Frobenius number of this $N$-tuple is defined to be the largest positive integer that cannot be expressed as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are…

数论 · 数学 2007-06-26 Lenny Fukshansky , Sinai Robins

Let $F_1,\ldots,F_R$ be homogeneous polynomials with integer coefficients in $n$ variables with differing degrees. Write $\boldsymbol{F}=(F_1,\ldots,F_R)$ with $D$ being the maximal degree. Suppose that $\boldsymbol{F}$ is a nonsingular…

数论 · 数学 2024-05-13 Jianya Liu , Sizhe Xie

Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d$ with $d$ at least $3$ and let $r$ denote the largest degree of an irreducible factor of $F$ over the rationals. Let $k$ be an integer with $k \geq 2$…

数论 · 数学 2024-07-08 C. L. Stewart , Stanley Yao Xiao

We improve some results on the size of the greatest prime factor of integers of the form ab+1, where a and b belong to finite sets of integers with rather large density.

数论 · 数学 2013-11-15 Étienne Fouvry

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

Let $k\ge 2$ be a positive integer and $P^+(n)$ the greatest prime factor of a positive integer $n$ with convention $P^+(1)=1$. For any $\theta\in \left[\frac 1{2k},\frac{17}{32k}\right)$, set…

数论 · 数学 2023-06-06 Yuchen Ding , Lilu Zhao

We study the average number of representations of an integer $n$ as $n = \phi(n_{1}) + \dots + \phi(n_{j})$, for polynomials $\phi \in \mathbb{Z}[n]$ with $\partial\phi = k\ge 1$, $\operatorname{lead}(\phi) = 1$, $j \ge k$, where $n_{i}$ is…

数论 · 数学 2026-05-14 Alessandra Migliaccio , Alessandro Zaccagnini

Let $q_n$ denote the $n^{th}$ number that is a product of exactly two distinct primes. We prove that $$\liminf_{n\to \infty} (q_{n+1}-q_n) \le 6.$$ This sharpens an earlier result of the authors (arXivMath NT/0506067), which had 26 in place…

数论 · 数学 2014-02-26 D. A. Goldston , S. W. Graham , J. Pintz , C. Y. Yildirim

Given a finite family F of linear forms with integer coefficients, and a compact abelian group G, an F-free set in G is a measurable set which does not contain solutions to any equation L(x)=0 for L in F. We denote by d_F(G) the supremum of…

组合数学 · 数学 2011-09-15 Pablo Candela , Olof Sisask

The famous linear diophantine problem of Frobenius is the problem to determine the largest integer (Frobenius number) whose number of representations in terms of $a_1,\dots,a_k$ is at most zero, that is not representable. In other words,…

数论 · 数学 2022-07-20 Takao Komatsu

Given coprime positive integers $a_1 < ...< a_d$, the Frobenius number $F$ is the largest integer which is not representable as a non-negative integer combination of the $a_i$. Let $g$ denote the number of all non-representable positive…

数论 · 数学 2015-05-21 Alessio Moscariello , Alessio Sammartano

Let $p$ be a large prime number. We prove that any integer $\lambda$ modulo $p$ can be represented in the form $$ m!n! +\sum_{i=1}^{47}n_i!\equiv \lambda \pmod p, $$ with $\max\{m,n,n_1,\ldots,n_{47}\}\ll p^{1300/1301}.$ This improves the…

数论 · 数学 2025-09-01 Moubariz Z. Garaev , Julio C. Pardo

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…

数论 · 数学 2019-05-01 Gérald Tenenbaum

Let $F_1,\ldots,F_R$ be homogeneous polynomials of degree $d\ge 2$ with integer coefficients in $n$ variables, and let $\mathbf{F}=(F_1,\ldots,F_R)$. Suppose that $F_1,\ldots,F_R$ is a non-singular system and $n\ge 4^{d+2}d^2R^5$. We prove…

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

For an integer $m >1$, we denote by $P(m)$ the largest prime divisor of $m$. We prove that $\limsup_{n \rightarrow +\infty} P(n!+1)/n \geqslant 1+9\log 2>7.238$, which improves a result of Stewart. More generally, for any nonzero polynomial…

数论 · 数学 2021-03-30 Li Lai

The so-called Frobenius number in the famous linear Diophantine problem of Frobenius is the largest integer such that the linear equation $a_1 x_1+\cdots+a_k x_k=n$ ($a_1,\dots,a_k$ are given positive integers with $\gcd(a_1,\dots,a_k)=1$)…

组合数学 · 数学 2023-06-21 Takao Komatsu , Haotian Ying

Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is the largest positive integer that is NOT representable in terms of $a_1,a_2,\dots,a_k$. When $k\ge 3$, there is no explicit formula in…

数论 · 数学 2022-04-18 Takao Komatsu

We fix a maximal order $\mathcal O$ in $\F=\R,\C$ or $\mathbb{H}$, and an $\F$-hermitian form $Q$ of signature $(n,1)$ with coefficients in $\mathcal O$. Let $k\in\N$. By applying a lattice point theorem on the $\F$-hyperbolic space, we…

数论 · 数学 2014-01-03 Emilio A. Lauret