- (x)+O\left(x\exp \left(-0.2098(\log x)^{3/5}(\log \log x)^{-1/5}\right)\right).}
Mossinghoff and
Trudgian proved an
explicit upper bound for the
difference between...
-
Generalized Schaefli symbols,
Types of
symmetry of a
polygon pp. 275-278)
Mossinghoff,
Michael J. (2006), "A $1 problem" (PDF),
American Mathematical Monthly...
-
proposed in “Crux Mathematicorum”, [1], p.184,#286.3. Hare,
Kevin G.;
Mossinghoff,
Michael J. (2019), "Most
Reinhardt polygons are sporadic", Geometriae...
- and
Efficiency (GIVE)". FDA.
October 4, 2007.
Retrieved 2008-06-15.
Mossinghoff GJ (1999). "Overview of the Hatch-Waxman Act and its
impact on the drug...
- Theory.
Cambridge University Press. Harris, John M.; Hirst,
Jeffry L.;
Mossinghoff,
Michael J. (2008),
Combinatorics and
Graph Theory,
Undergraduate Texts...
- 197–204. doi:10.1145/258726.258783. Harris, John; Hirst,
Jeffry L.;
Mossinghoff,
Michael (2008).
Combinatorics and
Graph Theory. Springer. pp. 185–189...
-
disproved the
closely related Pólya conjecture), and Borwein,
Ferguson &
Mossinghoff (2008)
showed that the
smallest such x is 72185376951205.
Spira (1968)...
-
Academic Press, p. 889, ISBN 9780080477343. Harris, John; Hirst,
Jeffry L.;
Mossinghoff,
Michael (2009),
Combinatorics and
Graph Theory,
Undergraduate Texts...
- (3): 823–829, doi:10.2140/pjm.1960.10.823, MR 0113176 Hare,
Kevin G.;
Mossinghoff,
Michael J. (2019), "Most
Reinhardt polygons are sporadic", Geometriae...
-
University Press. p. 101. ISBN 0-521-55821-2. MR 1694364. Harris; Hirst;
Mossinghoff (2008).
Combinatorics and
Graph Theory. Springer. ch. 2. ISBN 978-0-387-79710-6...
