I How many guesses would it require to correctly guess a 10 digit number?

  • I
  • Thread starter Thread starter shivajikobardan
  • Start date Start date
shivajikobardan
Messages
637
Reaction score
54
TL;DR Summary
Guesses required
Book link
.I'm trying to find how'd you calculate the number of guesses required to correctly guess a 10 digit password made up of numbers only?
Binary or decimal both ok, I just want to learn how'd you calculate it.
I think the probability is ## 1/3628800 ##

take binary case:
For guessing the first number correctly, you'd require 2 guesses.
##2^{10}## guesses

Is this approach correct? ##10^{10}## guesses to guess 10 digit decimal number?
 
Physics news on Phys.org
That looks right to me. One thing to watch out for with the wording of the problem - a regular 10 digit number can't start, since it would just be a 9 digit number at that point. But a 10 digit password certainly could.
 
shivajikobardan said:
I think the probability is ## 1/3628800 ##
Where has this number come from?
 
shivajikobardan said:
Summary: Guesses required

Book link
.I'm trying to find how'd you calculate the number of guesses required to correctly guess a 10 digit password made up of numbers only?
Binary or decimal both ok, I just want to learn how'd you calculate it.
I think the probability is ## 1/3628800 ##
You lost me here. Where did this probability come from? It seems unrelated to ##2^{10}## or ##10^{10}##.
Are you interested in how many are required to know that you have guessed it in every case or how many guesses would you expect it to take?
 
This depends on the information you get after each guess. If you get a yes/no the answer is different from higher/lower, which is different from "higher by 1234:".

In base b, the number of guesses with no other information needed to know it is b^{10}-1. The average is about half that.
 
  • Like
Likes FactChecker
Vanadium 50 said:
This depends on the information you get after each guess. If you get a yes/no the answer is different from higher/lower, which is different from "higher by 1234:".

In base b, the number of guesses with no other information needed to know it is b^{10}-1. The average is about half that.
To be clear, that is to make every guess possible so that you know that one of the guesses is right. But you don't know which guess is right until you are told.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top