English
Related papers

Related papers: On a Lower Bound for $\|(4/3)^k\|$

200 papers

Let $\alpha$ be a real number greater than $1$. We establish an effective lower bound for the distance between an integral power of $\alpha$ and its nearest integer.

Number Theory · Mathematics 2021-01-25 Yann Bugeaud

If $N = {p^k}{m^2}$ is an odd perfect number with special prime factor $p$, then it is proved that ${p^k} < (2/3){m^2}$. Numerical results on the abundancy indices $\frac{\sigma(p^k)}{p^k}$ and $\frac{\sigma(m^2)}{m^2}$, and the ratios…

Number Theory · Mathematics 2012-06-18 Jose Arnaldo B. Dris

We prove a new lower bound for the off-diagonal Ramsey numbers, \[ R(3,k) \geq \bigg( \frac{1}{3}+ o(1) \bigg) \frac{k^2}{\log k }\, , \] thereby narrowing the gap between the upper and lower bounds to a factor of $3+o(1)$. This improves…

Combinatorics · Mathematics 2025-05-20 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an…

Quantum Physics · Physics 2012-08-13 Aleksandrs Belovs , Robert Spalek

We study two kinds of conjectural bounds for the prime gap after the k-th prime $p_k$: (A) $p_{k+1} < (p_k)^{1+1/k}$ and (B) $p_{k+1}-p_k < \log^2 p_k - \log p_k - b$ for $k>9$. The upper bound (A) is equivalent to Firoozbakht's conjecture.…

Number Theory · Mathematics 2019-03-13 Alexei Kourbatov

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

Combinatorics · Mathematics 2026-02-24 Simone Costa , Stefano Della Fiore

We obtain an upper bound for the distribution of primes in the form $n^4 + k$ up to $x$, averaged over $k$ with small square-full part. As a corollary, we show that for almost all $k$, there is an expected amount of primes in the form $n^4…

Number Theory · Mathematics 2019-08-27 Kam Hung Yau

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Number Theory · Mathematics 2025-05-14 Likun Xie

Let $P(a,q)$ be the least prime in the arithmetic progression $\{n\equiv a(mod\ q)\}$. In this note, when $q$ has bounded cubic part and $(a,q)=1$, we combine the Heath-Brown's method and the Burgess's bounds for L-functions to obtain $…

Number Theory · Mathematics 2010-10-19 Zaizhao Meng

Let $I(n,l)$ denote the maximum possible number of incidences between $n$ points and $l$ lines. It is well known that $I(n,l) = \Theta(n^{2/3}l^{2/3} + n + l)$. Let $c_{\mathrm{SzTr}}$ denote the lower bound on the constant of…

Computational Geometry · Computer Science 2017-07-18 Roel Apfelbaum

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

Combinatorics · Mathematics 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

We give a new elementary proof of the fact that the value of the least $k^{th}$ power non-residue in an arithmetic progression $\{bn+c\}_{n=0,1...}$, over a prime field $\F_p$, is bounded by $7/\sqrt{5} \cdot b \cdot \sqrt{p/k} + 4b + c$.…

Number Theory · Mathematics 2011-04-26 Michael Forbes , Neeraj Kayal , Rajat Mittal , Chandan Saha

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

Number Theory · Mathematics 2012-09-20 Zhi-Wei Sun

For relatively prime positive integers $u_0$ and $r$, we consider the least common multiple $L_n:=\mathrm{lcm}(u_0,u_1,\ldots, u_n)$ of the finite arithmetic progression $\{u_k:=u_0+kr\}_{k=0}^n$. We derive new lower bounds on $L_n$ which…

Number Theory · Mathematics 2014-07-03 Daniel M. Kane , Scott D. Kominers

Let $G$ be a finite (not necessarily abelian) group and let $p=p(G)$ be the smallest prime number dividing $|G|$. We prove that $d(G)\leq \frac{|G|}{p}+9p^2-10p$, where $d(G)$ denotes the small Davenport constant of $G$ which is defined as…

Number Theory · Mathematics 2013-08-13 Weidong Gao , Yuanlin Li , Jiangtao Peng

We prove, in particular, the well--known Zaremba conjecture from the theory of continued fractions for any prime denominator. More precisely, we show, firstly, that under some mild conditions, for any sufficiently large $q$, there exists…

Number Theory · Mathematics 2026-03-17 Ilya D. Shkredov

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

Discrete Mathematics · Computer Science 2025-10-14 Pasin Manurangsi , Raghu Meka

We prove that if for the curved $n$-body problem in $\mathbb{S}^{k-1}$, $k\geq 3$, the masses are given, the minimum distance between the point masses of a specific type of relative equilibrium solution that is a generalisation of positive…

Dynamical Systems · Mathematics 2014-01-24 Pieter Tibboel

Let $H_t$ be the subdivision of $K_t$. Very recently, Conlon and Lee have proved that for any integer $t\geq 3$, there exists a constant $C$ such that $\text{ex}(n,H_t)\leq Cn^{3/2-1/6^t}$. In this paper, we prove that there exists a…

Combinatorics · Mathematics 2019-11-05 Oliver Janzer