|
|
Combinatorics in didactic games at primary school
Majorová, Jana
The graduation thesis deals with problematics of combinatorics at primary school. It is focused on creation of a set of didactic games, which develope logical-combinatorial thinking and are based on pupils' own cognitive activity and on their active participation in teaching. These didactic games are implemented in teaching mathematics at primary school within an experimental survey and their effectiveness is evaluated based on test application detailed case studies of selected pupils and a questionnaire survey. Key words: didactic game, combinatorics, combinatorial and logical thought, effective and interesting mathematics, a pupil of primary school
|
|
|
Combinatorial sequences and divisibility
Michalik, Jindřich ; Slavík, Antonín (advisor)
This work contains an overview of the results concerning number-theoretic pro- perties of some significant combinatorial sequences such as factorials, binomial coef- ficients, Fibonacci and Catalan numbers. These properties include parity, primality, prime power divisibility, coprimality etc. A substantial part of the text should be accessible to gifted high school students, the results are illustrated with examples. 1
|
|
|
Computational complexity of combinatorial problems in specific graph classes
Masařík, Tomáš ; Fiala, Jiří (advisor)
The topic of this diploma thesis is the edge distance labeling problem with specified parametres p, q and λ. We found a dychotomy for p = 2 and q = 1. So the problem is polynomial if λ ≤ 4 and it is NP-complete for λ > 4. The boundary is shifted by one prior to the vertex distance labeling problem, which has already been solved. Polynomial cases are characterized as some special paths and cycles with a few additional vertices. To show NP-completeness we use a well-known NP-complete problem of Monotone not all equal 3-SAT. That section has four parts: One for odd λ, one for even λ and two more reductions for λ = 5 and λ = 6. 1
|
|
|
Combinatorics in didactic games at primary school
Majorová, Jana
The graduation thesis deals with problematics of combinatorics at primary school. It is focused on creation of a set of didactic games, which develope logical-combinatorial thinking and are based on pupils' own cognitive activity and on their active participation in teaching. These didactic games are implemented in teaching mathematics at primary school within an experimental survey and their effectiveness is evaluated based on test application detailed case studies of selected pupils and a questionnaire survey. Key words: didactic game, combinatorics, combinatorial and logical thought, effective and interesting mathematics, a pupil of primary school
|
|
|
Minimal coverings of pairs by triples
Hladíková, Veronika ; Krump, Lukáš (advisor) ; Kazda, Alexandr (referee)
In this thesis we deal with solving a combinatorics problem of finding the minimal covering of pairs by triples for a fixed finite set. We will show what is the minimal size of these coverings and more ways how to construct them. Second part of the thesis is a description of the attached program, which generates a minimal covering for a given set. 1
|
|
|
Analysis of solving processes of combinatorial problems at primary school (grade 1 - 3)
Tomešová, Lenka ; Slezáková, Jana (advisor) ; Jirotková, Darina (referee)
This diploma thesis deals with combinatorics in primary school teaching methods. The theoretical part is focused on characterisation of mathematical field of combinatorics, briefly describes it's historical evolution and basic types of combinatorial problems. This theoretical knowledge is further supplemented by an analysis of utilization rate of combinatorics in curiculative documents, selected textbooks and mathematical contests for primary school pupils. An essential part of the theoretical part of the work are chapters dealing with solving combinatorial problems. The practical part is based on research of solving combinatorial proceses on tasks for primary school pupils. KEYWORDS Combinatorics, combinatorial problem, typology of combinatorial problems, primary school pupil, solving peoceses, analysis of pupils'solving processes, number of solutions
|
|
|
Combinatorial sequences and divisibility
Michalik, Jindřich ; Slavík, Antonín (advisor)
This work contains an overview of the results concerning number-theoretic pro- perties of some significant combinatorial sequences such as factorials, binomial coef- ficients, Fibonacci and Catalan numbers. These properties include parity, primality, prime power divisibility, coprimality etc. A substantial part of the text should be accessible to gifted high school students, the results are illustrated with examples. 1
|
|
|
Practical didactic tests for preparation for the math matriculation examination
PIVOŇKA, Jiří
This bachelor thesis deals with the practical didactic tests for the math matriculation examination. It is divided into two parts. The first part is divided into 7 chapters. Each chapter deals with a specific thematic subjects for the math matriculation examination. The second part includes 3 didactic tests. For each didactic test is assigned solution. The aim of this bachelor thesis is to help students perform math matriculation examination.
|
|
|
Combinatorial sequences and divisibility
Michalik, Jindřich ; Slavík, Antonín (advisor) ; Staněk, Jakub (referee)
This work contains an overview of the results concerning number-theoretic pro- perties of some significant combinatorial sequences such as factorials, binomial coef- ficients, Fibonacci and Catalan numbers. These properties include parity, primality, prime power divisibility, coprimality etc. A substantial part of the text should be accessible to gifted high school students, the results are illustrated with examples. 1
|
|
|
Combinatorics of filters on the natural numbers
Chládek, Alexandr ; Verner, Jonathan (advisor) ; Grebík, Jan (referee)
The work is intended to combinatorial properties of filters on natural numbers as an introduction and motivation to the problematics between definability of the filters and its combinatorics. Basic filter types: P-filter, Q-filter, Rapid filter; orders: Rudin-Kiesler, Rudin-Blass, Katětov and Tukey; filter kon- structions; basic definitions related to combinatorics on ω; introduction to basic descriptive set theory and topology and some specific results. 1
|
guest ::
