/explore
|
You are here 
|
thatsmaths.com | ||
| | | | |
blog.georgeshakan.com
I recently uploaded "On the largest sum-free subset problem in the integers," to the arXiv. Let $latex A \subset \mathbb{Z}$ be a finite subset of the integers. We say $latex A$ is sum-free if there are no solutions to $latex a + b = c,$ with $latex a,b,c \in A$. We define $latex S(A)$ to... |
|
| | | | | ||
| | | | |
dominiczypen.wordpress.com
Let $latex \omega$ denote the first infinite cardinal - that is, the set of non-negative integers. Let $latex p_0 = 2$ be the smallest prime number, and let $latex (p_n)_{n\in\omega}$ enumerate all prime numbers in ascending order. Let $latex \mathcal{U}$ be a free ultrafilter on $latex \omega$. We consider the field $latex F = \big(\prod_{n\in\omega}\mathbb{Z}/p_n\mathbb{Z}\big)/{\mathcal... |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
nelkumi.wordpress.com
Do you need a break? From what? Do you need a break? Yes. From what? Everything and everyone. |
|
| | | |||
