Explore >> Select a destination
|
You are here 
|
xorshammer.com | ||
| | | | |
algorithmsoup.wordpress.com
|
|
| | | | | The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite... | |
| | | | |
quomodocumque.wordpress.com
|
|
| | | | | As the old joke goes, "Who's that guy next to Mazur?" Barry Mazur, my Ph.D. advisor, was awarded the National Medal of Science last week. It's hard to overstate the extent to which his work and his outlook have affected the direction of number theory. And of course my own way of doing math is... | |
| | | | |
rjlipton.com
|
|
| | | | | Can they inform computational complexity theory? Bill Gasarch and Christian Elsholtz both like primes and jokes and graphs and ways of sharing baked goods. Bill is a Professor of Computer Science at the University of Maryland; Elsholtz is an Associate Professor of Mathematics at T.U. Graz in Austria. They recently independently came up with a... | |
| | | | |
usethe.computer
|
|
| | | Today's POTD continues our theme of Computer Science Education Week. Yesterday we saw a paper (and retraction), and meditated on the topic of why it's so hard to teach programming. | ||
