Proof Pearl: Bounding Least Common Multiples with Triangles
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Automated Reasoning"
DOI: 10.1007/s10817-017-9438-0
Abstract: We present a proof of the fact that for $$n \ge 0$$n≥0. This result has a standard proof via an integral, but our proof is purely number-theoretic, requiring little more than inductions based on lists.… read more here.
Keywords: pearl bounding; bounding least; common multiples; proof ... See more keywords