Back to search

Institutional Repository of Vilnius University

Rekurentiniai sąryšiai ir jų taikymai /

Abstract

dc:description

Application of recurrence relations in mathematics and computer science is very widely used. To solve many task of combinatorics using recurrence relations, the task of n objects we can change with the task of the object (n - 1) and of this – task with object (n - 2) and etc. In turn reducing the number of the objects, finally we get the task that is not difficult to solve. When programming, always tries to split the task into more or less difficult to make a few simpler as well. For this purpose it is used to recursively functions. In generally, the application of recurrence relations to facilitate and simplify the combinatorics, discrete mathematics, probability theory, economic and other problems of solving.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2014

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Mažvylaitė, Sigita,
Contributors dc:contributor
  • Stankus, Eugenijus

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Mažvylaitė, Sigita,. Rekurentiniai sąryšiai ir jų taikymai /. Institutional Repository of Vilnius University, 2014. https://repository.vu.lt/VU:ELABAETD2156086&prefLang=en_US