<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01353nam a22001937a 4500</leader>
  <controlfield tag="005">20240409081453.0</controlfield>
  <controlfield tag="008">240409b        |||||||| |||| 00| 0 eng d</controlfield>
  <datafield tag="022" ind1=" " ind2=" ">
    <subfield code="a">0025-570X  </subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Cohen, Joel E. </subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Generalizations of Bertrand&#x2019;s Postulate to Sums of Any Number of Primes</subfield>
    <subfield code="b">(Journal Article)</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Philadelphia, PA </subfield>
    <subfield code="b">:Taylor &amp; Francis Group </subfield>
    <subfield code="c">, September 2023</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">428-432p.</subfield>
  </datafield>
  <datafield tag="440" ind1=" " ind2=" ">
    <subfield code="a">Mathematics Magazine </subfield>
    <subfield code="v">Volume 96: Number 4, October 2023</subfield>
  </datafield>
  <datafield tag="505" ind1=" " ind2=" ">
    <subfield code="a">***______{For Hard Copy, Please visit Library.}________***

</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Abstract: In 1845, Bertrand conjectured what became known as Bertrand&#x2019;s postulate or the Bertrand-Chebyshev theorem: twice and prime strictly exceeds the next prime. Surprisingly, a stronger statement seems not to be well-known: the sum of any two consecutive primes strictly exceeds the next prime, except for the only equality 2+3=5. Our main theorem is a much more general result, perhaps not previously noticed, that compares sums of any number of primes. We prove this result using only the prime number theorem. We also give some numerical results and unanswered questions.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Bertrand conjecture | Bertrand&#x2019;s postulate| Bertrand-Chebyshev theorem| prime number theorem</subfield>
  </datafield>
  <datafield tag="856" ind1=" " ind2=" ">
    <subfield code="u">https://doi.org/10.1080/0025570X.2023.2231336</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">PER</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RIEBPL</subfield>
    <subfield code="b">RIEBPL</subfield>
    <subfield code="d">2024-04-09</subfield>
    <subfield code="l">0</subfield>
    <subfield code="r">2024-04-09 08:15:00</subfield>
    <subfield code="w">2024-04-09</subfield>
    <subfield code="y">PER</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">45625</subfield>
    <subfield code="d">45624</subfield>
  </datafield>
</record>
