Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 11 of 11 for “"recurrence sequence"”.

  1. On termination and divergence of linear programs

    … decision problems in the theory of linear recurrence sequences. Namely, we revisit the Skolem Problem, Positivity Problem, Ultimate Positivity Problem, and Absolute Divergence Problem. We then show that the Divergence Problem, the problem of deciding whether a given linear recurrence …

    oxford Repository record for On termination and divergence of linear programs (opens in a new tab)

  2. Multiplicities of Linear Recurrence Sequences

    … results concerning the multiplicities of linear recurrence sequences. We first investigate binary recurrence sequences where we exhibit a result due to Beukers and a result due to Brindza, Pintér and Schmidt. We then investigate ternary recurrences and exhibit a result due to Beukers …

    waterloo Repository record for Multiplicities of Linear Recurrence Sequences (opens in a new tab)

  3. Linear Recurrence Sequences in Diophantine Analysis

    … it is possible to associate a well behaved recurrence sequence to the solution set of a Diophantine equation, which can be useful in generating explicit results. It is known that the solution set to any norm form equation is naturally associated to a family of linear recurrence sequences. As …

    oregon Repository record for Linear Recurrence Sequences in Diophantine Analysis (opens in a new tab)

  4. Notes on Linear Divisible Sequences and Their Construction: A Computational Approach

    … this Masters thesis, we examine linear divisible sequences. A linear divisible sequence is any sequence {an}n≥0 that can be expressed by a linear homogeneous recursion relation that is also a divisible sequence. A sequence {an}n≥0 is called a divisible sequence if it has the property that if n|m, …

    unlv Repository record for Notes on Linear Divisible Sequences and Their Construction: A Computational Approach (opens in a new tab) Download PDF for Notes on Linear Divisible Sequences and Their Construction: A Computational Approach (opens in a new tab)

  5. Sudėtiniai skaičiai sveikųjų skaičių sekose /

    … existence of composite numbers in some special sequences, such as the sequence of integer parts of powers of a fixed number and a linear recurrence sequence consisting of integer numbers. The thesis consists of the introduction, 3 sections, conclusions and bibliography. In Section 1 we consider …

    vilnius Repository record for Sudėtiniai skaičiai sveikųjų skaičių sekose / (opens in a new tab)

  6. Composite numbers in the sequences of integers /

    … existence of composite numbers in some special sequences, such as the sequence of integer parts of powers of a fixed number and a linear recurrence sequence consisting of integer numbers. The thesis consists of the introduction, 3 sections, conclusions and bibliography. In Section 1 we consider …

    vilnius Repository record for Composite numbers in the sequences of integers / (opens in a new tab)

  7. Linear recurrence sequences of composite numbers /

    … main objects studied in this thesis are linear recurrence sequences of composite numbers. We have studied the second order (binary) linear recurrence, tribonacci – like and higher order sequences. Many examples have been given.

    vilnius Repository record for Linear recurrence sequences of composite numbers / (opens in a new tab)

  8. Tiesinės rekurenčiosios sekos sudarytos iš sudėtinių skaičių /

    … main objects studied in this thesis are linear recurrence sequences of composite numbers. We have studied the second order (binary) linear recurrence, tribonacci – like and higher order sequences. Many examples have been given.

    vilnius Repository record for Tiesinės rekurenčiosios sekos sudarytos iš sudėtinių skaičių / (opens in a new tab)

  9. On Prime Generation Through Primitive Divisors Of Recurrence Sequences

    … generation of primes in certain types of integer sequences. The sequences discussed all have a connection in that each satisfies a recurrence relation. Mathematicians have speculated over many centuries that these sequences contain an infinite number of prime terms, however no proof has been given …

    ucf Repository record for On Prime Generation Through Primitive Divisors Of Recurrence Sequences (opens in a new tab)

  10. Some Topics in Diophantine Approximation

    L'abstract è presente nell'allegato / the abstract is in the attachment

    poli-torino Repository record for Some Topics in Diophantine Approximation (opens in a new tab)

  11. Lehmer Numbers with at Least 2 Primitive Divisors

    In 1878, Lucas \cite{lucas} investigated the sequences $(\ell_n)_{n=0}^\infty$ where $$\ell_n=\frac{\alpha^n-\beta^n}{\alpha-\beta},$$ $\alpha \beta$ and $\alpha+\beta$ are coprime integers, and where $\beta/\alpha$ is not a root of unity. Lucas sequences are divisibility sequences; if $m|n$, then …

    waterloo Repository record for Lehmer Numbers with at Least 2 Primitive Divisors (opens in a new tab)