SUMMING THE LARGEST PRIME FACTOR OVER INTEGER SEQUENCES

被引:0
|
作者
De Koninck, Jean-Marie [1 ]
Jakimczuk, Rafael [2 ]
机构
[1] Univ Laval, Dept Math, Quebec City, PQ, Canada
[2] Univ Nacl Lujan, Div Matemat, Buenos Aires, Argentina
来源
关键词
Largest prime factor function; square-free numbers; square-full numbers;
D O I
10.33044/revuma.3154
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We examine the behaviour of P ABSTRACT. Given an integer n >= 2, let P( n) stand for its largest prime factor. n <= x n is an element of A P( n) in the case of two sets A, namely the set of r -free numbers and the set of h -full numbers.
引用
收藏
页码:27 / 35
页数:9
相关论文
共 50 条