中文
相关论文

相关论文: The sum-product problem for integers with few prim…

200 篇论文

In this paper, we introduce some explicit approximations for the summation $\sum_{k\leq n}\Omega(k)$, where $\Omega(k)$ is the total number of prime factors of $k$.

We show that for any coprime integers $\lambda_1 , \ldots , \lambda_k$ and any finite $A \subset \mathbb{Z}$, one has $$|\lambda_1 \cdot A + \ldots + \lambda_k \cdot A| \geq (|\lambda_1| + \ldots + |\lambda_k|)|A|- C,$$ where $C$ only…

数论 · 数学 2019-02-20 George Shakan

A neat 1972 result of Pohl asserts that [3n/2]-2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an n-element totally ordered set. The set is accessed via an oracle for…

数据结构与算法 · 计算机科学 2015-05-18 Michael Hoffmann , Jiří Matoušek , Yoshio Okamoto , Philipp Zumstein

If p is a prime and n a positive integer, let v(n) denote the exponent of p in n, and u(n)=n/p^{v(n)} the unit part of n. If k is a positive integer not divisible by p, we show that the p-adic limit of (-1)^{pke} u((kp^e)!) as e goes to…

数论 · 数学 2013-01-29 Donald M. Davis

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

We give a sharpened form of Siegel Lemma's w. r. t. the maximum norm. This implies a new lower bound on the greatest element of a sum-distinct set of positive integers (Erd\"os-Moser problem). The main tools are Minkowski's theorem on…

数论 · 数学 2007-05-23 Iskander Aliev

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

数论 · 数学 2007-05-23 Sinan Gunturk , Melvyn B. Nathanson

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

数论 · 数学 2011-08-26 Michael Coons

Let $f(N)$ denote the least integer $k$ such that, if $G$ is an abelian group of order $N$ and $A \subseteq G$ is a uniformly random $k$-element subset, then with probability at least $\tfrac12$ the subset-sum set $\{ \sum_{x \in S} x : S…

组合数学 · 数学 2026-03-20 Jie Ma , Quanyu Tang

Let $\mathbb{F}_q$ denote the finite field with $q$ elements where $q=p^l$ is a prime power. Using Fourier analytic tools with a third moment method, we obtain sum-product type estimates for subsets of $\mathbb{F}_q$. In particular, we…

组合数学 · 数学 2019-03-25 Esen Aksoy Yazici

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series admitting meromorphic continuation to the complex plane. Assume we know the location of the poles of $A(s)$ with $|\Im s| \leq T$, and their residues, for some large constant $T$. It is…

数论 · 数学 2025-12-18 Andrés Chirre , Harald Andrés Helfgott

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

组合数学 · 数学 2023-11-03 David Conlon , Jacob Fox , Huy Tuan Pham

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

数论 · 数学 2017-04-13 Florian Luca , Ricardo Menares , Amalia Pizarro-Madariaga

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

动力系统 · 数学 2015-11-19 Nikos Frantzikinakis , Bernard Host

We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq…

数论 · 数学 2025-06-02 Lasse Grimmelt , Jori Merikoski

Some new results concerning the equation $\sigma(N)=aM, \sigma(M)=bN$ are proved. As a corollary, there are only finitely many odd superperfect numbers with a fixed number of distinct prime factors.

数论 · 数学 2020-10-21 Tomohiro Yamada

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

数论 · 数学 2022-11-24 Jagannath Bhanja , Ram Krishna Pandey

The $k$-Markov numbers, introduced by Gyoda and Matsushita, are those which appear in positive integral solutions to $x^2 + y^2 + z^2 + k(xy + xz + yz) = (3+3k)xyz$. When $k =0$, this recovers the ordinary Markov numbers. A long-standing…

数论 · 数学 2026-04-14 Esther Banaian

Let $G$ be a 3-partite graph with $k$ vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matou\u{s}ek asked for the maximum number of triangles in such a graph. A simple construction…

组合数学 · 数学 2017-02-07 Robert S. Coulter , Rex W. Matthews , Craig Timmons

We prove, using combinatorics and Kloosterman sum technology that if $A \subset {\Bbb F}_q$, a finite field with $q$ elements, and $q^{{1/2}} \lesssim |A| \lesssim q^{{7/10}}$, then $\max \{|A+A|, |A \cdot A|\} \gtrsim…

组合数学 · 数学 2007-05-23 D. Hart , A. Iosevich , J. Solymosi
‹ 上一页 1 8 9 10 下一页 ›