Nicolaas Govert de Bruijn, the enchanter of friable integers

DOI10.1016/j.indag.2013.03.004zbMath1295.11102arXiv1212.1579OpenAlexW2035182741MaRDI QIDQ740465

Pieter Moree

Publication date: 3 September 2014

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.1579

zbMATH Keywords

friable integersDickman-de Bruijn function

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) Distribution of integers with specified multiplicative constraints (11N25)

Related Items (9)

Local probabilities for random permutations without long cycles ⋮ On the average distribution of divisors of friable numbers ⋮ Size biased sampling from the Dickman subordinator ⋮ Early work of N. G. (Dick) de Bruijn in analysis and some of my own ⋮ Euler’s constant: Euler’s work and modern developments ⋮ The Dickman–Goncharov distribution ⋮ A Smooth Selberg Sieve and Applications ⋮ Ramanujan-style congruences for prime level ⋮ A generalised Dickman distribution and the number of species in a negative binomial process model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of integers \(\leqq x\) whose prime factors divide \(n\)
• Jack van Lint (1932--2004): a survey of his scientific work
• On a problem of Oppenheim concerning Factorisatio Numerorum
• The number of positive integers \(\leq x\) and free of prime factors \(>y\)
• On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
• Sieving the positive integers by large primes
• Limitations to the equi-distribution of primes. I
• Sur le nombre des entiers sans grand facteur premier. (On the number of integers without large prime factor)
• Asymptotic estimates of sums involving the Moebius function
• Analysis of a simple factorization algorithm
• On a class of differential-difference equations arising in number theory
• On the asymptotic behavior of the Dickman-de Bruijn function
• Integers without large prime factors
• A generalization of the Buchstab equation
• Logarithmic combinatorial structures: A probabilistic approach
• Friable integers: Turán-Kubilius inequality and applications
• An asymptotic expansion related to the Dickman function
• Statistical properties of friable integers
• On Mahler's partition problem
• On some sums involving the largest prime divisor of n, II
• Constantes de Turán–Kubilius friables: une étude numérique
• An Erdös-Kac theorem for integers without large prime factors
• Sur l'inégalité de Turán-Kubilius friable
• Integers free of large prime factors and the Riemann hypothesis
• Two Differential-Difference Equations Arising in Number Theory
• The Convolution Powers of the Dickman Function
• Théorèmes de densité dans $F_q[X$]
• On Integers Free of Large Prime Factors
• The Asymptotic Behavior of the Solutions of a Class of Differential-Difference Equations
• Numerical Solution of Some Classical Differential-Difference Equations
• Rosser's sieve
• Selberg's sieve estimate with a one sided hypothesis
• Lois de répartition des diviseurs, 2
• The Turán-Kubilius inequality for integers without large prime factors.
• Asymptotic Estimates of Sums Involving the Moebius Function. II
• Sur les puissances de convolution de la fonction de Dickman
• Asymptotic Methods in Enumeration
• Moyennes de certaines fonctions multiplicatives sur les entiers friables
• Multivariate Diophantine equations with many solutions
• Oscillation Theorems for Primes in Arithmetic Progressions and for Sifting Functions
• Integers without large prime factors: from Ramanujan to de Bruijn
• The general sieve
• On the field of combinatory analysis
• Moyennes de certaines fonctions multiplicatives sur les entiers friables, 2
• Ordered Cycle Lengths in a Random Permutation
• On the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory
• On the number of integers ≤ x whose prime factors divide n
• Numbers with small prime factors, and the least 𝑘th power non-residue
• The Difference between Consecutive Prime Numbers
• The Asymptotically Periodic Behavior of the Solutions of Some Linear Functional Equations
• On the Number of Positive Integers ≦x all of Whose Prime Factors are ≦y
• Primes in short intervals

This page was built for publication: Nicolaas Govert de Bruijn, the enchanter of friable integers