Timeline for Identity involving Stirling number of the second kind
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 20, 2023 at 10:24 | vote | accept | Tim Seppelt | ||
| Jan 20, 2023 at 7:57 | history | edited | Tim Seppelt | CC BY-SA 4.0 |
added 16 characters in body
|
| Jan 19, 2023 at 17:50 | comment | added | darij grinberg | This is Problem 3.13 (c) in Ioan Tomescu, Problems in Combinatorics and Graph Theory, Wiley 1985. | |
| Jan 19, 2023 at 17:49 | comment | added | darij grinberg | You want to require $n \geq 2$. | |
| Jan 19, 2023 at 17:46 | answer | added | Iosif Pinelis | timeline score: 5 | |
| Jan 19, 2023 at 17:27 | history | edited | Martin Sleziak |
edited tags
|
|
| Jan 19, 2023 at 17:26 | history | edited | YCor | CC BY-SA 4.0 |
removed capitals, added tag
|
| Jan 19, 2023 at 16:50 | comment | added | Carlo Beenakker | I would think that MO or MSE are "citable references". There are many, many proofs: math.stackexchange.com/q/1279874/87355 and math.stackexchange.com/questions/395139/… and math.stackexchange.com/q/1125097/87355 and math.stackexchange.com/q/3255200/87355 | |
| S Jan 19, 2023 at 16:33 | review | First questions | |||
| Jan 19, 2023 at 16:56 | |||||
| S Jan 19, 2023 at 16:33 | history | asked | Tim Seppelt | CC BY-SA 4.0 |