<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>OAR@UM Community:</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/36078</link>
    <description />
    <pubDate>Thu, 16 Apr 2026 11:09:11 GMT</pubDate>
    <dc:date>2026-04-16T11:09:11Z</dc:date>
    <item>
      <title>The Collection IV</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/24493</link>
      <description>Title: The Collection IV
Editors: Sciriha, Irene
Abstract: Fourth issue of The Collection, a journal by the Department of Mathematics at the University of Malta.</description>
      <pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/24493</guid>
      <dc:date>2001-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>The cantor set</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/24492</link>
      <description>Title: The cantor set
Abstract: Consider the following sets, where C1 is the real interval [0, 1] without the middle 1/3 of the interval, and Ck is constructed by removing 1/3 of each real interval in the union of intervals in Ck - 1.</description>
      <pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/24492</guid>
      <dc:date>2001-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Subgraphs</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/24491</link>
      <description>Title: Subgraphs
Abstract: Let H be a graph and K be a subgraph of H. Let n(G) denote the&#xD;
number of vertices of a graph C and k(G) denote the number of components&#xD;
of G. Then n(K) - k(K) &lt; n(H) - k(H).</description>
      <pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/24491</guid>
      <dc:date>2001-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Converse of Wilson's theorem</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/24490</link>
      <description>Title: Converse of Wilson's theorem
Abstract: Theorem 1 (Wilson's Theorem) If p is prime, then (p - 1)! = -1 mod p.&#xD;
Theorem 2 (Converse to Theorem 1) If (p - 1)! = -1 mod p, then p is prime.</description>
      <pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/24490</guid>
      <dc:date>2001-01-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

