You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/unesp/360512
Title: 
Extended euclidean algorithm
Author(s): 
Language: 
eng
Description: 
  • none
  • The greatest common divisor of two integers a and b can be found by the Euclidean algorithm by successive repeated application of the division algorithm. The extended Euclidean algorithm not only computes gcd(a,b) but also returns the numbers s and t such that gcd(a,b)=as+bt
  • Componente Curricular::Ensino Fundamental::Séries Finais::Matemática
Issue Date: 
  • 7-Sep-2008
  • 7-Sep-2008
  • 2008
  • 7-Sep-2008
  • 6-Sep-2008
Keywords: 
  • Algorithm
  • Euclid's element
  • Greek mathematics
  • Algoritmo de Euclides
  • Educação Básica::Ensino Fundamental Final::Matemática::Aritmética
Notes: 
Show the extended 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/5046
URI: 
http://acervodigital.unesp.br/handle/unesp/360512
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.