Simple ways to differentiate between permutations and combinations in Combinatorics. Eshbekova Gulxayo– Bachelor student of Tashkent State Pedagogical University named after Nizami



Yüklə 24,15 Kb.
səhifə1/3
tarix19.05.2023
ölçüsü24,15 Kb.
#117006
  1   2   3
G. Eshbekova 401-MO\'M, maqola


Simple ways to differentiate between permutations and combinations in Combinatorics.
Eshbekova Gulxayo– Bachelor student of Tashkent State Pedagogical University named after Nizami
Maqolada darslik va o’quv qo’llanmalarda ma’lumotlar kam uchraydigan hamda masalalar ishlashda qiyinchilik tug’diradigan o’rinlashtirishlar va guruhlashlarga doir masalalarni bir-biridan farqlashning sodda va oson yo’li keltirilgan.
Tayanch so’zlar: o’rinlashtirishlar, guruhlashlar, o’rin almashtirishlar, “hayoliy qator”.
The article provides a simple and easy way to differentiate between permutations and combinations, which are rare in textbooks and manuals and difficult to work with.
Key words: permutations, combinations, factorial, “imaginary row”.

Combinatorics is one of the branches of modern mathematics that is based on the integration of sciences and develops on the basis of real-life applications. The branch of mathematics that deals with the theory of finite sets is called combinatorics. Combinatorics deals with issues such as identifying all possible ways to place elements of a finite set or finding all ways to perform a particular action.


In other words, combinatorial problems are problems involving the formation of different groups (associations) from the elements of a finite set and the calculation of the number of all possible groups formed according to a rule.
Here are three basic types of combinations that can be used to solve combinatorics: permutations, factorial and combinations.

1. Permutations.
Given a finite set of different elements.
Definition. As permutations different elements taken elements at a time, all possible combinations containing elements derived from a given elements are said to differ from each other either in the order of the elements or in the composition of the elements.
The number of permutations from different elements taken without repetitions at a time is defined as and is given by the following formula:



Yüklə 24,15 Kb.

Dostları ilə paylaş:
  1   2   3




Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©azkurs.org 2024
rəhbərliyinə müraciət

gir | qeydiyyatdan keç
    Ana səhifə


yükləyin