|Course Title||Code||Semester||L+P Hour||Credits||ECTS|
|Finite Mathematics *||MT 352||6||2||2||4|
|Prerequisites and co-requisites|
|Recommended Optional Programme Components||None|
|Language of Instruction||Turkish|
|Course Level||First Cycle Programmes (Bachelor's Degree)|
|Course Coordinator||Assoc.Prof.Dr. Şehmus FINDIK|
To solve distribution problems by using the basic principles of counting.
Counting principles, Binomial coefficients, Cyclic permutations, Distrubution problems, Fibonachi numbers, Division algorithm, Prime numbers, the least common multiple and the greatest common divisor, surjective functions, Stirling numbers, Special functions, The pigeon hole principle, functional difficulty.
|Course's Contribution To Program|
|No||Program Learning Outcomes||Contribution|
Is able to prove Mathematical facts encountered in secondary school.
Recognizes the importance of basic notions in Algebra, Analysis and Topology
Develops maturity of mathematical reasoning and writes and develops mathematical proofs.
Is able to express basic theories of mathematics properly and correctly both written and verbally
Recognizes the relationship between different areas of Mathematics and ties between Mathematics and other disciplines.
Expresses clearly the relationship between objects while constructing a model
Draws mathematical models such as formulas, graphs and tables and explains them
Is able to mathematically reorganize, analyze and model problems encountered.
Knows at least one computer programming language
Uses effective scientific methods and appropriate technologies to solve problems
Has sufficient knowledge of foreign language to be able to understand Mathematical concepts and communicate with other mathematicians
In addition to professional skills, the student improves his/her skills in other areas of his/her choice such as in scientific, cultural, artistic and social fields
Knows programming techniques and is able to write a computer program
Is able to do mathematics both individually and in a group.
|1||Counting rules||Review of the relevant pages from sources|
|2||Binom coefficients||Review of the relevant pages from sources|
|3||Cyclic permutation||Review of the relevant pages from sources|
|4||Distrubution problems||Review of the relevant pages from sources|
|5||Fibonachi numbers||Review of the relevant pages from sources|
|6||Division algorithm||Review of the relevant pages from sources|
|7||Prime numbers||Review of the relevant pages from sources|
|8||Mid-term exam||Review of the topics discussed in the lecture notes and sources|
|9||The least common multiple and the greatest common divisor||Review of the relevant pages from sources|
|10||Surjective functions||Review of the relevant pages from sources|
|11||Stirling numbers||Review of the relevant pages from sources|
|12||Special functions||Review of the relevant pages from sources|
|13||The pigeon hole principle||Review of the relevant pages from sources|
|14||Functional difficulty||Review of the relevant pages from sources|
|15||General problem solving||Review of the relevant pages from sources|
|16-17||Final exam||Review of the topics discussed in the lecture notes and sources|
|Recommended or Required Reading|
|Textbook||1. Discrete and Combinatorial Mathematics an applied introduction, Ralph Grimaldi, Addison-Wesley Publishing Company,1994.|
2. Sonlu Matematik Olimpiyat Problemleri ve Çözümleri (Tübitak yayınları) Ünal Ufuktepe, Refail Alizade
3. Sayma, Ali Nesin