A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set (Q5401918): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q122953327, #quickstatements; #temporary_batch_1712286835472 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q122953327 / rank | |||
Normal rank | |||
Revision as of 07:18, 5 April 2024
scientific article; zbMATH DE number 6268487
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set |
scientific article; zbMATH DE number 6268487 |
Statements
A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set (English)
0 references
12 March 2014
0 references
computable upper bound
0 references
heights of integer solutions
0 references
heights of rational solutions
0 references
Diophantine equation
0 references
finite number of integer solutions
0 references
finite number of rational solutions
0 references
