The ABC conjecture and the powerful part of terms in binary recurring sequences (Q1284204): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q122958990, #quickstatements; #temporary_batch_1712261475387 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q122958990 / rank | |||
Normal rank |
Revision as of 22:35, 4 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The ABC conjecture and the powerful part of terms in binary recurring sequences |
scientific article |
Statements
The ABC conjecture and the powerful part of terms in binary recurring sequences (English)
0 references
30 March 1999
0 references
Binary recurrence sequences have many interesting arithmetic properties like identities and divisibility properties. Under a certain assumption -- the so-called ABC conjecture is true -- such sequences with a positive discriminant have only finitely many terms which are powerful numbers. Here a natural number \(n\) is powerful if \(p^2\) divides \(n\) whenever a prime \(p\) divides \(n\).
0 references
binary recurrence sequence
0 references
ABC conjecture
0 references
powerful numbers
0 references