Geodesic
User recursive functions in Maxima
Čebyševskij sbornik, Tome 19 (2018) no. 2, pp. 432-446.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{CHEB_2018_19_2_a30,
     author = {A. R. Esayan and N. M. Dobrovolsky},
     title = {User recursive functions in {Maxima}},
     journal = {\v{C}eby\v{s}evskij sbornik},
     pages = {432--446},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/CHEB_2018_19_2_a30/}
}
TY  - JOUR
AU  - A. R. Esayan
AU  - N. M. Dobrovolsky
TI  - User recursive functions in Maxima
JO  - Čebyševskij sbornik
PY  - 2018
SP  - 432
EP  - 446
VL  - 19
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CHEB_2018_19_2_a30/
LA  - ru
ID  - CHEB_2018_19_2_a30
ER  - 
%0 Journal Article
%A A. R. Esayan
%A N. M. Dobrovolsky
%T User recursive functions in Maxima
%J Čebyševskij sbornik
%D 2018
%P 432-446
%V 19
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CHEB_2018_19_2_a30/
%G ru
%F CHEB_2018_19_2_a30
A. R. Esayan; N. M. Dobrovolsky. User recursive functions in Maxima. Čebyševskij sbornik, Tome 19 (2018) no. 2, pp. 432-446. http://geodesic.mathdoc.fr/item/CHEB_2018_19_2_a30/

[1] M. Gardner, Matematicheskie golovolomki i razvlecheniya, Per. s anglijskogo Yu. Danilova, Izd. «Oniks», M., 1994

[2] A. R. Esayan, “Veroyatnostnaya rekursiya”, Izv. TulGU. Ser. “Matematika. Mexanika. Informatika”, 6:3 (2000), 56–61 | MR

[3] A. R. Esayan, Obuchenie algoritmizacii na osnove rekursii, Ucheb. posobie dlya studentov ped. vuzov, Izd-vo TGPU im. L. N. Tolstogo, Tula, 2001, 215 pp.

[4] A. R. Esayan, “Rekursiya kak obshheobrazovatel`naya cennost”, Obrazovanie kak cennost`, Sb. nauch. tr. aspirantov i doktorantov, Izd-vo TGPU im. L. N. Tolstogo, Tula, 1998, 21–35

[5] A. R. Esayan, V. N. Chubarikov, N. M. Dobrovol'skij, A. B. Yakushin, Maxima. Dannye i grafika, Izd-vo Tul. gos. ped. un-ta, Tula, 2011, 367 pp.

[6] A. R. Esayan, V. N. Chubarikov, N. M. Dobrovol'skij, A. B. Yakushin, Programmirovanie v Maxima, Izd-vo Tul. gos. ped. un-ta, Tula, 2012, 351 pp.

[7] L. Kurlyandchik, G. Rozenblyum, Metod beskonechnogo spuska | Zbl

[8] Russian Math. (Iz. VUZ), 45:10 (2001), 65–68 | MR | Zbl

[9] R. L. Brooks, C. A. B. Smith, A. H. Stone, W. T. Tulle, “The Dissection of Rectangles into Squares”, Duke Mathematical Journal, 7 (1940), 312–340 | DOI | MR

[10] A. J. W. Duijvestijn, Simple perfect square of lowest order, Universität Twente, 1978 | MR

[11] https://ru.wikipedia.org/wiki/ZHadnyj_algoritm

[12] https://ru.wikipedia.org/wiki/Svobodnoe_programmnoe_obespechenie

[13] Maxima Manual. Version 5.41.0, 2018 http://maxima.sourceforge.net/

[14] D. A. Wolfram, “Solving Generalized Fibonacci Recurrences”, Fib. Quart., 36:2 (1998) | MR | Zbl