Proof by induction

dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorPegg Jr, Ed
dc.date2016-10-26T17:49:51Z
dc.date2016-10-26T17:49:51Z
dc.date.accessioned2017-04-06T11:45:38Z
dc.date.available2017-04-06T11:45:38Z
dc.identifierhttp://acervodigital.unesp.br/handle/unesp/361771
dc.identifierhttp://objetoseducacionais2.mec.gov.br/handle/mec/6487
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/958053
dc.descriptionAn induction proof of a formula consists of three parts:a) Show the formula is true for n=1; b) Assume the formula is true for n;c) Using b), show the formula is true for n+1.For c), the usual strategy for a summation a1+a2+a3+...+an=f(n) is to manipulate f(n)+a(n+1) into the form f(n+1).Induction is a method for checking a result; discovering the result may be hard
dc.descriptionComponente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
dc.publisherWolfram Demonstration Project
dc.relationProofByInduction.nbp
dc.rightsDemonstration freeware using Mathematica Player
dc.subjectInduction
dc.subjectEducação Superior::Ciências Exatas e da Terra::Matemática::Teoria dos Números
dc.titleProof by induction
dc.typeOtro


Este ítem pertenece a la siguiente institución