The set consisting of random numbers with random lengths

  • Context: Graduate 
  • Thread starter Thread starter serp777
  • Start date Start date
  • Tags Tags
    Numbers Random Set
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
8 replies · 2K views
serp777
Messages
117
Reaction score
6
Does the set of random integers with random lengths (the number of digits), which hypothetically would generate random numbers with random lengths for eternity, produce all possible integers? It seems to me that this is a natural conclusion but I've never seen a proof of this. A more incredible statement would be that there are integers which could not be produced via this process.
 
Physics news on Phys.org
I don't see how you can construct an integer that can escape being produced. All integers have the same probability of being produced (namely zero) in a finite time.
I'm not sure how things change if e.g. you first pick a random length (infinitely many possibilities) and subsequently pick a random integer of that length (a finite number of choices).
 
serp777 said:
Does the set of random integers with random lengths (the number of digits), which hypothetically would generate random numbers with random lengths for eternity, produce all possible integers? It seems to me that this is a natural conclusion but I've never seen a proof of this. A more incredible statement would be that there are integers which could not be produced via this process.
First tell me how you would create that random number generator. If you want to create a random number in a finite time, you will only get random numbers in a finite range...
 
I am not sure that this stands up to rigorous scrutiny but...

As BvU points out, the probability that any particular integer escapes being produced is zero. The probability that any particular integer escapes being produced while all lesser integers are produced is also zero. The case that at least one integer escapes being produced is the infinite union of the cases where some integer escapes being produced while all lower integers are produced. Those component cases are disjoint by construction. By countable additivity, the probability of the union is the sum of the probabilities of all of the component cases. That sum is zero.
 
micromass said:
How do you even pick an integer at random? There is no way!
It is not possible to pick an integer at random such that all integers are possible and the probability distribution is uniform.

My reading of the problem in #1 is that the requirement that the distribution be uniform has been relaxed but the requirement that the distribution have a non-zero probability for each and every integer has been retained. A procedure such as "flip a coin and count the number of tails prior to the first heads" is almost certain to work for this.
 
jbriggs444 said:
It is not possible to pick an integer at random such that all integers are possible and the probability distribution is uniform.

My reading of the problem in #1 is that the requirement that the distribution be uniform has been relaxed but the requirement that the distribution have a non-zero probability for each and every integer has been retained. A procedure such as "flip a coin and count the number of tails prior to the first heads" is almost certain to work for this.

Sure. But many people not familiar with probability seem to use the word "at random" to mean "uniform probabilities". If the OP doesn't say this, he needs to specify exactly how he does this random number selection.
 
  • Like
Likes   Reactions: jbriggs444
Does the randomness allow for numbers to be generated twice? If not, it should be exactly the same as trying to enumerate the set of integers, which is infinite. If it does, on the other hand, it just makes things worse as the probability of a particular integer to be generated is even smaller.