Partial Correctness of an Algorithm Computing Lucas Sequences
In this paper we define some properties about finite sequences and verify the partial correctness of an algorithm computing n-th element of Lucas sequence [23], [20] with given P and Q coefficients as well as two first elements (x and y). The algorithm is encoded in nominative data language [22] in...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2020-12-01
|
Series: | Formalized Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.2478/forma-2020-0025 |