Explore >> Select a destination
|
You are here 
|
www.johndcook.com | ||
| | | | |
www.mscroggs.co.uk
|
|
| | | | | I am Matthew Scroggs. I like maths. On this website, you can find my blog and a collection of Sunday afternoon maths puzzles. | |
| | | | |
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 | |
| | | | |
gilkalai.wordpress.com
|
|
| | | | | A geometric graph is a set of points in the plane (vertices) and a set of line segments between certain pairs of points (edges). A geometric graph is simple if the intersection of two edges is empty or a vertex of both. A geometric graph is convex if the vertices are in convex position. A... | |
| | | | |
blairfix.github.io
|
|
| | | 12 Accumulation and sabotage | CAPITAL AS POWER | ||
