Integer Partitions (Discrete Maths)

preview_player
Показать описание
This video uses Euler's Theorem to explain how the sum of partitions of unique integers is equal to the sum of partitions of odd integers with repeats allowed.
Рекомендации по теме
Комментарии
Автор

Liked because of the lego demonstration. You, sir, are a legend.

Avighna
Автор

How did you do the lego demonstration? That is so cool!

ZenithCreationsYt
Автор

thanks great video :) there are 7 unique partitions for integer 9 and 26 unique partitions for integer 15 and 487067745 unique partitions for integer 200

nurinwonderland
Автор

So, partition of a number > partition of number into r parts so that r< number. Both are different things. The recognised generating function can give us only partition number not partition of number into r parts.

syedmdabid
Автор

Sir! In how many ways can we make division integer 20 into 15 partition(15 division) ?

syedmdabid
Автор

Would you dare in how many ways the positive integer 100 can be partitioned into 4 parts? ( 2 min.)

syedmdabid
Автор

In how many ways can we partition 100 into 4 parts? (2 min. by super tricks.)

syedmdabid