tag:blogger.com,1999:blog-3722233.post4786093465574505753..comments2021-12-01T13:41:42.544-06:00Comments on Computational Complexity: Learning from teaching a HS student Schur's theorem on changeLance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-3722233.post-60574375211644063022015-06-23T16:41:39.585-05:002015-06-23T16:41:39.585-05:00For #5, you might want to look at
https://en.wiki...For #5, you might want to look at<br /><br />https://en.wikipedia.org/wiki/Ehrhart_polynomial#Ehrhart_Quasi-Polynomials<br /><br />The polynomial property you state is another way of saying the number of ways to make change is the Ehrhart quasipolynomial of the polytope {a^Tx <= n} where a is the vector (a_1, a_2, .., a_L) of change denominations. Anonymoushttps://www.blogger.com/profile/02497628183841169470noreply@blogger.com