Now showing items 1-4 of 4

  • Brocard's problem and variations

    Liu, Yi (University of Waikato, 2013)
    This thesis examines the work which has been done on Brocard’s problem which is to study solutions to n! + 1 = x², and related problems of the form n! = f(x) or n! = f(x, y), where f is a polynomial with integer ...
  • Comparison between the RSA cryptosystem and elliptic curve cryptography

    Abdullah, Kamilah (The University of Waikato, 2010)
    In the globalization era, cryptography becomes more popular and powerful; in fact it is very important in many areas (i.e. mathematics, computer science, networks, etc). This thesis provides an overview and comparison ...
  • Critical sets of full Latin squares

    Raass, Petelo Vaipuna (University of Waikato, 2016)
    This thesis explores the properties of critical sets of the full n-Latin square and related combinatorial structures including full designs, (m,n,2)-balanced Latin rectangles and n-Latin cubes. In Chapter 3 we study ...
  • Multiply perfect numbers of low abundancy

    Zhou, Qizhi (University of Waikato, 2010)
    The purpose of this thesis is to investigate the properties of multiperfect numbers with low abundancy, and to include the structure, bounds, and density of certain multiperfect numbers. As a significant result of this ...