Counting divisors of Lucas numbers

被引:2
|
作者
Moree, P [1 ]
机构
[1] Max Planck Inst Math, D-53225 Bonn, Germany
关键词
D O I
10.2140/pjm.1998.186.267
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The Lucas numbers L-n are defined by L-0 = 2, L-1 = 1 and the recurrence L-n = Ln-1 + Ln-2. An estimate for the number of m less than or equal to x such that m divides some Lucas number is established. This estimate has error of order x log(epsilon-1) x for every epsilon > 0.
引用
收藏
页码:267 / 284
页数:18
相关论文
共 50 条