18
1
I asked random.org for 128 random integers between 0 and 232 - 1. Since the random number generator was so eager to give the first 64 numbers first, they're obviously more random than the other 64.
Write a full program or function that returns a truthy result when one of the following 64 integers is input:
[1386551069, 1721125688, 871749537, 3410748801, 2935589455, 1885865030, 776296760, 614705581, 3841106923, 434616334, 1891651756, 1128215653, 256582433, 310780133, 3971028567, 2349690078, 489992769, 493183796, 3073937100, 3968540100, 777207799, 515453341, 487926468, 2597442171, 950819523, 1881247391, 3676486536, 3852572850, 3498953201, 2544525180, 297297258, 3783570310, 2485456860, 2866433205, 2638825384, 2405115019, 2734986756, 3237895121, 1560255677, 4228599165, 3106247743, 742719206, 2409129909, 3008020402, 328113612, 1081997633, 1583987616, 1029888552, 1375524867, 3913611859, 3488464791, 732377595, 431649729, 2105108903, 1454214821, 997975981, 1764756211, 2921737100, 754705833, 1823274447, 450215579, 976175934, 1991260870, 710069849]
And a falsey result for the other 64 numbers:
[28051484, 408224582, 1157838297, 3470985950, 1310525292, 2739928315, 3565721638, 3568607641, 3857889210, 682782262, 2845913801, 2625196544, 1036650602, 3890793110, 4276552453, 2017874229, 3935199786, 1136100076, 2406566087, 496970764, 2945538435, 2830207175, 4028712507, 2557754740, 572724662, 2854602512, 736902285, 3612716287, 2528051536, 3801506272, 164986382, 1757334153, 979200654, 1377646057, 1003603763, 4217274922, 3804763169, 2502416106, 698611315, 3586620445, 2343814657, 3220493083, 3505829324, 4268209107, 1798630324, 1932820146, 2356679271, 1883645842, 2495921085, 2912113431, 1519642783, 924263219, 3506109843, 2916121049, 4060307069, 1470129930, 4014068841, 1755190161, 311339709, 473039620, 2530217749, 1297591604, 3269125607, 2834128510]
Any input other than one of these 128 numbers is undefined behavior.
If your solution is found programmatically, please also share the code used to generate it!
This is code-golf, so the shortest solution in bytes wins.
19Since the random number generator gave the first 64 numbers first, they must be more random ಠ___ಠ – Luis Mendo – 2016-03-05T16:30:20.613
You can distinguish the two sets modulo 834 – CalculatorFeline – 2016-03-05T17:33:13.867
1Those numbers are not random. – CalculatorFeline – 2016-03-05T18:37:18.217
"Maybe, not enough information."&
33 bytes, answers the question. – CalculatorFeline – 2016-03-05T19:10:01.733@CatsAreFluffy How aren't they random? I did use a program to generate them from bits from random.org; there may have been a bug. – lirtosiast – 2016-03-05T19:50:56.020
Well, look at my answer. Normally, that doesn't seem to be possible. – CalculatorFeline – 2016-03-05T20:02:18.057
3@CatsAreFluffy Actually, as long as the input doesn't contain 0 or 1 and no two elements differ by 1, you can separate them by a modulo chain. e.g. separating
[4 20 79]
from[8 18 100]
can be done by[99 79 20 17 7 4]
(see if you can spot the pattern). Sure, the initial half of your answer might use a much smaller modulo than the input, but the back half consists of shifting one element at a time. – Sp3000 – 2016-03-05T20:22:24.353Oh. Makes sense. – CalculatorFeline – 2016-03-05T20:24:57.157
Also my algorithm usually fails for other input sets (it chooses the smallest modulus that still allows for distinguishing the sets) – CalculatorFeline – 2016-03-05T23:55:34.843