Note: The versions of these papers that I have put here are preprints. They may differ from the final published version.
Accepted for Publication / In Print
 (With R. Auer) Studying baseball's wild-card team using probability Mathematics Teacher 107 (2013), No. 1, August 2013, 74-77. (This is a Microsoft Word document)
Abstract: Major League Baseball's decision more than a decade ago to add wild card teams to its playoff structure remains controversial even now. In this article, we attempt to support the notion that there should be wild card teams. To do this, we make a very simple probabalistic model of Major League Baseball's final regular-season standings. Then we use this model to predict how often the team that becomes the wild card will have a better record than the worst division-winning team, and calculate the expected rank in the league of the worst division winner. Perhaps surprisingly, our model predicts that the worst division winner should finish 7th or worse in the league more than 12% of the time.
Abstract: In this article, we treat sequences formed by the same procedure as the ones in the article "Weakly complete sequences formed by the greedy algorithm" below. We show that the patterns described in that abstract will always exist whenever 1 < d < n-7. This majority of this work was done by Alyson Fox while she was my student in the Hauber summer research program at Loyola.
Abstract: This article shows that a system of two homogeneous additive polynomials of degree 6 with integer coefficients will have a nontrivial p-adic solution for any prime p provided only that the system has a total of 73 variables.
Abstract: Suppose that k and n are odd integers. We show that any system of diagonal forms of degrees k and n, with integer coefficients, in at least k2+n2+1 variables has a nontrivial zero in the field Qp for each prime p.
Abstract: Consider a sequence defined recursively by the following procedure. Pick numbers n and d, and set a1=n and a2=n+d. Then for each k>2, set ak to be the smallest number greater than ak-1 which cannot be written as a sum of previous terms of the sequence. Experimentation shows that the terms of the sequence resulting from this procedure appear to have several very interesting patterns. We show that these patterns really exist in the cases where n=1, or where d=1, or where n=d. The majority of this work was done by Michael Paul while he was my student in the Hauber summer research program at Loyola.
Abstract: The function Gamma*(k) gives the smallest number of variables required to ensure that an additive form of degree k has a nontrivial solution in p-adic integers for every prime p. In this article, we evaluate Gamma*(k) exactly when k=14, 20, 24, 26, 27, 29 and 31. With these results, the exact value of Gamma*(k) is now known whenever k < 32.
Abstract: Suppose that a is a p-adic number. In this paper, we consider the problem of calculating the p-adic digits of the square root of a. We do this using two fixed-point methods with quadratic and cubic rates of convergence. For each method, we calculate the minimum number of correct digits obtained after n iterations, and the number of iterations required to obtain an approximation of any given accuracy.
Abstract: In this expository paper, we show how rootfinding methods from numerical analysis (Newton's method and the secant method) can be used to calculate inverses of numbers modulo powers of primes. In undergraduate courses, the fields of numerical analysis and number theory can appear to be unrelated, and we believe that students may enjoy seeing a connection between them.
Abstract: In this expository paper, we derive a formula for the sum of a series of sines or cosines, where the angles form an arithmetic progression. This derivation of the formula was originally given in the journal Arbelos, which is now sadly out of print. The derivation is interesting because it does not make any use of complex numbers.
Abstract: This paper is similar to  below, except that we are able to remove the restriction that the degrees of the forms must be all different. Given a system of diagonal forms over Qp, we ask how many variables are required to guarantee that the system has a nontrivial zero. We show that if the prime p satisfies p > (largest degree) - (smallest degree) + 1, then there is a bound on the sufficient number of variables which is a polynomial in the degrees of the forms. A result of Lewis & Montgomery implies that any bound which works for all primes must exhibit exponential growth. So this result can be thought of as bounding how small p can be before exponential growth is required.
Abstract: In 1966, Davenport & Lewis published their paper Notes on congruences III, in which they proved that under some mild conditions, a system of two additive forms must have a nonsingular simultaneous zero modulo any prime number. In their paper, they ask whether the theorem is true in general finite fields, and point out that one of their key lemmas is no longer true in this situation. In this paper we answer their question in the affirmative, proving that under the same conditions, a system of two additive forms over a finite field must have a nonsingular simultaneous zero. We then apply this result to obtain an upper bound on the number of variables required to ensure that a system of two additive forms of equal degrees has a nontrivial zero in a p-adic field.
Abstract: It is known that any system of diagonal forms has a nontrivial p-adic zero for all primes p provided that the number of variables is large enough in terms of the degrees. A result of Lewis & Montgomery shows that the required number of variables must exhibit exponential growth. However, a theorem of Ax & Kochen states that if p is large enough, then a bound which exhibits only polynomial growth suffices. The purpose of this paper is to bound the primes for which exponential growth is required in the situation where the degrees are all different. In particular, if the degrees of the forms are k1 > ... >kR and if p > k1-kR+1, then we give a bound for the required number of variables which has only polynomial growth. This bound is larger than the Ax-Kochen bound, but we note that it applies for primes which are smaller than the largest of the degrees.
Abstract: In this paper we develop a bound on the number of variables required to guarantee that two diagonal homogeneous polynomials of different degrees k and n with coefficients in Qp have a nontrivial simultaneous zero in p-adic integers. If k and n are large and close together, then this is the best known bound. We also prove a much stronger bound in the case when at least one of k and n is odd.
Abstract: A recent paper in Math Magazine gave a proof that there are exactly p2(p2+2p-1)/2 two-by-two matrices with entries in Z/pZ and both eigenvalues also in this field. The proof appeals to a theorem from abstract algebra in the key step. In this note, we give a simpler proof that does not require abstract algebra, using only concepts which could be taught in an undergraduate number theory course.
Abstract: It is known by work of Ax & Kochen that given any natural number d, any homogeneous polynomial of degree d in d2+1 variables with coefficients in Qp has a nontrivial zero provided that p is sufficiently large. In this paper, we give upper bounds on how large p needs to be when we have either d=7 or d=11.
Abstract: The main result of this paper is that any system of R diagonal (additive) homogeneous polynomials of degree k in at least 4R2k2 variables with coefficients in Qp has a nontrivial simultaneous zero in p-adic integers. This improves on work of Brudern & Godinho, and is the best known bound when k is even and suitably large in comparison to R. A version of this theorem is also developed for the situation in which Qp is replaced by a finite extension of Qp.
Abstract: In this expository paper, we introduce the reader to the analysis of musical chords using the additive group Z/12Z and the twelve-tone operators, which can be thought of as functions on Z/12Z.
Submitted / In Preparation
Abstract: This article studies one problem in the theory of graph pebbling and one problem in number theory, and shows a connection between them. The graph pebbling problem involves studying the directed cycle graph with d vertices, where all of the edges point counterclockwise. We study the minimum number of pebbles that can be put on the graph which ensures that at least one pebble can be moved at least n vertices away from its starting position by a sequence of pebbling moves. Our number theory problem is to calculate, given a degree d, the minimal number of variables required to ensure that any additive form of degree d has a nontrivial zero in the 2-adic integers. For both problems, we find the exact solution. Interestingly, these solutions are essentially the same!
 Forms in many variables over p-adic
fields. Ph.D. thesis, University of Michigan, 2000.
Abstract: This is my Ph.D. thesis. The content includes that of papers  and  above, and also some of . Additionally, we elaborate on work of Skinner to give a bound on the number of variables necessary to guarantee that there exists a nontrivial simultaneous zero of a system of R homogeneous additive polynomials of degree pt with coefficients in a finite extension of Qp. This bound does not depend on the degree of the field extension. There is also an introduction to the field of study of zeros of homogeneous equations over p-adic fields.