Ambiente visual para el aprendizaje de los conceptos básicos asociados a la recurrencia
Mathematical recurrence explains a process based on its definition, size (N) and initial conditions, this can be subdivided into parts that meet a relationship that exists between the successive terms forming a recursive sequence {a0, a1, a2, ..., an} , in which the term is expressed in terms of one...
- Autores:
-
García Guio, Hector Santiago
Peña Caceres, Daniel Fernando
Molina Leiva, Juan Pablo
- Tipo de recurso:
- Trabajo de grado de pregrado
- Fecha de publicación:
- 2015
- Institución:
- Escuela Colombiana de Ingeniería Julio Garavito
- Repositorio:
- Repositorio Institucional ECI
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.escuelaing.edu.co:001/218
- Acceso en línea:
- http://catalogo.escuelaing.edu.co/cgi-bin/koha/opac-detail.pl?biblionumber=17657
https://repositorio.escuelaing.edu.co/handle/001/218
- Palabra clave:
- Software
Educación
Education
- Rights
- openAccess
- License
- Derechos Reservados - Escuela Colombiana de Ingeniería Julio Garavito
| Summary: | Mathematical recurrence explains a process based on its definition, size (N) and initial conditions, this can be subdivided into parts that meet a relationship that exists between the successive terms forming a recursive sequence {a0, a1, a2, ..., an} , in which the term is expressed in terms of one or more of its previous terms {a0, a1, a2, ..., an-1}, taking into account a series of initial conditions that must be presented explicitly constituting the base cases for the recurrence equation, which explicitly expresses the value of the term an. |
|---|