Add to ORKGA smooth number is a number with only small prime factors. In particular, a posi-tive integer is y-smooth if it has no prime factor exceeding y. Smooth numbers are a useful tool in number theory because they not only have a simple multiplicative structure, but are also fairly numerous. These twin properties of smooth number
Abstract. Let P.n / stand for the largest prime factor of n 2 and set P.1 / D 1. For each integer n...
In this paper we consider the problem of exactly evaluating the p-norm of a linear operator linked w...
13 pages, comments welcomeInternational audienceAmong other results, we establish, in a quantitative...
This paper deals with products of moderate-size primes, familiarly known as smooth numbers. Smooth n...
© 2016, Pleiades Publishing, Ltd.An integer number n > 0 is called y-smooth for y > 0 if any prime f...
An integer is called y-smooth if all of its prime factors are y. An important problem is to show th...
© 2017, Allerton Press, Inc. A natural number n is called y-smooth (y-powersmooth, respectively) for...
International audienceAbstract Let b ⩾ 2 be an integer. Among other results we establish, in a quant...
We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have n...
We give a new approach for finding large twin smooth integers. Those twins whose sum is a prime are ...
We will discuss the so-called ψ-function from analytic number theory and how it enters in the comple...
AbstractIn this paper we develop a method for determining the number of integers without large prime...
Smoothed analysis combines elements over worst-case and average case analysis. For an instance x the...
Smoothed analysis combines elements over worst-case and average case analysis. For an instance x, t...
AbstractIn a recent paper, K. Soundararajan showed, roughly speaking, that the integers smaller than...
Abstract. Let P.n / stand for the largest prime factor of n 2 and set P.1 / D 1. For each integer n...
In this paper we consider the problem of exactly evaluating the p-norm of a linear operator linked w...
13 pages, comments welcomeInternational audienceAmong other results, we establish, in a quantitative...
This paper deals with products of moderate-size primes, familiarly known as smooth numbers. Smooth n...
© 2016, Pleiades Publishing, Ltd.An integer number n > 0 is called y-smooth for y > 0 if any prime f...
An integer is called y-smooth if all of its prime factors are y. An important problem is to show th...
© 2017, Allerton Press, Inc. A natural number n is called y-smooth (y-powersmooth, respectively) for...
International audienceAbstract Let b ⩾ 2 be an integer. Among other results we establish, in a quant...
We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have n...
We give a new approach for finding large twin smooth integers. Those twins whose sum is a prime are ...
We will discuss the so-called ψ-function from analytic number theory and how it enters in the comple...
AbstractIn this paper we develop a method for determining the number of integers without large prime...
Smoothed analysis combines elements over worst-case and average case analysis. For an instance x the...
Smoothed analysis combines elements over worst-case and average case analysis. For an instance x, t...
AbstractIn a recent paper, K. Soundararajan showed, roughly speaking, that the integers smaller than...
Abstract. Let P.n / stand for the largest prime factor of n 2 and set P.1 / D 1. For each integer n...
In this paper we consider the problem of exactly evaluating the p-norm of a linear operator linked w...
13 pages, comments welcomeInternational audienceAmong other results, we establish, in a quantitative...