Timeline for Visually stunning math concepts which are easy to explain
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 13, 2019 at 23:30 | comment | added | Lucas Henrique | Fun fact: this was worked on MathCamp 2017 Quiz, question 2. | |
| Apr 8, 2017 at 21:07 | comment | added | Jean Marie | It is a finite version of the Sierpinski triangle. | |
| Feb 10, 2015 at 23:08 | comment | added | Coffee_Table | right, thanks. I edited your code to work for Python 3 and I realize now that I made a stupid error when doing so. | |
| Feb 10, 2015 at 22:40 | comment | added | Adrian Petrescu | @Coffee_Table: It's literally just the terminal. The code I pasted above write ANSI color codes to the terminal to produce the colored blocks you see above. | |
| Feb 10, 2015 at 21:24 | comment | added | Coffee_Table | What software do you use to see the output zoomed out like that? | |
| Jan 9, 2015 at 14:31 | comment | added | Michael Lugo | The basic idea is pretty simple: ${i \choose k} = {i \choose k-1} + {i-1 \choose k-1}$, and this recurrence holds $\mod p$ as well. | |
| Jan 9, 2015 at 14:17 | comment | added | Adrian Petrescu | @MichaelLugo I did not know that! Thank you for giving me something interesting to read up on :) | |
| Jan 9, 2015 at 14:11 | comment | added | Michael Lugo | I'd also note that it's possible to compute ${i \choose k} \mod p$ without computing $i \choose k$. For large $i$ this would matter. | |
| Jan 9, 2015 at 13:34 | history | edited | Adrian Petrescu | CC BY-SA 3.0 |
deleted 6 characters in body
|
| S Jan 8, 2015 at 21:59 | history | answered | Adrian Petrescu | CC BY-SA 3.0 | |
| S Jan 8, 2015 at 21:59 | history | made wiki | Post Made Community Wiki by Adrian Petrescu |