中文
相关论文

相关论文: Applications of the abc conjecture to powerful num…

200 篇论文

For nonzero coprime integers $a$ and $b$, a positive integer $\ell$ is said to be \emph{good with respect to $a$ and $b$} if there exists a positive integer $k$ such that $\ell$ divides $a^{k} + b^{k}$. The concept of good integers has been…

数论 · 数学 2025-10-21 Somphong Jitman

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more…

综合数学 · 数学 2016-06-20 N. A. Carella

For an integer $b\geq 2$, a positive integer is called a $b$-Niven number if it is a multiple of the sum of the digits in its base-$b$ representation. In this article, we show that every arithmetic progression contains infinitely many…

数论 · 数学 2024-05-17 Joshua Harrington , Matthew Litman , Tony W. H. Wong

The Casas-Alvero conjecture states: if a complex univariate polynomial has a common root with each of its derivatives, then it has a unique root. We show that hypothetical counterexamples must have at least 5 different roots. The first case…

复变函数 · 数学 2012-04-03 Robert Laterveer , Myriam Ounaies

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ...…

组合数学 · 数学 2007-05-23 Jean Bourgain , Mei-Chu Chang

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…

数论 · 数学 2015-08-04 Tristan Freiberg

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

数论 · 数学 2018-04-05 Kevin Chen , Jianqiang Zhao

Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…

数论 · 数学 2013-02-07 Zhi-Hong Sun

We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.

数论 · 数学 2012-02-20 Vladimir Shevelev

The Goldbach conjecture states that every even integer greater than 2 can be expressed as the sum of two prime numbers. This conjecture was first proposed by German mathematician Christian Goldbach in 1742 and, despite being obviously true,…

综合数学 · 数学 2025-08-12 Kenneth A. Watanabe

In this paper we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integral combination of given relatively prime (strictly) positive integers (known as…

数论 · 数学 2024-12-09 Aled Williams , Daiki Haijima

In this paper, we show that each finite group $G$ containing at most $p^2$ Sylow $p$-subgroups for each odd prime number $p$, is a solvable group. In fact, we give a positive answer to the conjecture in \cite{Rob}.

群论 · 数学 2020-07-22 M. Zarrin

Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…

数论 · 数学 2014-09-16 Yong-Gao Chen , Xiao-Feng Zhou

Enrico Bombieri showed conditionally (1994) that the ABC conjecture implies Roth's theorem, and Van Frankenhuysen (1999) later provided a complete proof. Building on Bombieri's and Van der Poorten's explicit formula for continued-fraction…

数论 · 数学 2026-02-06 Karsten Müller , Michael Taktikos

Let $g$ be sufficiently large, $b\in\{0,\ldots,g-1\}$, and $\mathcal{S}_b$ be the set of integers with no digit equal to $b$ in their base $g$ expansion. We prove that every sufficiently large odd integer $N$ can be written as $p_1 + p_2 +…

数论 · 数学 2025-01-03 James Leng , Mehtaab Sawhney

This paper introduces prime holdout problems, a problem class related to the Collatz conjecture. After applying a linear function, instead of removing a finite set of prime factors, a holdout problem specifies a set of primes to be…

数论 · 数学 2023-07-19 Max Milkert , Alex Ruchti , Josiah Yoder

Recently the problem of constructing a perfect Euler cuboid was related with three conjectures asserting the irreducibility of some certain three polynomials depending on integer parameters. In this paper a partial result toward proving the…

数论 · 数学 2011-09-13 Ruslan Sharipov

For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. In this paper, for a sequence of integers $B=\{1<b_1<b_2<\cdots\}$ and $3b_1+5\leq b_2\leq 6b_1+10$, we determine the critical value for $b_3$ such that there exists an…

数论 · 数学 2020-05-20 Min Tang , Hongwei Xu

In this note, we are interested in obtaining uniform upper bounds for the number of powerful numbers in short intervals $(x, x + y]$. We obtain unconditional upper bounds $O(\frac{y}{\log y})$ and $O(y^{11/12})$ for all powerful numbers and…

数论 · 数学 2022-07-20 Tsz Ho Chan

Consider the recursive relation generating a new positive integer $n_{\ell +1}$ from the positive integer $n_{\ell }$ according to the following simple rules: if the integer $n_{\ell }$ is odd, $n_{\ell +1}=3n_{\ell }+1$; if the integer…

综合数学 · 数学 2023-03-16 Mario Bruschi , Francesco Calogero
‹ 上一页 1 8 9 10 下一页 ›