In their recent claimed computer-free proof of the Four Color Theorem, David Jackson and Bruce Richmond attempted to use sophisticated "asymptotic analysis" to explicitly compute a certain number whose positivity (according to them) implies this famous theorem. While the jury is still out whether their valiant attempt holds water, we prove, in this modest note, that this constant equals exactly 10/27. We also point out that their evaluation of this constant must be erroneous, for two good reasons. Finally, as an encore, we state many similar, but more complicated, results.
Comment: 4 pages. Accompanied by a Maple package and output files gotten from https://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/4ctJR.html