Explore >> Select a destination
|
You are here 
|
ilaba.wordpress.com | ||
| | | | |
terrytao.wordpress.com
|
|
| | | | | Let $latex {G = (G,+)}&fg=000000$ be a finite additive group. A tiling pair is a pair of non-empty subsets $latex {A, B}&fg=000000$ such that every element of $latex {G}&fg=000000$ can | |
| | | | |
terrytao.wordpress.com
|
|
| | | | | One of the most notorious problems in elementary mathematics that remains unsolved is the Collatz conjecture, concerning the function $latex {f_0: {\bf N} \rightarrow {\bf N}}&fg=000000$ define... | |
| | | | |
awwalker.com
|
|
| | | | | Just how good are polynomials at producing primes? Do there exist polynomials that produce primes for arbitrarily many consecutive inputs? In this post, I'll give a brief overview of what we expect to be able to prove, and show how interpolating polynomials can produce record-breaking prime-generators. (And then break a record, because why not?) | |
| | | | |
yufeizhao.com
|
|
| | | How high can the second eigenvalue multiplicity of a connected bounded degree graph get? | ||
