Timeline for Why does undergraduate discrete math require calculus?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 12, 2011 at 17:47 | history | made wiki | Post Made Community Wiki by S. Carnahan♦ | ||
| Jun 8, 2010 at 13:58 | comment | added | darij grinberg | It would be a term with a case distinction, so I prefer not to, but I just want to say that the integral formula is not necessarily the most natural way to write it down... | |
| Jun 5, 2010 at 16:39 | comment | added | Andrey Rekalo | Well, the lattice points can be counted using a generating function. But I don't know how to write the answer in a compact and elementary form. I'd appreciate if you give any details of what you have in mind. | |
| Jun 5, 2010 at 16:20 | comment | added | darij grinberg | Uhm... isn't your example rather a property of this integral than a formula for the number of lattice points? I mean, the number of all integer lattice points satisfying -n <= x,y,z <= n and -s <= x+y+z <= s can be easily computed using high school methods and a bit of case distinction... | |
| Jun 4, 2010 at 19:38 | comment | added | Andrey Rekalo | Why not? This is a problem from Chapter 1 of the Pólya-Szegö problems' book. I learned it myself in an undergrad course. | |
| Jun 4, 2010 at 19:16 | comment | added | DoubleJay | Well that's not the sort of discrete math problem you're taught in an intro class | |
| Jun 4, 2010 at 19:11 | history | answered | Andrey Rekalo | CC BY-SA 2.5 |