/explore
|
You are here 
|
www.jeremykun.com | ||
| | | | |
pfzhang.wordpress.com
Consider a monic polynomial with integer coefficients: $latex p(x)=x^d + a_1 x^{d-1} + \cdots + a_{d-1}x + a_d$, $latex a_j \in \mathbb{Z}$.The complex roots of such polynomials are called algebraic integers. For example, integers and the roots of integers are algebraic integers. Note that the Galois conjugates of an algebraic integer are also algebraic integers.... |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
thehousecarpenter.wordpress.com
NB: I've opted to just get straight to the point with this post rather than attempting to introduce the subject first, so it may be of little interest to readers who aren't already interested in proving the completeness theorem for propositional logic. A PDF version of this document is available here. The key thing I... |
|
| | | | | ||
| | | | |
uncommongenders.home.blog
There is lettragender! -Admin Opal |
|
| | | |||
