The effective algorithm for solving the quadratic diofantic equation with three unknowns
Abstract
The article is devoted to the problem of finding the triples of integer numbers generating equal sums of the squares in the linear combination. At first the theorem giving the conditions of existing two equal sums of the squares is presented. Based on it the algorithm for finding the triples of the integer numbers generating equal sums of the squares is built. The time complexity is calculated and the effectiveness for different size of the input parameters is verified.
Full Text:
PDFDOI: http://dx.doi.org/10.17951/ai.2005.3.1.57-64
Date of publication: 2015-01-04 00:00:00
Date of submission: 2016-04-27 10:14:16
Statistics
Total abstract view - 249
Downloads (from 2020-06-17) - PDF - 0
Indicators
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Annales UMCS Sectio AI Informatica
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.