/explore
|
You are here 
|
fabricebaudoin.blog | ||
| | | | |
xorshammer.com
|
|
| | | | | An arithmetic statement is one made up of quantifiers ``$latex \forall n\in\mathbb{N}$,'' ``$latex \exists n\in \mathbb{N}$,'' the logical connectives ``and,'' ``or,'' ``not'', function symbols $latex \times$, $latex +$, constants $latex {0}$, $latex 1$, and variables $latex n$ which are bound by the aforementioned quantifiers. It is known that there is no algorithm which will decide... | |
| | | | |
thatsmaths.com
|
|
| | | | | The numbers are usually studied in layers of increasing subtlety and intricacy. We start with the natural, or counting, numbers $latex {\mathbb{N} = \{ 1, 2, 3, \dots \}}&fg=000000$. Then come the whole numbers or integers, $latex {\mathbb{Z} = \{ \dots, -2, -1, 0, 1, 2, \dots \}}&fg=000000$. All the ratios of these (avoiding division... | |
| | | | |
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... | |
| | | | |
othmarstrombone.wordpress.com
|
|
| | | Reblogged on WordPress.com | ||
