Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function (Q2385794): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 07:57, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function |
scientific article |
Statements
Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function (English)
0 references
15 October 2007
0 references
A base \(a\) pseudoprime (\(a\in\mathbb{N}\), \(>1\)) is a composite integer \(n\) such that \(n\mid a^n- a\). The authors prove, that the \(n\)th Fibonacci number \(F_n\) is a base \(a\) pseudoprime only for at most \((4+ o(1))\pi(x)\) positive integers \(n\leq x\) (\(x\) sufficiently large). The same result holds for one general class of Lucas sequences such as the Mersenne numbers \(2^n- 1\), and polynomial sequences \(f(n)\), where \(f\in\mathbb{Z}[X]\). By a different method they get a sharper upper bound of the counting function on positive integers \(n\), such that \(\varphi(n)\) is a base \(a\) pseudoprime (\(\varphi\) is the Euler function).
0 references
Fibonacci numbers
0 references
pseudoprimes
0 references