Finding the Greatest Common Divisor of Two Numbers by Factoring

dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorNochella, Jesse
dc.date2016-10-26T17:48:56Z
dc.date2016-10-26T17:48:56Z
dc.date.accessioned2017-04-06T11:41:48Z
dc.date.available2017-04-06T11:41:48Z
dc.identifierhttp://acervodigital.unesp.br/handle/unesp/361298
dc.identifierhttp://objetoseducacionais2.mec.gov.br/handle/mec/9082
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/957580
dc.descriptionYou can find the greatest common divisor (GCD) of two numbers by multiplying together all the prime factors they have in common
dc.descriptionComponente Curricular::Ensino Fundamental::Séries Finais::Matemática
dc.relationFindingTheGreatestCommonDivisorOfTwoNumbersByFactoring.nbp
dc.rightsDemonstration freeware using Mathematica Player
dc.subjectGCD
dc.subjectEducação Básica::Ensino Fundamental Final::Matemática::Números e operações
dc.titleFinding the Greatest Common Divisor of Two Numbers by Factoring
dc.typeOtro


Este ítem pertenece a la siguiente institución