-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Scheda 1] Esercizio 5 #5
Comments
matypist
added
da risolvere
Nessuna possibile soluzione pubblicata finora
scheda 1
labels
Oct 23, 2022
This comment was marked as outdated.
This comment was marked as outdated.
i0nut02
added
da revisionare
Almeno una possibile soluzione pubblicata
and removed
da risolvere
Nessuna possibile soluzione pubblicata finora
labels
Oct 23, 2022
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
Mi ritrovo nella soluzione per la lettera a degli appunti di Emanuele Errante della correzione fatta a lezione del professore [🔗] Per la soluzione alla lettera b ritengo basti sostituire ogni 2 della soluzione alla lettera a con il parametro r |
matypist
added
risolto
Soluzioni confermate da un professore o da più studenti
and removed
da revisionare
Almeno una possibile soluzione pubblicata
labels
Jan 28, 2023
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Esercizio 5. In un mazzo di n chiavi ce ne sono 2 che aprono una porta; si cerca di aprirla provando successivamente tutte le chiavi.
Calcolare la probabilita di riuscire al k-esimo tentativo.
E se le chiavi adatte fossero r(2 < r ≤ n)?
The text was updated successfully, but these errors were encountered: