Displaying 241 – 260 of 1782

Showing per page

Bornes effectives pour certaines fonctions concernant les nombres premiers

Jean-Pierre Massias, Guy Robin (1996)

Journal de théorie des nombres de Bordeaux

Si p k est le k è m e nombre premier, θ ( p k ) = i = 1 k log p i la fonction de Chebyshev. Nous obtenons de nouvelles estimations et des améliorations des bornes données par Rosser et Schoenfeld, Schoenfeld et Robin pour les fonctions p k , θ ( p k ) , S k = i = 1 k p i , et S ( x ) = p x p . Ces estimations sont obtenues en utilisant des méthodes basées sur l’intégrale de Stieltjes et par calcul direct pour les petites valeurs.

Bounds for the counting function of the Jordan-Pólya numbers

Jean-Marie De Koninck, Nicolas Doyon, A. Arthur Bonkli Razafindrasoanaivolala, William Verreault (2020)

Archivum Mathematicum

A positive integer n is said to be a Jordan-Pólya number if it can be written as a product of factorials. We obtain non-trivial lower and upper bounds for the number of Jordan-Pólya numbers not exceeding a given number x .

Calculating a determinant associated with multiplicative functions

P. Codecá, M. Nair (2002)

Bollettino dell'Unione Matematica Italiana

Let h be a complex valued multiplicative function. For any N N , we compute the value of the determinant D N := det i | N , j | N h i , j i j where i , j denotes the greatest common divisor of i and j , which appear in increasing order in rows and columns. Precisely we prove that D N = p l N 1 p l l + 1 i = 1 l h p i - h p i - 1 τ N / p l . This means that D N 1 / τ N is a multiplicative function of N . The algebraic apparatus associated with this result allows us to prove the following two results. The first one is the characterization of real multiplicative functions f n , with 0 f p < 1 , as minimal values of certain...

Carmichael numbers composed of primes from a Beatty sequence

William D. Banks, Aaron M. Yeager (2011)

Colloquium Mathematicae

Let α,β ∈ ℝ be fixed with α > 1, and suppose that α is irrational and of finite type. We show that there are infinitely many Carmichael numbers composed solely of primes from the non-homogeneous Beatty sequence α , β = ( α n + β ) n = 1 . We conjecture that the same result holds true when α is an irrational number of infinite type.

Chebotarev sets

Hershy Kisilevsky, Michael O. Rubinstein (2015)

Acta Arithmetica

We consider the problem of determining whether a set of primes, or, more generally, prime ideals in a number field, can be realized as a finite union of residue classes, or of Frobenius conjugacy classes. We give necessary conditions for a set to be realized in this manner, and show that the subset of primes consisting of every other prime cannot be expressed in this way, even if we allow a finite number of exceptions.

Chebyshev bounds for Beurling numbers

Harold G. Diamond, Wen-Bin Zhang (2013)

Acta Arithmetica

The first author conjectured that Chebyshev-type prime bounds hold for Beurling generalized numbers provided that the counting function N(x) of the generalized integers satisfies the L¹ condition 1 | N ( x ) - A x | d x / x 2 < for some positive constant A. This conjecture was shown false by an example of Kahane. Here we establish the Chebyshev bounds using the L¹ hypothesis and a second integral condition.

Currently displaying 241 – 260 of 1782