Sophie Germain Primes and the Totient of Fibonacci Numbers

Abstract

We study the set S(q) of residue classes r modulo the Pisano period π(q) for which q (Fm) for every m r π(q). We prove that if q is a Sophie Germain prime and z(2q+1) π(q), then S(q) is a nonempty arithmetic progression, and for q > 5 its cardinality is odd and q 8 15. Conversely, we show that if a prime p 1 q has z(p) π(q), then necessarily p = 2q+1, so q is Sophie Germain. We conjecture that S(q) ≠ forces the existence of such a prime p; this is verified for all q ≤ 50000. Assuming that z(2q+1) π(q) holds for infinitely many Sophie Germain primes (verified computationally for approximately 23.9% of them), the Sophie Germain conjecture implies the existence of infinitely many primes q 8 15 with (2q+1) Fπ(q) -- a purely Fibonacci-theoretic condition. These results generalize to arbitrary Lucas sequences Un(P,Q) with non-square discriminant.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…