Chebyshevskii Sbornik
 RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Chebyshevskii Sb.: Year: Volume: Issue: Page: Find

 Chebyshevskii Sb., 2018, Volume 19, Issue 2, Pages 432–446 (Mi cheb665)

User recursive functions in Maxima

A. R. Esayana, N. M. Dobrovolskyb

a Institute of Educational Development Strategy RAO
b Tula State Pedagogical University

Abstract: We consider the problem of dividing a rectangular parallelepiped on finite number of disjoint cubes for some greedy algorithms. The formulated problems are solved by a series of block-functions with direct and indirect (mutual) recursion, written in the programming language of the free Maxima software system. All constructed functions are checked by control calculations. Note that it is impossible to divide a rectangular parallelepiped into pairs of different cubes.
The programming language of system Maxima is used for the following reasons. Statements of the problems solved in this article are quite clear to both the student of secondary school and student of higher education institution. They are also familiar with recursion. So it is only a matter of choosing a programming language for the implementation of the proposed algorithms. And here the language of the Maxima system is quite appropriate. The fact is that in recent years, schools and universities for many reasons, from the many mathematical packages are forced to choose to use freely distributed software. The leaders among such packages are cross-platform Maxima and GeoGebra systems. Therefore, the talk about the features of creating user-defined recursive functions in the Maxima programming language is timely and useful.

Keywords: rectangular parallelepiped, cub, direct recursion, mutual recursion, free software, Maxima, GeoGebra.

 Funding Agency Grant Number Russian Academy of Sciences - Federal Agency for Scientific Organizations 27.6122.2017/Á×

DOI: https://doi.org/10.22405/2226-8383-2018-19-2-432-446

Full text: PDF file (360 kB)
References: PDF file   HTML file

UDC: 519.68:159.955
Accepted:17.08.2018

Citation: A. R. Esayan, N. M. Dobrovolsky, “User recursive functions in Maxima”, Chebyshevskii Sb., 19:2 (2018), 432–446

Citation in format AMSBIB
\Bibitem{EsaDob18} \by A.~R.~Esayan, N.~M.~Dobrovolsky \paper User recursive functions in Maxima \jour Chebyshevskii Sb. \yr 2018 \vol 19 \issue 2 \pages 432--446 \mathnet{http://mi.mathnet.ru/cheb665} \crossref{https://doi.org/10.22405/2226-8383-2018-19-2-432-446} \elib{https://elibrary.ru/item.asp?id=37112165}