<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><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-11-22T14:06:38Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/21987" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/21987</identifier><datestamp>2025-11-06T08:04:56Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9932</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Das, Sourabhashis</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2025-07-09T18:16:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2025-07-09T18:16:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2025-07-09</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2025-06-28</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/10012/21987</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Let k and n be natural numbers. Let ω(n) denote the number of distinct prime factors of n, Ω(n) denote the total number of prime factors of n counted with multiplicity, and ω_k(n) denote the number of distinct prime factors of n that occur with multiplicity exactly k.

Let h ≥ 2 be a natural number. We say that n is h-free if every prime factor of n has multiplicity less than h, and h-full if all prime factors of n have multiplicity at least h.

In 1917, Hardy and Ramanujan proved that both ω(n) and Ω(n) have normal order log log n over the natural numbers. In this thesis, using a new counting argument, we establish the first and second moments of all these arithmetic functions over the sets of h-free and h-full numbers. We show that the normal order of ω(n) is log log n for both h-free and h-full numbers. For Ω(n), the normal order is log log n over h-free numbers and h log log n over h-full numbers. We also show that ω_1(n) has normal order log log n over h-free numbers, and ω_h(n) has normal order log log n over h-full numbers. Moreover, we prove that the functions ω_k(n) with 1 &amp;lt; k &amp;lt; h do not have a normal order over h-free numbers, and that the functions ω_k(n) with k &amp;gt; h do not have a normal order over h-full numbers.

In their seminal work, Erdős and Kac showed that ω(n) is normally distributed over the natural numbers. Later, Liu extended this result by proving a subset generalization of the Erdős–Kac theorem. In this thesis, we leverage Liu’s framework to establish the Erdős–Kac theorem for both h-free and h-full numbers. Additionally, we show that ω_1(n) satisfies the Erdős–Kac theorem over h-free numbers, while ω_h(n) satisfies it over h-full numbers.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject">prime divisor counting functions</dim:field>
   <dim:field mdschema="dc" element="subject">h-free numbers</dim:field>
   <dim:field mdschema="dc" element="subject">h-full numbers</dim:field>
   <dim:field mdschema="dc" element="subject">normal order</dim:field>
   <dim:field mdschema="dc" element="subject">Erdős-Kac theorem</dim:field>
   <dim:field mdschema="dc" element="title">On the distributions of prime divisor counting functions</dim:field>
   <dim:field mdschema="dc" element="type">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department">Pure Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline">Pure Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Liu, Yu-Ru</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Kuo, Wentang</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>