Solutions of Pell’s Equation Involving Left Truncated

  • V. A. BinduDepartment of Mathematics Rajagiri School of Engineering & Technology, Kakkanad, Cochin-682039, Kerala, India.
  • Somanath ManjuNational College, (Affiliated to Bharathidasan University), Tiruchirappalli-620 002, Tamil Nadu, India.
  • Das RadhikaDepartment of Mathematics Rajagiri School of Engineering & Technology, Kakkanad, Cochin-682039, Kerala, India.

Abstract

A Left-truncatable prime is a prime which in a given base (say 10) does not contain 0 and which remains prime when the leading (left) digit is successively removed. For example, 317 is left-truncatable prime since 317, 17 and 7 are all prime. Taking the cue from this initial research, we attempt to find the possible solutions for the Pell’s equation x = 137y − 37 for all choices of m ∈ ℕ. In this paper, we focused primarily on Pell’s equations involving the left-truncatable primes and present to you another mysterious series and pattern typically associated with the Pell’s equation. As we proceed through the research, we will bring to the fore the recurrence relations among the identified solutions.

Keywords:Pell’s equationDiophantine equationsInteger solutionsRecurrence relationLeft truncated primes

1. Introduction

“Number Theory” has time and again thrown its magic at the human world, specifically the world of wizards; the Mathematicians. We all know about the beautiful instances of the prime numbers. In this article, we explore the realm of truncated primes. We are talking about left truncated primes. The initial thought was given to these patterns by “Leslie Card” who first started off by researching into right truncated primes. This was picked up later and subsequent research was done to understand the left truncated primes too. It threw light on the specific part of prime numbers and was given to understand that we have 4260 left truncated primes. The following sequence of left truncatable primes will enable us to understand the magic of these numbers. These numbers are 2, 3, 5, 7, 13, 17, 23, 37, 43, 47, 53, 67, 73, 83, 97, 113, 137, 167, 173, 197, 223, 283, 313, 317, 337, 347, 353, 367, 373, 383, 397, 443, 467, 523, 547, 613, 617, 643, 647, 653, 673, 683, 743, 773, 797, 823, 853, 883, 937, 947, 953, 967, 983, 997, ... As noted in the sequence, we have another manifestation of the Pell’s equation which is the prime focus of this research. We took up the left truncatable primes and attempted to find solutions for the equation represented by this prime. In this instance, we identified the Pell’s equation x = 137y − 37 , m ∈ ℕ ; using the left truncated prime numbers 137 and 37. Note that 137 is the initial prime number, where upon truncating the left most digit; we get 37. The equation is built on these two primes 137 and 37. Our attempt will be to search for its non-trivial integer solutions. To derive the solutions, we will set the proof rolling by we approached the quest with the case of choices of m generalized in all even and odd integers [1–3].

2. Preliminaries

Theorem 1. If x1 , y1 is considered as the fundamental solution of x − dy = 1. Then to be noted is that every positive solution of the equation is given by xn, yn where xn and yn are the integers determined from xn + yn√d = (x1 + y1√d) , for n = 1,2,3, … [4].

2.1 Solubility of the Negative Pell’s Equation-Our Test Approach

We assume that D is a positive integer, and considered not a perfect square. Then the negative Pell’s equation

2 2 2 2

x − Dy = −1 is considered soluble if and only if D is expressed as D = a + b , gcd(a, b) = 1, a and b are positive, b is odd and the Diophantine equation −bV + 2aVW + bW = 1 has a solution [5]. (We highlight this as the case of solubility that occurs for exactly one such (a, b)) [6].

The Algorithm followed by us is illustrated below:

I. We will first find all expressions of D considered as a sum of two relatively prime squares using Cornacchia's method. If none exists - the negative Pell’s equation is not soluble.

II. For each representation D = a + b , gcd (a, b) = 1, a and b positive, b odd, we will test the solubility of −bV + 2aVW + bW = 1 using the Lagrange-Matthews algorithm. If soluble and it exists - the negative Pell’s equation is soluble.

III. If each representation yields no probable solution, then the negative Pell’s equation is insoluble [7]. Theorem 2. If p is a prime number, the negative Pell’s equation x − py = −1 is considered solvable if and only if p = 2 or p ≡ 1(mod4).

3. Method of Analysis

Theorem 3. The negative Pell’s equation x − 137y = −37 , m ∈ ℕ is solvable in integers.

Proof. Consider the negative Pell’s equation x = 137y − 37 , m ∈ ℕ. For the negative Pell’s equation, we will consider the prime p = 137, which satisfies the identified conditions of Theorem 2. Therefore, equation x − 137y = −1, is solvable and we can substantiate with certainty the proof that the negative Pell’s equation x = 137y − 37 , m ∈ ℕ is solvable and prevalent in integers [4], [8].

Using the Algorithm as illustrated in solubility of the negative Pell’s equation for (a, b) = (4,11): −bV +

2 2 2

2aVW + bW = 1 has a solution (V, W) = (−7, 10), hence the negative Pell’s equation x − 137y = −1 is soluble.

Choice 1. m = 1 In our quest to find the other solutions of Eq. (1), consider the generalized form of the Pell’s equation

x = 137y + 1. (2)

The initial solution of Eq. (2) is (6083073,519712) and the general solution (x ̃ n, y ̃ n) given by Theorem 1 as

1 1 n+1 n+1

x ̌ n = fn, y ̃ n = gn, where fn = (6083073 + 519712√137) + (6083073 − 519712√137) ,

2 2√137

gn = (6083073 + 519712√137) − (6083073 − 519712√137) , n = 0,1,2 … .

By applying Brahma Gupta lemma between (x0, y0) and (x ̃ n, y ̃ n) the possible sequence of non-zero distinct integer solutions to Eq. (1) are obtained as given below

xn+1 = x0x ̃ n + dy0y ̃ n , yn+1 = x0y ̃ n + y0x ̃ n, (3) xn+1 = [10fn − √137gn], yn+1 = [−√137fn + 10gn]. (4)

2 2√137

Also to be noted is the recurrence relation satisfied by the solution of Eq. (1) given by

Choice 2. m = 3.

Let (x0, y0) be the initial solution of Eq. (6) given by x0 = 370, y0 = −37. Applying Brahma Gupta lemma between (x0, y0) and (x ̃ n, y ̃ n) the possible sequence of non-zero distinct integer solutions to Eq. (6) are obtained by equation Eq. (3) as given below

Choice 3. m = 5.

integer solutions to Eq. (9) obtained by equation Eq. (3) as Choice 4. m = 2k, k ∈ ℕ.

2 2 2k (12)

x = 137y − 37 , k ∈ ℕ.

Let (x0, y0) be the initial solution of equation Eq. (12) given by x0 = 1744(37) ; y0 = 149(37) .

integer solutions to Eq. (12) are obtained by Eq. (3) as given below

Choice 5. m = 2k + 5, k ∈ ℕ.

2 2 2k+5 (15)

x = 137y − 37 , k ∈ ℕ.

k−1 k−1

Let (x0, y0) be the initial solution of the Eq. (15) given by x0 = 506530(37) , y0 = 50653(37) .

Applying Brahma Gupta lemma between (x0, y0) and (x ̃ n, y ̃ n) the sequence of non-zero distinct integer solutions to Eq. (15) are obtained by Eq. (3) as

xn+1 = ቂ506530fn − 50653ඥ137gnቃ,

yn+1 = ቂ−50653ඥ137fn + 506530gnቃ.

2ඥ137

4. Conclusion

We conclude this research of solving a Pell’s equation involving the left truncatable primes 137 and 37. As seen above illustrated by the analysis and the steps thereof; we have successfully proved the equation x = 137y − 37 , m ∈ ℕ for all integers. Finding the solution for the Pell’s equation constituted by having left truncated primes reinforced the possibility of having solutions to our identified equation [9], [10].

Funding

The authors declare that no external funding was received for the research, authorship, or publication of this article.

Data Availability

This study is based on theoretical analysis and does not involve any experimental or empirical data. All information supporting the findings is included within the article. Further clarifications can be obtained from the corresponding author upon reasonable request.

Conflicts of Interest

The authors affirm that there are no known conflicts of interest associated with this publication.

References

  1. [1] Weil, A. (2006). Number theory: an approach through history from hammurapi to legendre. Springer Science & Business Media. https://books.google.com/books
  2. [2] Mordell, L. J. (1969). Diophantine equations: diophantine equations (Vol. 30). Academic press. https://books.google.com/books
  3. [3] Gopalan, M. A. (2014). Sangeetha. V and Manju somanath, On the integer solutions of the pell equation ? 2= 13?2- 3? International journal of applied mathematical research, 3(1), 58–61. https://www.researchgate.net/publication/307649870_On_the_integer_solutions_of_the_Pell_equation _x213y2-3t
  4. [4] Tekcan, A., Gezer, B., & Bizim, O. (2007). On the integer solutions of the Pell equation x2- dy2= 2t. International journal of computational mathematical sciences, 1(3), 204–208. https://doi.org/10.5281/ZENODO.1328399
  5. [5] Matthews, K. (2000). The Diophantine Equation x^ 2-Dy^ 2= N, D> 0. Expositiones mathematicae, 18(4), 323-332. http://numbertheory.org/PDFS/patz5.pdf
  6. [6] Hardy, K., & Williams, K. (1986). On the solvability of the diophantine equation dV 2− 2eV W− dW2=
  7. [1] Pacific journal of mathematics, 124(1), 145-158. http://dx.doi.org/10.2140/pjm.1986.124.145
  8. [7] Jones, J. P. (2003). Representation of solutions of Pell equations using Lucas sequences. Acta academia pead. agr., sectio mathematicae, 30, 75–86. https://ftp.gwdg.de/pub/misc/EMIS/journals/AMI/2003/jones.pdf
  9. [8] Niven, I., Zuckerman, H. S., & Montgomery, H. L. (1991). An introduction to the theory of numbers. John Wiley & Sons. https://books.google.com/books
  10. [9] Lenstra Jr, H. W. (2002). Solving the Pell equation. Notices of the ams, 49(2), 182–192. https://brg.me.uk/wp-content/uploads/2022/03/pell.pdf
  11. [10] Somanath, M., Bindu, V. A., & Das, R. (2023). Solutions of pell’s equation involving sophie germain primes. Jnanabha, 53(2), 40–43. https://doi.org/10.58250/jnanabha.2023.53204