首页 | 本学科首页   官方微博 | 高级检索  
     检索      


New Fibonacci and Lucas primes
Authors:Harvey Dubner  Wilfrid Keller
Institution:449 Beverly Road, Ridgewood, New Jersey 07450 ; Regionales Rechenzentrum der Universität Hamburg, 20146 Hamburg, Germany
Abstract:Extending previous searches for prime Fibonacci and Lucas numbers, all probable prime Fibonacci numbers $F_{n}$ have been determined for $6000 < n \le 50000$ and all probable prime Lucas numbers $L_{n}$ have been determined for $1000 < n \le 50000$. A rigorous proof of primality is given for $F_{9311}$ and for numbers $L_{n}$ with $n = 1097$, $1361$, $4787$, $4793$, $5851$, $7741$, $10691$, $14449$, the prime $L_{14449}$ having 3020 digits. Primitive parts $F^{*}_{n}$ and $L^{*}_{n}$ of composite numbers $F_{n}$ and $L_{n}$ have also been tested for probable primality. Actual primality has been established for many of them, including 22 with more than 1000 digits. In a Supplement to the paper, factorizations of numbers $F_{n}$ and $L_{n}$ are given for $n > 1000$ as far as they have been completed, adding information to existing factor tables covering $n \le 1000$.

Keywords:Fibonacci numbers  Lucas numbers  primality testing  large primes  prime primitive parts  factor tables
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号