planetmath.orgの競合サイトトップ10

math.stackexchange.com

Q&A for people studying math at any level and professionals in related fields

mathworld.wolfram.com

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i from x and distance j from y depends only on i, j, and the graph distance between x and y, independently of the choice of x and y. In particular, a distance-regular graph is a graph for which there exist integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G and distance i=d(x,y), there are exactly c_i...

mathoverflow.net

Q&A for professional mathematicians

math.net

math topics explained online in an easy to understand way, covering primary math, algebra, geometry, trigonometry, probability, statistics, and calculus for k-12 students, teachers, and parents.

intmath.com

SquareCirclez blog: posts tagged Interactive

freemathhelp.com

This is very interesting! This is why I am obsessed with infinity. It is so strange. Not that strange once you start working with formal definitions. I attached the graphs of the partial sums. In those graphs one can estimate where the limits of those partial sums are.