10 principais mathsisfun.com concorrentes

cuemath.com

Live, personalized online math classes for K to 12 students taught by expert tutors.

math.stackexchange.com

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

thirdspacelearning.com

Watch this free practical webinar from Educate Ventures Research and Third Space Learning on how to get started on your school's AI integration.

khanacademy.org

Learn for free about math, art, computer programming, economics, physics, chemistry, biology, medicine, finance, history, and more. Khan Academy is a nonprofit with the mission of providing a free, world-class education for anyone, anywhere.

math.libretexts.org

The LibreTexts libraries collectively are a multi-institutional collaborative venture to develop the next generation of open-access texts to improve postsecondary education.

tutorial.math.lamar.edu

welcome to my math notes site. contained in this site are the notes (free and downloadable) that i use to teach algebra, calculus (i, ii and iii) as well as differential equations at lamar university. the notes contain the usual topics that are taught in those courses as well as a few extra topics that i decided to include just because i wanted to. there are also a set of practice problems, with full solutions, to all of the classes except differential equations. in addition there is also a selection of cheat sheets available for download.

byjus.com

byju's comprehensive e-learning programs for k3, k10, k12, neet, jee, upsc & bank exams from india's best teachers. join today to fall in love with learning

mathnasium.com

looking for a math tutor, mathnasium provides a customized math learning program where math makes sense to kids. get an expert tutor now!

purplemath.com

Purplemath (PM) kinda happened by accident. Read here about PM's author, Elizabeth Stapel, and about Purplemath, including the origin of its name.

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...