You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/unesp/360500
Title: 
The euclidean algorithm
Author(s): 
Language: 
eng
Description: 
  • none
  • A graphical interpretation of Euclid's algorithm for calculating the greatest common divisor of two numbers: Given numbers x and y draw a rectangle with width x and height y. If this rectangle is divided into squares as shown in the Demonstration, then the width of the smallest square (shown in red) is the greatest common divisor of x and y
  • Componente Curricular::Ensino Fundamental::Séries Finais::Matemática
Issue Date: 
  • 6-Sep-2008
  • 6-Sep-2008
  • 2008
  • 6-Sep-2008
  • 5-Sep-2008
Keywords: 
  • Algorithm
  • Euclid's element
  • Greek mathematics
  • Algoritmo de Euclides
  • Educação Básica::Ensino Fundamental Final::Matemática::Grandezas e medidas
Notes: 
Show the euclidean algorithm
Credits: 
This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
Source: 
http://objetoseducacionais2.mec.gov.br/handle/mec/5015
URI: 
http://acervodigital.unesp.br/handle/unesp/360500
Rights: 
Demonstration freeware using Mathematica Player
Type: 
outro
Appears in Collections:MEC - Objetos Educacionais (BIOE) - OE

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.