1 Ocak 2018 Dergi makalesi Açık Erişim

Akbal, Yildirim

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<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:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Akbal, Yildirim</dc:creator>
  <dc:date>2018-01-01</dc:date>
  <dc:description>An integer is called y-rough if it is composed solely of primes &gt; y. Let left perpendicular.right perpendicular be the floor function. In this paper, we exhibit an asymptotic formula for the counting function of integers n &lt;= x such that left perpendicular n(c) right perpendicular is y-rough uniformly for a range of y that depends on 1 &lt; c &lt; 2229/1949.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/33609</dc:identifier>
  <dc:identifier>oai:zenodo.org:33609</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>MONATSHEFTE FUR MATHEMATIK 185(1) 1-15</dc:source>
  <dc:title>Rough values of Piatetski-Shapiro sequences</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>