Multiply perfect numbers in Lucas sequences with odd parameters (Q2714382)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiply perfect numbers in Lucas sequences with odd parameters |
scientific article; zbMATH DE number 1604285
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiply perfect numbers in Lucas sequences with odd parameters |
scientific article; zbMATH DE number 1604285 |
Statements
13 June 2001
0 references
multiply perfect number
0 references
Lucas sequence
0 references
primitive divisor
0 references
square class
0 references
Multiply perfect numbers in Lucas sequences with odd parameters (English)
0 references
Let \(P>0\) and \(Q\) be odd coprime integers such that \(P^2+4Q>0\), furthermore define sequences \(\{U_n\}\) and \(\{V_n\}\) by \(U_{n+2}=PU_{n+1}+QU_n\) and \(V_{n+2}=PV_{n+1}+QV_n\) \((n\geq 0)\) with initial terms \(U_0=0, U_1=1, V_0=2\) and \(V_1=P\). If \(\sigma (n)\) denotes the sum of the positive divisors of an integer \(n\) and \(\sigma (n)=kn\) for some integer \(k\), then \(n\) is called a multiply perfect number. In this paper the author proves that there exists an effectivelly computable constant \(C\) depending on \(P\) and \(Q\), such that if \(U_n\) or \(V_n\) is multiply perfect, then \(n<C\). Lemmas and propositions, which are used in the proof, are also interesting results.
0 references