Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Prime Solutions to the Diophantine Equation 2n = p2 +7

Version 1 : Received: 27 February 2024 / Approved: 28 February 2024 / Online: 28 February 2024 (13:55:57 CET)

How to cite: U Zaman, B. Prime Solutions to the Diophantine Equation 2n = p2 +7. Preprints 2024, 2024021638. https://doi.org/10.20944/preprints202402.1638.v1 U Zaman, B. Prime Solutions to the Diophantine Equation 2n = p2 +7. Preprints 2024, 2024021638. https://doi.org/10.20944/preprints202402.1638.v1

Abstract

The Diophantine equation for which p is prime 2^n = p^2 + 7 and n is integers with p > 0, is examined in this work. It is demonstrated by examining the characteristics of the equation that the only solutions meeting these requirements are p = 3 with n = 5 and p = 5 with n = 7. In order to analyze the above equation, it is necessary to look at the properties of primes and how they relate to powers of two. These results advance our knowledge of prime numbers and how they behave in certain mathematical problems.

Keywords

integers;  Diophantine Equation; prime number

Subject

Computer Science and Mathematics, Algebra and Number Theory

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.