New Video

The greatest common divisor between two numbers is defined as the largest value that can divide both numbers. To compute the greatest common divisor there are many algorithms. One of the fastest is over 2 millennium old. It’s called Euclid’s algorithm. Here you will be able to learn more about this algorithm and how to…

Adjunt teniu els arxius que treballarem al taller. En aquest taller, utilitzarem els llenguatges de programació eSeeCode i Pyturtle per a treballar en reptes de matemàtiques concrets. Aquests casos reals que hem treballat amb alumnes ens permetran abordar els conceptes bàsics del pensament computacional i explorarem com, amb només unes poques instruccions, podem realitzar grans…

C2EM: 2n Congrés per l’Ensenyament de la Matemàtica with the following article and conference.

We will be at the IOI conferences in Russia to present eSeeCode to the international community. Make sure to read the English article!

  Fibonacci spiral ‌ Recursive function A recursive function is a function that calls itself. We already saw an example of recursive program when we did the Greatest common divisor algorithm. Another typical example is the factorial of a number. The factorial of a number n is the product of 1*2..(n-1)*n. And it is written…