On some estimates involving the number of prime divisors of an integer

Aleksandar Ivić

Displaying similar documents to “On some estimates involving the number of prime divisors of an integer”

Some asymptotic formulas on generalized divisor functions, III

András Sárközy, P. Erdös (1982)

Acta Arithmetica

Similarity:

Normal order for divisor functions of generalized integers

Horadam, E.M. (1968)

Portugaliae mathematica

Similarity:

New bounds on the number of representation of $t$ as a binomial coefficient.

Kane, Daniel (2004)

Integers

Similarity:

Improved bounds on the number of ways of expressing $t$ as a binomial coefficient.

Kane, Daniel M. (2007)

Integers

Similarity:

On the distribution of perfect totients.

Luca, Florian (2006)

Journal of Integer Sequences [electronic only]

Similarity:

Integers with no large prime factors

Ti Zuo Xuan (1995)

Acta Arithmetica

Similarity:

On the maximal order in $S_{n}$ and $S *_{n}$

M. Szalay (1980)

Acta Arithmetica

Similarity:

On ideals free of large prime factors

Eira J. Scourfield (2004)

Journal de Théorie des Nombres de Bordeaux

Similarity:

In 1989, E. Saias established an asymptotic formula for $Ψ (x, y) = |\{n \leq x : p ∣ n \Rightarrow p \leq y\}|$ with a very good error term, valid for $exp ({(log log x)}^{(5 / 3) + ϵ}) \leq y \leq x$ , $x \geq x_{0} (ϵ)$ , $ϵ > 0 .$ We extend this result to an algebraic number field $K$ by obtaining an asymptotic formula for the analogous function $Ψ_{K} (x, y)$ with the same error term and valid in the same region. Our main objective is to compare the formulae for $Ψ (x, y)$ and $Ψ_{K} (x, y),$ and in particular to compare the second term in the two expansions.

A simple elementary proof of $M (x) = \sum_{n \leq x} μ (n) = o (x)$

M. Kalecki (1967)

Acta Arithmetica

Similarity: