Additive Diophantine Equations involving S-Units, Factorials and Ternary Recurrences with repeated root

Abstract

Let Cn=n2n+1 denote the nth Cullen number. There has been recent interest in finding all Cullen numbers having a given Diophantine property. We prove that, for a fixed integer k and bounded integers a1,…,ak, the greatest prime divisor of Cn-a1m1!-·s-akmk! tends to infinity, in an effective way. We prove this for some more general families of ternary recurrence sequences as well. We also solve the Diophantine equation Cn = m1! + m2! + s, where s is a positive integer composed of primes 2,3,5,7.

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…