Delannoy number carpet

dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorSchreiber, Michael
dc.date2016-10-26T17:50:36Z
dc.date2016-10-26T17:50:36Z
dc.date.accessioned2017-04-06T11:48:51Z
dc.date.available2017-04-06T11:48:51Z
dc.identifierhttp://acervodigital.unesp.br/handle/unesp/362158
dc.identifierhttp://objetoseducacionais2.mec.gov.br/handle/mec/9186
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/958440
dc.descriptionKnowledge about combinatorics, fractals, generation of form, graph theory, nested patterns, recursion, representations of numbers, short programs and tiling
dc.descriptionThe Delannoy number D(x, y) gives the number of ways to reach point {x, y} (with non-negative integer coordinates) from the origin using only certain moves. They may be either up {0, 1}, to the right {1, 0} or one step along the diagonal {1, 1}. Plots of D (x, y) mod n show nested fractal patterns
dc.descriptionComponente Curricular::Ensino Médio::Matemática
dc.publisherWolfram Demonstrations Project
dc.relation255DelannoyNumberCarpet.nbp
dc.rightsDemonstration freeware using Mathematica Player
dc.subjectCombinatorics
dc.subjectFractals
dc.subjectGeneration of Form
dc.subjectGraph Theory
dc.subjectNested Patterns
dc.subjectRecursion
dc.subjectRepresentations of Numbers
dc.subjectShort Programs
dc.subjectTiling
dc.subjectEducação Básica::Ensino Médio::Matemática::Tecnologia para a matemática
dc.titleDelannoy number carpet
dc.typeOtro


Este ítem pertenece a la siguiente institución