1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.NT2018★ 1 cited
Primary Pseudoperfect Numbers, Arithmetic Progressions, and the Erdős-Moser Equation
Jonathan Sondow, Kieren MacMillan
A primary pseudoperfect number (PPN) is an integer such that the reciprocals of and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and sin…
math.NT2010
Reducing the Erdos-Moser equation 1^n + 2^n + . . . + k^n = (k+1)^n modulo k and k^2
Jonathan Sondow, Kieren MacMillan
An open conjecture of Erdos and Moser is that the only solution of the Diophantine equation in the title is the trivial solution 1+2=3. Reducing the equation modulo k and k^2, we g…
math.NT2010
Proofs of power sum and binomial coefficient congruences via Pascal's identity
Kieren MacMillan, Jonathan Sondow
A frequently cited theorem says that for n > 0 and prime p, the sum of the first p n-th powers is congruent to -1 modulo p if p-1 divides n, and to 0 otherwise. We survey the main…