Related Experiment Video
Updated: Jul 15, 2025

Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks
Published on: November 25, 2015
On prime powers in linear recurrence sequences
Japhet Odjoumani1, Volker Ziegler2
1Institut de Mathématiques et de Sciences Physiques, Université d'Abomey-Calavi, Dangbo, Benin.
None:
In this paper we consider the Diophantine equation where is a linear recurrence sequence, p is a prime number, and x is a positive integer. Under some technical hypotheses on , we show that, for any p outside of an effectively computable finite set of prime numbers, there exists at most one solution (n, x) to that Diophantine equation. We compute this exceptional set for the Tribonacci sequence and for the Lucas sequence plus one.
Related Concept Videos
Determination of Pi Terms
The theorem indicates that...
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Basic Discrete Time Signals
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is...
Properties of Fourier series I
Euler's Formula for Pin-Ended Columns
To calculate the critical load,...
Euler's Formula to Columns: Problem Solving
The system comprises two vertical rigid bars, AB and BC,...

