On the solution of the diophantine equation Gn=pz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Let Gn be a second order linear recursive sequence, which satisfy certain conditions, and p be a prime. In this paper we describe an algorithm with which one can compute all but possible one integer solutions n,z of the diophantine equation Gn=pz. In the exceptional case the algorithm gives an n such that Gn is the only possible further power of p. We give an upper bound for the running time too.

Original languageEnglish
Title of host publicationEUROCAL 1985 - European Conference on Computer Algebra, Proceedings
PublisherSpringer Verlag
Pages503-512
Number of pages10
ISBN (Print)9783540159841
DOIs
Publication statusPublished - Jan 1 1985
EventEuropean Conference on Computer Algebra, EUROCAL 1985 - Linz, Austria
Duration: Apr 1 1985Apr 3 1985

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume204 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherEuropean Conference on Computer Algebra, EUROCAL 1985
CountryAustria
CityLinz
Period4/1/854/3/85

Fingerprint

Diophantine equation
Recursive Sequence
Upper bound
Integer

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Pethő, A. (1985). On the solution of the diophantine equation Gn=pz In EUROCAL 1985 - European Conference on Computer Algebra, Proceedings (pp. 503-512). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 204 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-15984-3_320

On the solution of the diophantine equation Gn=pz . / Pethő, A.

EUROCAL 1985 - European Conference on Computer Algebra, Proceedings. Springer Verlag, 1985. p. 503-512 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 204 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pethő, A 1985, On the solution of the diophantine equation Gn=pz in EUROCAL 1985 - European Conference on Computer Algebra, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 204 LNCS, Springer Verlag, pp. 503-512, European Conference on Computer Algebra, EUROCAL 1985, Linz, Austria, 4/1/85. https://doi.org/10.1007/3-540-15984-3_320
Pethő A. On the solution of the diophantine equation Gn=pz In EUROCAL 1985 - European Conference on Computer Algebra, Proceedings. Springer Verlag. 1985. p. 503-512. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-15984-3_320
Pethő, A. / On the solution of the diophantine equation Gn=pz EUROCAL 1985 - European Conference on Computer Algebra, Proceedings. Springer Verlag, 1985. pp. 503-512 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{614f7f7ebcb843888d0c5205155151e1,
title = "On the solution of the diophantine equation Gn=pz",
abstract = "Let Gn be a second order linear recursive sequence, which satisfy certain conditions, and p be a prime. In this paper we describe an algorithm with which one can compute all but possible one integer solutions n,z of the diophantine equation Gn=pz. In the exceptional case the algorithm gives an n such that Gn is the only possible further power of p. We give an upper bound for the running time too.",
author = "A. Pethő",
year = "1985",
month = "1",
day = "1",
doi = "10.1007/3-540-15984-3_320",
language = "English",
isbn = "9783540159841",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "503--512",
booktitle = "EUROCAL 1985 - European Conference on Computer Algebra, Proceedings",

}

TY - GEN

T1 - On the solution of the diophantine equation Gn=pz

AU - Pethő, A.

PY - 1985/1/1

Y1 - 1985/1/1

N2 - Let Gn be a second order linear recursive sequence, which satisfy certain conditions, and p be a prime. In this paper we describe an algorithm with which one can compute all but possible one integer solutions n,z of the diophantine equation Gn=pz. In the exceptional case the algorithm gives an n such that Gn is the only possible further power of p. We give an upper bound for the running time too.

AB - Let Gn be a second order linear recursive sequence, which satisfy certain conditions, and p be a prime. In this paper we describe an algorithm with which one can compute all but possible one integer solutions n,z of the diophantine equation Gn=pz. In the exceptional case the algorithm gives an n such that Gn is the only possible further power of p. We give an upper bound for the running time too.

UR - http://www.scopus.com/inward/record.url?scp=0042340465&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042340465&partnerID=8YFLogxK

U2 - 10.1007/3-540-15984-3_320

DO - 10.1007/3-540-15984-3_320

M3 - Conference contribution

AN - SCOPUS:0042340465

SN - 9783540159841

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 503

EP - 512

BT - EUROCAL 1985 - European Conference on Computer Algebra, Proceedings

PB - Springer Verlag

ER -