/explore
|
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 |
|
| | | | | ||
| | | | |
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?) |
|
| | | | | ||
| | | | |
www.cambridge.org
Combinatorial and harmonic-analytic methods for integer tilings - Volume 10 |
|
| | | | | ||
| | | | |
thewayofthefly.wordpress.com
Visit the post for more. |
|
| | | |||
