English
Related papers

Related papers: Smooth numbers in Beatty sequences

200 papers

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…

Number Theory · Mathematics 2008-01-21 Ahmet M. Guloglu , C. Wesley Nevans

In this paper we present a method for producing asymptotic estimates for the number of integers in a given S having only ``small'' prime factors. The conditions that need to be verified are simpler than those required by other methods, and…

Number Theory · Mathematics 2007-05-23 Ernie Croot

A number is said to be $y$-smooth if all of its prime factors are less than or equal to $y.$ For all $17/30<\theta\leq 1,$ we show that the density of $y$-smooth numbers in the short interval $[x,x+x^{\theta}]$ is asymptotically equal to…

Number Theory · Mathematics 2024-09-10 Khalid Younis

Although we expect to find many smooth numbers (i.e., numbers with no large prime factors) among the values taken by a polynomial with integer coefficients, it is unclear what the asymptotic number of such smooth values should be; this is…

Number Theory · Mathematics 2007-05-23 Greg Martin

Let $\alpha>1$ be an irrational number. We establish asymptotic formulas for the number of partitions of $n$ into summands and distinct summands, chosen from the Beatty sequence $(\lfloor\alpha m\rfloor)_{m\in\mathbb{N}}$. This improves…

Number Theory · Mathematics 2021-04-06 Nian Hong Zhou

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

Number Theory · Mathematics 2007-08-09 William D. Banks , Igor E. Shparlinski

Let $\phi(n)$ be the Euler-phi function, define $\phi_0(n) = n$ and $\phi_{k+1}(n)=\phi(\phi_{k}(n))$ for all $k\geq 0$. We will determine an asymptotic formula for the set of integers $n$ less than $x$ for which $\phi_k(n)$ is $y$-smooth,…

Number Theory · Mathematics 2010-05-26 Youness Lamzouri

For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor \alpha…

Number Theory · Mathematics 2019-12-03 C. G. Karthick Babu

Asymptotic solutions are derived for inhomogeneous differential equations having a large real or complex parameter and a simple turning point. They involve Scorer functions and three slowly varying analytic coefficient functions. The…

Classical Analysis and ODEs · Mathematics 2021-03-02 T. M. Dunster

We give explicit formulas for the asymptotic Betti numbers of the unordered configuration spaces of an arbitrary finite graph over an arbitrary field.

Algebraic Topology · Mathematics 2022-11-09 Byung Hee An , Gabriel C. Drummond-Cole , Ben Knudsen

The aim of this paper is to study distributional properties of integers without large or small prime factors. Define an integer to be $[y',y]$-smooth if all of its prime factors belong to the interval $[y',y]$. We identify suitable weights…

Number Theory · Mathematics 2025-09-10 Lilian Matthiesen , Mengdi Wang

This paper is concerned with the relationship of $y$-smooth integers and de Bruijn's approximation $\Lambda(x,y)$. Under the Riemann hypothesis, Saias proved that the count of $y$-smooth integers up to $x$, $\Psi(x,y)$, is asymptotic to…

Number Theory · Mathematics 2024-04-30 Ofir Gorodetsky

In this paper we find an identity that gives a representation for the logarithm of any two irrational numbers $a, b >1$ in terms of a series whose terms are ratios of elements from the Beatty Sequences generated by these two numbers. We…

Number Theory · Mathematics 2015-03-31 Geremías Polanco E

A "simple trace formula" is used to derive an asymptotic result for class numbers of complex cubic orders.

Number Theory · Mathematics 2009-11-10 Anton Deitmar , Werner Hoffmann

The potential flow of an incompressible inviscid heavy fluid over a light one is considered. The integral version of the method of matched asymptotic expansion is applied to the construction of the solution over long intervals of time. The…

Fluid Dynamics · Physics 2015-06-17 V. M. Cherniavski , Yu. M. Shtemler

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.

Number Theory · Mathematics 2015-04-20 Christian Axler

We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression.

Number Theory · Mathematics 2016-07-26 Jörn Steuding , Marc Technau

Let \( X \geq y \geq 2 \), and let \( u = \frac{\log X}{\log y} \). We say a number is \textit{$y$-smooth} if all of its prime factors are less than or equal to \( y \). In this paper, we study the distribution of $y$-smooth numbers in…

Number Theory · Mathematics 2025-02-18 Sarvagya Jain

Formulas for stable differentiation of piecewise-smooth functions are given. The data are noisy values of these functions. The locations of discontinuity points and the sizes of the jumps across these points are not assumed known, but found…

Numerical Analysis · Mathematics 2007-05-23 A. G. Ramm

A natural number $n$ is $y$-smooth if the greatest prime factor of $n$ does not exceed $y$. Let $s_{1}$ and $s_{2}$ are $y$-smooth numbers. We consider sums of smooth squares of the binary Titchmarsh divisor problem and give asymptotic…

Number Theory · Mathematics 2023-06-13 Nanxiang Wang , Haobo Dai
‹ Prev 1 2 3 10 Next ›