La volta al món

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…

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…

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

Benvinguts al taller de robòtica! Fent un quadrat Clicant en aquest enllaç podreu accedir a la plataforma de programació eSeeCode . =0){divElement.className=divElement.className.replace(‘glyphicon-minus’,’glyphicon-plus’);}else{divElement.className=divElement.className.replace(‘glyphicon-plus’,’glyphicon-minus’);}”> Utilitzant bucles Podem simplificar el codi anterior utilitzant un bucle. Els bucles poden ser amb comptadors (per repetir un nombre de cops) o amb condicions (mentre es compleixi una condició). Els primers són…

  ‌Finding Pi Every year during the 14th of March we celebrate Pi day. This is due to the fact that Pi is close to 3.14, but what is it’s true value and how can we compute it? In this article you’ll learn two ways of approximating this number! Pi is an irrational number used…