TO TEACH COMBINATORICS, USING SELECTED PROBLEMS

TO TEACH COMBINATORICS, USING SELECTED PROBLEMS

In 1972, professor Grigore Moisil, the most famous Romanian academician for Mathematics, said about Combinatorics, that it is “an opportunity of a renewed gladness”, because “each problem in the domain asks for its solving, an expenditure without any economy of the human intelligence”. More, the res...

Full description

Bibliographic Details
Main Author: Modan, Laurentiu
Other Authors: HTW Dresden, Informatik, Mathematik
Format: Others
Language:English
Published: Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden 2012
Subjects:
Arrangement
Mächtigkeit
Kombinatorik
Zählprinzip
Ziffer
Anzahl der Funktionen
Permutationen
arrangement
cardinal
combinatorics
combination
counting principle
digit
number of the functions
permutation
ddc:510
rvk:SD 2009
Online Access:http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-80681
http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-80681
http://www.qucosa.de/fileadmin/data/qucosa/documents/8068/Proceedings-636pages-Dresden2009_420-422.pdf
Description
Summary:In 1972, professor Grigore Moisil, the most famous Romanian academician for Mathematics, said about Combinatorics, that it is “an opportunity of a renewed gladness”, because “each problem in the domain asks for its solving, an expenditure without any economy of the human intelligence”. More, the research methods, used in Combinatorics, are different from a problem to the other! This is the explanation for the existence of my actual paper, in which I propose to teach Combinatorics, using selected problems. MS classification: 05A05, 97D50.

Similar Items