Article
Open Access
Is there a computable upper bound for the height of a solution of a Diophantine equation with a unique solution in positive integers?
-
Apoloniusz Tyszka
Published/Copyright:
August 3, 2017
Received: 2017-4-6
Accepted: 2017-6-6
Published Online: 2017-8-3
Published in Print: 2017-3-28
© 2017
Articles in the same Issue
- The speech signal segmentation algorithm using pitch synchronous analysis
- Enhancing Fingerprint Image Recognition Algorithm Using Fractional Derivative Filters
- Is there a computable upper bound for the height of a solution of a Diophantine equation with a unique solution in positive integers?
- Deterministic automata for extended regular expressions
- Corporate environmental information system data storage development and management (Environmental Information System)
- A Data Mining Approach for Cardiovascular Diagnosis
- Solving Rectangular Fuzzy Games through
- Machine Learning in Nutritional Follow-up Research
Keywords for this article
Diophantine equation with a unique solution in positive integers;
Fermat prime;
single-fold Diophantine representation;
upper bound for the height of a solution
Creative Commons
BY-NC-ND 4.0
Articles in the same Issue
- The speech signal segmentation algorithm using pitch synchronous analysis
- Enhancing Fingerprint Image Recognition Algorithm Using Fractional Derivative Filters
- Is there a computable upper bound for the height of a solution of a Diophantine equation with a unique solution in positive integers?
- Deterministic automata for extended regular expressions
- Corporate environmental information system data storage development and management (Environmental Information System)
- A Data Mining Approach for Cardiovascular Diagnosis
- Solving Rectangular Fuzzy Games through
- Machine Learning in Nutritional Follow-up Research
