• No results found

On the Solvability of the Diophantine Equation $p^x+(p+8)^y=z^2$ when $p>3$ and $p+8$ are Primes

N/A
N/A
Protected

Academic year: 2020

Share "On the Solvability of the Diophantine Equation $p^x+(p+8)^y=z^2$ when $p>3$ and $p+8$ are Primes"

Copied!
5
0
0

Loading.... (view fulltext now)

Full text

(1)

Vol. 18, No. 1, 2018, 9-13

ISSN: 2279-087X (P), 2279-0888(online) Published on 14 July 2018

www.researchmathsci.org

DOI: http://dx.doi.org/10.22457/apam.v18n1a2

9

Annals of

On the Solvability of the Diophantine Equation

+ +

=

when

> 3

and

+

are Primes

Fernando Neres de Oliveira

Department of Science and Technology, Federal Rural Semi-Arid University Caraúbas Campus, RN, Brazil. E-mail: fernandoneres@ufersa.edu.br

Received 13 May 2018; accepted 11 July 2018

Abstract. In this paper we prove that the diophantine equation + + 8 = has no solution , , in positive integers when > 3 and + 8 are primes.

Keywords: diophantine equation; pairs of prime of the form , + 8; positive integer solutions

AMS Mathematics Subject Classification (2010): 11D61 1. Introduction

The study of the solvability of diophantine equations is one of the classic problems in elementary number theory and algebraic number theory. In recent years, the authors have published several papers on the solvability of diophantine equations of the type

+ = (1)

where and are distinct prime numbers. In 2016, Rabago [9] proved that the equation 2+ 17 = has exactly five solutions , , in positive integers. The only solutions are 3,1,5, 5,1,7, 6,1,9, 7,3,71 and 9,1,23. In 2017, Asthana and Singh [1] proved that the equation 3+ 13 = has exactly four solutions , , in non-negative integers. The solutions are 1,0,2, 1,1,4, 3,2,14 and 5,1,16. Recently, Burshtein [2] proved that the diophantine equation + + 4= has no solution , , in positive integers when > 3 and + 4 are primes.

(2)

10

In this section, we will present some basic results that will be useful in the next section.

Lemma 2.1. Suppose that > 3 and + 8 are primes. If , , is a solution in positive

integers of the diophantine equation + + 8 = then 4|$.

Proof: We have + + 8 = . Since > 3 and + 8 are primes then and

+ 8 are odd. Thus, + + 8 is even, i.e., is even. Therefore, 4|$.

Lemma 2.2. Any power of an integer of the form 4% + 1 % > 0 integer is of the form

4- + 1 - > 0 integer, i.e., for every integer ≥ 1, we have 4% + 1" = 4- + 1, where - > 0 is an integer.

Proof: For = 1, we have 4% + 1.= 4% + 1. Suppose that for some integer ≥ 1,

we have 4% + 1"= 4- + 1, where - > 0 is an integer. Hence,

4% + 1"/.= 4% + 1"4% + 1 = 4- + 14% + 1 = 44-% + - + % + 1.

Therefore, it follows from the principle of induction that for every integer ≥ 1, we have 4% + 1"= 4- + 1, where - > 0 is an integer.

Lemma 2.3. Any even power of an integer of the form 4% + 3 % > 0 integer is of the

form 4- + 1 - > 0 integer and any odd power of an integer of the form 4% + 3 % > 0 integer is of the form 40 + 3 0 > 0 integer, i.e., for every integer ≥ 1, we have

4% + 3" = 14- + 1, if is even 40 + 3, if is odd$

where - > 0 is an integer and 0 > 0 is an integer.

Proof: For = 2 we have 4% + 3= 16%+ 24% + 9 = 44%+ 6% + 2 + 1.

Suppose that for some integer = 2 ≥ 1 we have 4% + 38 = 4- + 1, where - > 0 is an integer. Hence, we obtain that

4% + 38/= 4- + 116%+ 24% + 9 = 49-4% + 3+ 4%+ 6% + 2: + 1,

and, therefore, follows from the principle of induction that for every integer ≥ 2 even, we have 4% + 3"= 4- + 1, where - > 0 is an integer. On the other hand, for = 1 we get4% + 3.= 4% + 3. Suppose that for some integer = 2 + 1 ≥ 0 we have 4% + 38/. = 40 + 3, where 0 > 0 is an integer. Hence, we obtain that

4% + 38/;= 40 + 316%+ 24% + 9 = 4904% + 3+ 12%+ 18% + 6: + 3,

and, therefore, follows from the principle of induction that for every integer ≥ 1 odd, we have 4% + 3"= 40 + 3, where 0 > 0 is an integer. □

3. Main results

(3)

On the Solvability of the Diophantine Equation + + 8 = when > 3 and + 8 are Primes

11

Proof: Suppose there are positive integers , and such that + + 8 = .

Hence, it follows from Lemma 2.2 that there are positive integers - and 0, such that,

= + + 8 = 4- + 1 + 40 + 1 = 4- + 0 + 2.

But, this implies that 4 ∤ , contradicting the Lemma 2.1. □

Theorem 3.2. Suppose that is any prime of the form = 4< + 3 < > 0 and + 8 is prime. If and have the same parity then the diophantine equation + + 8 = has no solution in positive integers , and .

Proof: Suppose there are positive integers = 2> > ≥ 1, = 2? ? ≥ 1 and , such

that, @+ + 8A = . Hence, it follows from Lemma 2.3 that there are positive integers - and 0, such that,

= @+ + 8A = 4- + 1 + 40 + 1 = 4- + 0 + 2.

But, this implies that 4 ∤ , contradicting the Lemma 2.1. Suppose now that there are positive integers = 2> + 1 > ≥ 0, = 2? + 1 ? ≥ 0 and , such that, @/.+ + 8A/.= . Hence, it follows from Lemma 2.3 that there are positive integers -and 0, such that,

= @/.+ + 8A/.= 4- + 3 + 40 + 3 = 4- + 0 + 1 + 2.

But, this implies that 4 ∤ , contradicting the Lemma 2.1. □

Theorem 3.3. Suppose that is any prime of the form = 4< + 3 < > 0 and + 8 is prime. If is even and is odd then the diophantine equation + + 8 = has no solution in positive integers , and .

Proof: Suppose there are positive integers = 2> > ≥ 1, = 2? + 1 ? ≥ 0 and , such that, @+ + 8A/.= , or equivalently, such that,

+ 8A/.= + @@.

Thus, it follows from the primality of + 8 that + @ = + 8C and − @ = + 8D, where E > F ≥ 0 are integers such that E + F = 2? + 1. Hence,

2@= + 8C− + 8D= + 8D9 + 8CGD− 1:. (2)

Note that, F = 0 (otherwise, we would conclude from (2) that + 8 divides 2 or + 8 divides (both impossible)). This implies that

(4)

12 primality of + 8. For ? ≥ 1, we have

2@ = + 8A/.− 1 = + 79 + 8A+ + 8AG.+ ⋯ + + 8.+ 1:. (4)

It follows then from (4) that + 7 is an even positive divisor (and non-trivial) of 2@, i.e., + 7 = 2I where J is an integer such that 0 ≤ J < >. For J = 0, we obtain that + 7 = 2, which is impossible. For 1 ≤ J < >, we obtain that = 7 and + 8 = 15, which contradicts the primality of + 8. □

Theorem 3.4. Suppose that is any prime of the form = 4< + 3 < > 0 and + 8 is prime. If is odd and is even then the diophantine equation + + 8 = has no solution in positive integers , and .

Proof: Suppose there are positive integers = 2> + 1 > ≥ 0, = 2? ? ≥ 1 and , such that, @/.+ + 8A= , or equivalently, such that,

@/.= 9 + + 8A:9 − + 8A:.

Thus, it follows from the primality of that + + 8A = C and − + 8A = D, where E > F ≥ 0 are integers such that E + F = 2> + 1. Hence,

2 + 8A = CD= DCGD− 1. (5)

Note that, F = 0 (otherwise, we would conclude from (5) that divides 2 or divides + 8 (both impossible)). This implies that

2 + 8A = C− 1 = @/.− 1. (6) For > = 0, we obtain from (6) that 2 + 8A = − 1 = + 8 − 9. But, this implies that + 8 = 3, which is impossible. For > ≥ 1, we have

2 + 8A = @/.− 1 = − 19@+ @G.+ ⋯ + .+ 1:. (7) It follows then from (7) that − 1 is an even positive divisor (and non-trivial) of 2 + 8A, i.e., − 1 = 2 + 8I where J is an integer such that 0 ≤ J < ?. For J = 0, we obtain that = 3 (contradiction!). For 1 ≤ J < ?, we obtain that + 8 = 3, which is impossible. □

Corollary 3.1. Let ≥ 2 be a fixed integer (and arbitrary). If > 3 and + 8 are primes then the diophantine equation + + 8 = !" has no solution in positive integers , and !.

Proof: Suppose there are positive integers M, N and O such that P+ + 8Q= O". Hence, it follows that , , = M, N, O" is an solution in positive integers of the diophantine equation + + 8 = (contradiction!). □

(5)

On the Solvability of the Diophantine Equation + + 8 = when > 3 and + 8 are Primes

13

, + 8 = 3,11 was not considered in this work, but through a brief investigation it is possible to make some considerations. All possible solutions in positive integers of the diophantine equation 3+ 11 = occur when is even, since 3+ 11@ ≡ 1mod 3, 3+ 11A/.≡ 2mod 3 and ≡ 0,1mod 3. Moreover, if is odd and is even, we can easily verify that , , = 5,4,122 is an solution of the diophantine equation 3+ 11= . However, some issues remain open. Is this the only solution in positive integers? If there are other solutions, what are they?

REFERENCES

1. S.Asthana and M.M.Singh, On the diophantine equation 3+ 13 = , Int. J. Pure Appl. Math., 114(2) (2017) 301-304.

2. N.Burshtein, All the solutions of the Diophantine Equation + + 4= when > 3, (p+4) are primes and + = 2, 3, 4, Annals of Pure and Applied Mathematics, 16(1) (2018) 241-244.

3. N.Burshtein, Solutions of the Diophantine Equation + + 6 = when , + 6 are primes and + = 2, 3, 4, Annals of Pure and Applied Mathematics, 17(1) (2018) 101-106.

4. N.Burshtein, On solutions of the Diophantine Equation + = , Annals of Pure and Applied Mathematics, 13(1) (2017) 143-149.

5. N.Burshtein, On the infinitude of solutions to the diophantine equation + = when = 2 and = 3, Annals of Pure and Applied Mathematics, 13(2) (2017) 207-210.

6. S.Chotchaisthit, On the diophantine equation + + 1 = where is a mersenne prime, Int. J. Pure Appl. Math., 88(2) (2013) 169-172.

7. S.Chotchaisthit, On the diophantine equation 2+ 11 = , Maejo Int. J. Sci. Technol., 7(2) (2013) 291-293.

8. OEIS (Online Encyclopedia of Integer Sequences) available at https://oeis.org/A156320

9. J.F.T.Rabago, On the diophantine equation 2+ 17 = , J. Indones. Math. Soc., 22(2) (2016) 85-88.

10. B.Sroysang, On the diophantine equation 3+ 5= , Int. J. Pure Appl. Math., 81(4) (2012) 605-608.

11. B.Sroysang, On the diophantine equation 5+ 7 = , Int. J. Pure Appl. Math., 89 (1) (2013) 115-118.

12. B.Sroysang, On the diophantine equation 5+ 23= , Int. J. Pure Appl. Math., 89(1) (2013) 119-122.

13. B.Sroysang, On the diophantine equation 5+ 43= , Int. J. Pure Appl. Math., 91(4) (2014) 537-540.

14. A.Suvarnamani, On the diophantine equation + + 1 = , Int. J. Pure Appl. Math., 94 (5) (2014) 689-692.

15. S.Tanakan, On the diophantine equation 19+ 2 = , Int. J. Contemp. Math. Sciences, 9(4) (2014) 159-162.

References

Related documents

The aim of this work was to explore capillary microsampling as an alternative methodology to dried blood spot sampling for the analysis of whole blood in mouse

This case study describes the application of a solution-focused brief therapy (SFBT) theoretical framework by a Trainee Sport and Exercise Psychologist working with an amateur

This work developed a multi-agent based traffic management model to ease traffic flow in a chaotic traffic environment.. The developed model employed a multiagent

This paper addresses the classification of thyroid nodule through local binary pattern (LBP), local configuration pattern (LCP) and completed local binary pattern

in survival in patients with A lzheim er’s disease admitted to a single Toronto hospital.. over a ten year period (Thompson and Eastwood,

[ 45 ] used whole exome sequencing (WES), whole genome sequencing (WGS) and/or matepair sequencing to identify mutations in fresh frozen tumour tissue before designing

The results revealed that individuals exposed to gas flare impacted environment had significantly (p&lt;0.05) higher serum levels of cystatin-C, creatinine, urea,