• Publications
• Influence
Extensions of the Gauss-Wilson theorem
• Mathematics
• 2008
A theorem of Gauss extending Wilson’s theorem states the congruence (n − 1)n! ≡ −1 (mod n) whenever n has a primitive root, and ≡ 1 (mod n) otherwise, where Nn! denotes the product of all integers upExpand
• 13
• 1
• PDF
Sums of reciprocals modulo composite integers
• Mathematics
• 1 November 2013
In 1938, as part of a wider study, Emma Lehmer derived a set of four related congruences for certain sums of reciprocals over various ranges, modulo squares of odd primes. These were recentlyExpand
• 5
• 1
• PDF
A role for generalized Fermat numbers
• Mathematics, Computer Science
• Math. Comput.
• 26 April 2016
We study particular aspects of the Gauss factorials bn−1 M cn! for M = 3 and 6, where the case of n having exactly one prime factor of the form p ≡ 1 (mod 6) is of particular interest. Expand
• 2
• 1
• PDF
An Introduction to Gauss Factorials
• Mathematics, Computer Science
• Am. Math. Mon.
• 1 November 2011
We present results on Gauss factorials , and more generally on partial products obtained when the product (n - 1)n! is divided into M equal parts, for integers M ≥ 2. Expand
• 12
The Multiplicative Orders of Certain Gauss Factorials
• Mathematics
• 21 November 2011
A theorem of Gauss extending Wilson's theorem states the congruence (n - 1)n! ≡ -1 (mod n) whenever n has a primitive root, and ≡ 1 (mod n) otherwise, where Nn! denotes the product of all integers upExpand
• 8
• PDF
Number Theory and Cryptography (using Maple)
In this paper I outline some basic number theoretical topics related to cryptography, based on my experience as a teacher of those topics. Expand
• 5
The multiplicative orders of certain Gauss factorials, II
• Mathematics
• 1 March 2016
2. There are numerous items that can be studied in number theory, and as mentioned above the authors have not made a sufficient case for another 20 page paper by themselves in this field. Looking atExpand
• 5
The Gauss–Wilson theorem for quarter-intervals
• Mathematics
• 1 February 2014
We define a Gauss factorial Nn! to be the product of all positive integers up to N that are relatively prime to n. It is the purpose of this paper to study the multiplicative orders of the GaussExpand
• 5
• PDF
Gauss Factorials , Jacobi Primes , and Generalized Fermat Numbers
Given positive integers N andn, we define the Gauss factorial Nn! as the product of all positive integers from 1 to N and coprime to n. In this expository paper we begin with the classical theorem ofExpand
• 1
• PDF