Loading [MathJax]/jax/output/HTML-CSS/config.js
Ask Your Question
0

Priklad z prijmacek na magistra

asked Jun 15 '15

anonymous user

Anonymous

updated Jun 20 '15

anonymous user

Anonymous

Zdravim, netusim, jak tohle spocitat (jak se dojde k vysledku?). Poradite prosim?

image description

add a comment

1 Answer

Sort by » oldest newest most voted
1

answered Jun 15 '15

OndraS gravatar image

updated Jun 15 '15

Princip inkluze a exkluze:
Vsech ctyrznakovych slov je 3^4.
Tech ktere vynechavaji A je 2^4.
Tech ktere vynechavaji B je 2^4.
Tech ktere vynechavaji A i B je 1^4.
Celkem 3^4 - 2 x 2^4+1^4=81-2*16+1=50.

link

Comments

Diky. Jde to take spocitat primo bez pouziti inkluze-exkluze (predpokladam, ze to bude slozitejsi)?

vilestra (Jun 16 '15)

No clovek by si mohl rozmyslet, kolik tam kterych pismen bude (asi 6 moznosti) a pak pro kazde takove urcene pocty spocitat, kolik je takovych kombinaci. Nevim, jestli je to primejsi, kazdopadne je to pracnejsi.
Nebo take clovek muze vypsat vsech 50 moznosti, to je hodne prime.
Co vlastne vadi na PIE?

OndraS (Jun 16 '15)

Ok, fine. Na PIE mi nevadi vubec nic, je to hezka metoda. Chtel jsem jen vedet, jak se to pocita opacnym zpusobem.

vilestra (Jun 16 '15)
add a comment

Your answer

Please start posting your answer anonymously - your answer will be saved within the current session and published after you log in or create a new account. Please try to give a substantial answer, for discussions, please use comments and please do remember to vote (after you log in)!

Add answer

[hide preview]

Question tools

Follow
1 follower

Stats

Asked: Jun 15 '15

Seen: 443 times

Last updated: Jun 15 '15