Similar Posts
GCD2
ByjvilellaThe 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…
VIII Jornades Programa, Cornellà
Byjvilella8th edition of the Jornada Programa at Citilab Cornellà with this poster!
Taller Jornades de Pensament Computacional a l’educació matemàtica
ByjvilellaAdjunt 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…
Merry Everything from eSeeCode
ByjvilellaWe are getting close to the end of the year and we want to wish you happy holidays! To do so we have created this cute gif, and we will explain how we did it step by step. Koch Snowflake Open it in eSeeCode! =0){divElement.className=divElement.className.replace(‘glyphicon-minus’,’glyphicon-plus’);}else{divElement.className=divElement.className.replace(‘glyphicon-plus’,’glyphicon-minus’);}”> Step 1: Build Koch fractal As it can be read…