OAR@UM Collection:https://www.um.edu.mt/library/oar/handle/123456789/360812026-04-10T05:22:02Z2026-04-10T05:22:02ZThe cantor sethttps://www.um.edu.mt/library/oar/handle/123456789/244922017-12-12T02:36:53Z2001-01-01T00:00:00ZTitle: 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.2001-01-01T00:00:00ZSubgraphshttps://www.um.edu.mt/library/oar/handle/123456789/244912017-12-12T02:36:57Z2001-01-01T00:00:00ZTitle: Subgraphs
Abstract: Let H be a graph and K be a subgraph of H. Let n(G) denote the
number of vertices of a graph C and k(G) denote the number of components
of G. Then n(K) - k(K) < n(H) - k(H).2001-01-01T00:00:00ZConverse of Wilson's theoremhttps://www.um.edu.mt/library/oar/handle/123456789/244902017-12-12T02:36:52Z2001-01-01T00:00:00ZTitle: Converse of Wilson's theorem
Abstract: Theorem 1 (Wilson's Theorem) If p is prime, then (p - 1)! = -1 mod p.
Theorem 2 (Converse to Theorem 1) If (p - 1)! = -1 mod p, then p is prime.2001-01-01T00:00:00ZBoolean ringshttps://www.um.edu.mt/library/oar/handle/123456789/244882017-12-12T02:36:54Z2001-01-01T00:00:00ZTitle: Boolean rings
Abstract: A ring is a triple comprising a set R and two binary operations + and· satisfying
the following properties (refer to Figure 1):
1. R is an Abelian group under +
2. R is closed and associative under .
3. . is distributive over +2001-01-01T00:00:00Z