1 citations · 2 across the 16 of their papers we have counts for
17 papers · 1 filter
On the factorization of and a conjecture of C. Nicol
Michael Filaseta, Lilit Martirosyan, London Cameron Swan
For an arbitrary prime and arbitrary positive integers and with , we show that $x^{d_{r}} + x^{d_{r-1}} + \cdots + x^{d_{2}}…
On the irreducibility of the non-cyclotomic part of most 0,1-polynomials with few terms
Michael Filaseta, Alexandros Kalogirou
We provide an alternative exposition of a result due to Schinzel. Fix an integer . For almost all choices of positive integers , we show that the p…
On extreme values of in arithmetic progressions
Michael Filaseta, Jonah Klein, Cihan Sabuncu
For a given integer and any residue that can be written as a sum of 3 squares modulo , we show the existence of infinitely many integers s…
On the distance between factorials and repunits
Michael Filaseta, Florian Luca
We show that if , are integers, is prime and , then . Further results are obta…
Covering systems with the sum of the reciprocals of the moduli close to
Michael Filaseta, Alexandros Kalogirou
In 1952, H. Davenport posed the problem of determining a condition on the minimum modulus in a finite distinct covering system that would imply that the sum of the reciproc…
A generalization of a fourth irreducibility theorem of I. Schur
Martha Allen, Michael Filaseta
Let be the product of the odd positive integers . For an integer , define \[ f(x)=\sum_{j=0}^{n}a_j\frac{x^{2j}}{u_{2j+2}}, \] where the 's are arbit…