A Determining if a list of numbers is a result of multiplication

alk10
Messages
1
Reaction score
0
TL;DR Summary
Determining if a list of numbers is a result of multiplication
Suppose I have 2 collections of lists.

In the first collection the lists consists of random integers, with most (but not all) in the range 0-1000.
In the second collection the lists consist of integers calculated in the following way:
a. start with a random integer of similar range to the first list
b. multiply by some unknown fraction, typically (but not always) in the range 0-2.
c. round to the nearest integer

Given a particular list, I would like to be able to predict which collection it comes from.

I have tried taking the modulo from every number between 2-20 and looking at the remainder (as for example if the fraction in b) was exactly 2, then the elements mod 2 would always be zero), but couldn't find a noticeable difference. Would appreciate any ideas.
 
Physics news on Phys.org
You have been very vague about the probabilities or distributions of the random behavior.
Phrases like "most (but not all)", "typically (but not always)", "random integers", etc. do not give us much to work with.
Since the second method might create a large number of integers that are beyond the range 0-1000, I would consider using that to make an educated guess about which method created the list. But your description is too vague to know if that is a feasible method.
 
Last edited:
I would use a Bayesian approach for this (of course). "Simply" write down the data-generating models for your two possibilities and then do a Bayesian analysis for any parameters of the models. Then you can compare the models using Bayes factors or your favorite alternative Bayesian model comparison technique.
 
Just run a Monte Carlo on some randomly generated numbers to test
 
In general, the distributions of the two processes will be significantly different. You should be able to use a Chi-square goodness of fit test to determine which method is more likely for a given sample. Without more information about the distributions, I don't think that much more can be said.
 
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