Zobrazeno 1 - 3
of 3
pro vyhledávání: '"F. F. Sharifullina"'
Autor:
F. F. Sharifullina
Publikováno v:
Russian Mathematics. 61:53-59
A natural number n is called y-smooth (y-powersmooth, respectively) for a positive number y if every prime (prime power) dividing n is bounded from above by y. Let ψ(x, y) and ψ*(x, y) denote the quantity of y-smooth and y-powersmooth integers rest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f81f2a32675d1027cab2c0cb63af672e
https://doi.org/10.3103/s1066369x1711007x
https://doi.org/10.3103/s1066369x1711007x
Publikováno v:
Lobachevskii Journal of Mathematics. 37:128-137
An integer number n > 0 is called y-smooth for y > 0 if any prime factor p of n satisfies p ≤ y. Let ψ(x, y) be the number of all y-smooth integers less or equal to x. In this paper we elaborate a new algorithm for approximate calculation of ψ(x,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34065310f07035b3630ca80a657c1dba
https://doi.org/10.1134/s1995080216020062
https://doi.org/10.1134/s1995080216020062
Publikováno v:
Russian Mathematics. 58:43-48
A semiprime is a natural number which is the product of two (possibly equal) prime numbers. Let y be a natural number and g(y) be the probability for a number y to be semiprime. In this paper we derive an asymptotic formula to count g(y) for large y
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::145808a0366ce1c3062299ee0e53433b
https://doi.org/10.3103/s1066369x14080052
https://doi.org/10.3103/s1066369x14080052