Fibonacci numbers with prime subscripts: Digital sums for primes versus composites

被引：0

作者：

Leyendekkers, J. V. ^{[1
]}

Shannon, A. G. ^{[2
]}

机构：

[1] Univ Sydney, Fac Sci, Sydney, NSW 2006, Australia

[2] Univ Technol Sydney, Fac Engn & IT, Sydney, NSW 2007, Australia

来源：

NOTES ON NUMBER THEORY AND DISCRETE MATHEMATICS | 2014年 / 20卷 / 03期

关键词：

Fibonacci numbers; Primality; Digit sums;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

If we use the expression F-p = k(p) +/- 1, p prime, then digital sums of k reveal specific values for primes versus composites in the range 7 <= p <= 107. The associated digital sums of F-p +/- 1 also yield prime/composite specificity. It is shown too that the first digit of F-p, and hence for the corresponding triples, (F-p, F-p +/- 1) and (F-p, Fp-1, Fp-2) can be significant for primality checks.

引用

页码：45 / 49

页数：5