Articles, Blog , , , , , , , , , , , , , , , 9 Comments

Hello and welcome to Maths with Jay. Now, we’ve already seen by using Euclid’s algorithm that we can find the highest common factor of 39 and 15. So remember that we found that it was the last remainder in this process here; so here the highest common factor was three. What we’re going to do

Read More

Articles, Blog , , , , , , , , , , , , , , , , 4 Comments

Hello and welcome to Maths with Jay Now we’ve already seen a way of finding the highest common factor of 15 and 39 and here we’re going to use the same method but we’ll see that we don’t actually have to draw the rectangle and all the squares within it. We start off by dividing

Read More

Articles , , , , , , , , , , , , , , , , 49 Comments

we're gonna start this video off with a puzzle for those who don't know this is a numeric 8 puzzle it scrambles the tiles and you have to move everything one tile at a time until you have a back in numerical order the question for us is if you were to switch these last

Read More