<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-interdisciplinary-mathematics</journal-id>
      <journal-title-group>
        <journal-title>Journal of Interdisciplinary Mathematics</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-012X</issn>
      <issn publication-format="print">0972-0502</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JIM-1616</article-id>
      <title-group>
        <article-title>On certain prime numbers in Lucas sequences</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Athab</surname>
            <given-names>Ali S.</given-names>
          </name>
          <aff>Faculty of Computer Science and Mathematics, University of Kufa, Najaf, Iraq</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Hashim</surname>
            <given-names>Hayder R.</given-names>
          </name>
          <aff>Faculty of Computer Science and Mathematics, University of Kufa, Najaf, Iraq</aff>
        </contrib>
      </contrib-group>
      <volume>26</volume>
      <issue>6</issue>
      <fpage>1181</fpage>
      <lpage>1192</lpage>
      <pub-date date-type="pub">
        <day>08</day>
        <month>09</month>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>In 1964, Shanks conjectured that there are infinitely many primes of the form 1/2(x2 + 1). Therefore, the aim of this paper is to introduce a technique for studying whether or not there are infinitely many prime numbers of the form 1/2(x2 + 1) derived from some Lucas sequences of the first kind {Un(P, Q)}  or the second kind {Vn(P, Q)}, where P ≥ 1  and Q = ±1. In addition, as applications we represent the procedure of this technique in case of x is an either integer or Lucas number of the first or the second kind with x ≥ 1 and 1 ≤ P ≤ 20.</p>
      </abstract>
      <kwd-group>
        <kwd>Lucas sequences</kwd>
        <kwd>Diophantine equation</kwd>
        <kwd>Shanks’ conjecture</kwd>
        <kwd>Prime numbers</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
