Complete Padovan sequences in finite fields

Abstract

Given a prime p 5, and given 1<<p-1, we call a sequence (an)n in Fp a -sequence if it is periodic with period p-1, and if it satisfies the linear recurrence an+an+1=an+ with a0=1. Such a sequence is said to be a complete -sequence if in addition \a0,a1,...,ap-2\=\1,...,p-1\. For instance, every primitive root b mod p generates a complete -sequence an=bn for some (unique) . A natural question is whether every complete -sequence is necessarily defined by a primitive root. For =2 the answer is known to be positive. In this paper we reexamine that case and investigate the case =3 together with the associated cases =p-2 and =p-3.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…