No label defined (Q5614732)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3337767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3337767 |
Statements
1970
0 references
0.8309432864189148
0 references
0.8005233407020569
0 references
0.7821466326713562
0 references
0.7809141278266907
0 references
The Fibonacci numbers \(F_n\) may be defined by \(F_0 = 0\), \(F_1= 1\), \(F_{n+1}=F_n +F_{n-1}\) for \(n \geq 1\). If \(F_z\) \(z>0\), is the smallest Fibonacci number divisible by the prime \(p\), then \(z =a(p)\) is defined as the entry point (or rank) of \(p\); moreover \(p\) divides \(F_n\) if and only if \(n\) is divisible by \(z(p)\). The following two theorems are proved. I. If \(z\) ,is the entry point of a prime \(p>5\) then (i) if \(z\) is odd, either (a) \(p=4rz+ 1\) and \(p \equiv 1, 29, 41, 49 \pmod{60}\) or (b) \(p = (4r + 2)z - 1\) and \(p \equiv 13, 17, 37, 53 \pmod{60}\) ; if \(z \equiv 2 \pmod 4\) then \(p = rz + 1\) and \(p \equiv 1, 11, 19, 29 \pmod{30}\); (iii) if \(z = 0 \pmod 4\), then either (a) \(p = 2rz + 1\) and \(p \equiv 1, 29, 41, 49 \pmod{60}\) or (b) \(p = (2r + 1)z - 1\) and \(p \equiv 7, 23, 43, 47 \pmod{60}\). II. \(2z (p)\) divides \(p \pm 1\) if and only if \(p\equiv 1\pmod 4\). E. Lucas (1877) had given the factors of the first 60 Fibonacci numbers (with two errors). A table of the factors of \(F_n\) for \(n\leq 100\) has been published by the Fibonacci Association (1965). The complete factorization of 36 numbers \(F_n\) with \(n> 100\) was published by the authors in [Fibonacci Q. 3, 232--233 (1965)]. Making use of Theorem I above the authors have obtained factorizations of \(F_n\) with \(n=103, 115, 133, 135, 141, 149\), as well as of \(L_n\) with \(n=61, 62, 68, 71, 73, 76, 77, 80, 82, 85, 91, 92, 93, 94, 96, 98, 100\). Here \(L_n\) denotes the Lucas number defined by \(L_0 = 2\), \(L_1 = 1\), \(L_{n+1} = L_n + L_{n-1}\) \((n\geq 1)\).
0 references