<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>OAR@UM Community:</title>
  <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/23567" />
  <subtitle />
  <id>https://www.um.edu.mt/library/oar/handle/123456789/23567</id>
  <updated>2026-04-20T21:12:41Z</updated>
  <dc:date>2026-04-20T21:12:41Z</dc:date>
  <entry>
    <title>The Collection IV</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/24493" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/24493</id>
    <updated>2022-10-05T12:23:31Z</updated>
    <published>2001-01-01T00:00:00Z</published>
    <summary type="text">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.</summary>
    <dc:date>2001-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>The cantor set</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/24492" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/24492</id>
    <updated>2017-12-12T02:36:53Z</updated>
    <published>2001-01-01T00:00:00Z</published>
    <summary type="text">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.</summary>
    <dc:date>2001-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Subgraphs</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/24491" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/24491</id>
    <updated>2017-12-12T02:36:57Z</updated>
    <published>2001-01-01T00:00:00Z</published>
    <summary type="text">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).</summary>
    <dc:date>2001-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Converse of Wilson's theorem</title>
    <link rel="alternate" href="https://www.um.edu.mt/library/oar/handle/123456789/24490" />
    <author>
      <name />
    </author>
    <id>https://www.um.edu.mt/library/oar/handle/123456789/24490</id>
    <updated>2017-12-12T02:36:52Z</updated>
    <published>2001-01-01T00:00:00Z</published>
    <summary type="text">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.</summary>
    <dc:date>2001-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

