<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-03-07T11:52:11Z</responseDate>
  <request verb="GetRecord" identifier="oai:it-hiroshima.repo.nii.ac.jp:00001086" metadataPrefix="oai_dc">https://it-hiroshima.repo.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:it-hiroshima.repo.nii.ac.jp:00001086</identifier>
        <datestamp>2023-07-25T10:33:51Z</datestamp>
        <setSpec>1:18:388</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>The Number of Consecutive Heads in a Run</dc:title>
          <dc:creator>Hirose, Hideo</dc:creator>
          <dc:creator>ヒロセ, ヒデオ</dc:creator>
          <dc:creator>廣瀬, 英雄</dc:creator>
          <dc:subject>coin tossing</dc:subject>
          <dc:subject>run</dc:subject>
          <dc:subject>consecutive heads</dc:subject>
          <dc:subject>solitary head coin</dc:subject>
          <dc:subject>dual problem</dc:subject>
          <dc:description>application/pdf</dc:description>
          <dc:description>How many consecutive heads do we observe in a run of coin tossing of length n? Although the problem seems to be easy to answer, this would be actually a little bit tough when we try to prove it straightforwardly. The expected number of consecutive heads in a run is 3n-2/8 (n≧2) using the recursive formula.|However, if we define a solitary head coin such that a head coin is isolated by neighboring tail coin(s) in a run, the problem of how many solitary heads we observe in a run can be solved easily. The expected number of solitary heads in a run is n+2/8 (n≧2). Since the problem of solitary head coin becomes a dual problem of the above, the consequence of the problem of the consecutive heads is derived easily by considering the probability of a solitary coin appearance.</dc:description>
          <dc:description>departmental bulletin paper</dc:description>
          <dc:publisher>広島工業大学</dc:publisher>
          <dc:date>2019-02</dc:date>
          <dc:type>VoR</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>広島工業大学紀要. 研究編</dc:identifier>
          <dc:identifier>53</dc:identifier>
          <dc:identifier>177</dc:identifier>
          <dc:identifier>179</dc:identifier>
          <dc:identifier>AA11599110</dc:identifier>
          <dc:identifier>13469975</dc:identifier>
          <dc:identifier>https://it-hiroshima.repo.nii.ac.jp/record/1086/files/research53_177-179.pdf</dc:identifier>
          <dc:identifier>https://it-hiroshima.repo.nii.ac.jp/records/1086</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>publisher</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
