The diophantine equation (2k-1)(bk-1)=yq

Abstract

In this paper, we consider the exponential Diophantine equation \( (2k-1)(bk-1)=yq \) with k 2, odd integer b and an odd prime exponent q and obtain effective upper bounds for q in terms of b. In particular, we show that q 2(b+1) holds apart from a finite, explicitly determined set of exceptional pairs (b,q) when 3 b<106. As an application, we prove that the related equation \( (2k-1)(bk-1)=xn, \) has no positive integer solution (k,x,n) for several specific odd values of b, including b∈\5,7,11,13,21,23,27,29\.

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…