<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/36078">
    <title>OAR@UM Community:</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/36078</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/24493" />
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/24492" />
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/24491" />
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/24490" />
      </rdf:Seq>
    </items>
    <dc:date>2026-04-11T11:26:52Z</dc:date>
  </channel>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/24493">
    <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>
    <dc:date>2001-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/24492">
    <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>
    <dc:date>2001-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/24491">
    <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>
    <dc:date>2001-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/24490">
    <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>
    <dc:date>2001-01-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

