Falsification of randomness and transformation by sorting pseudo-random sequences
Purpose: to prove the possibility of falsification of randomness and the reality of overcoming the falsification of randomness.Natural randomness, divided into integral logarithmic spectra, predictably shows short repetition distances and long repetition distances are absent massively, but sorting the sequence brings the separation spectra into a theoretical form.The gap of the Enlightenment of Russia and the USSR and the CIS: the integral and the logarithm in the lower grades are not studied and subsequently consider the simplest supposedly complex.
The designations used should be understood literally: randomness is natural - natural, created without a computer.
The program "False Chance 1"The sequence increases the number of identical in a row.
OPEN "da11.txt" FOR OUTPUT AS #1
FOR d = 1 TO 5: FOR s = 1 TO 100
FOR i = 1 TO s: PRINT #1, 1: NEXT
FOR i = 1 TO s: PRINT #1, 0: NEXT
NEXT: NEXT: CLOSE
Column G shows an absurd distribution with an average of 0.5.Column A - name of the experiment;B1 = AVERAGE (C1: C50000) - the average value of the sequence;Columns C ... F - study of quantity in a row;Column J - random for permutation;Column K - sequence after permutation;M1 = AVERAGE (N1: N50000) - the average value of the sequence;Columns N ... R - a study of the quantity in a row.By exploring other criteria, it is possible to apply other formulas, but the illuminated method is available for understanding in the lower grades of the school.Before the permutation of 500 cells: unsatisfactory
After the permutation of 500 cells: normal.
Conclusion: a clear fake of the species was revealed: an equal number of identical ones in a row and transformed.The program "False Chance 2"The sequence increases the number of identical in a row, especially considering the verification algorithm.
OPEN "da22.txt" FOR OUTPUT AS #1
FOR k = 1 TO 100: FOR s = 1 TO 7
FOR d = 1 TO 2^(7-s)
FOR i = 1 TO s: PRINT #1, 1: NEXT
FOR i = 1 TO s: PRINT #1, 0: NEXT
NEXT: NEXT: NEXT: CLOSE
Before the permutation of 500 cells: unsatisfactory
After the permutation of 500 cells: normal
Conclusion: a smart fake was detected, because all possible options are not programmed and the skew due to the synthesis algorithm is visible.A fake shuffled sequence turns into a random sequence.Conclusion: realistically identify fake sequences.The datasov.bas and datasov.cs programs rearrange the elements of the source array by sorting the inverted array.Qbasic permutation program
DIM a(55000), d(55000)
OPEN "aa.txt" FOR INPUT AS #1
OPEN "dd.txt" FOR OUTPUT AS #2
FOR i = 1 TO 55000
INPUT #1, a(i): d(55000 - i + 1) = a(i):NEXT
FOR i = 1 TO 54999: FOR j = i TO 55000
IF d(i) > d(j) THEN SWAP d(i), d(j): SWAP a(i), a(j)
NEXT: NEXT
FOR i = 1 TO 55000: PRINT #2, a(i): NEXT: CLOSE
C # permutation program
using System; using System.Linq;
using System.Collections.Generic;
using System.Text; using System.IO;
namespace tasov
{ class Program
{ static long[] a; static long[] d;
static void Main(string[] args)
{ a = new long[55500]; d = new long[55500];
var inpFile = new StreamReader("aa.txt");
for (int i = 1; i <= 55000; i++)
{ a[i] = Convert.ToInt64(inpFile.ReadLine());
d[55000-i+1] = a[i]; }
for (int i = 1; i <= 54999; i++)
for (int j = i; j <= 55000; j++)
if (d[i] > d[j])
{ var temp = d[i]; d[i] = d[j]; d[j] = temp;
temp = a[i]; a[i] = a[j]; a[j] = temp; }
var outFile = new StreamWriter("vv.txt");
for (int i = 1; i <= 55000; i++)
outFile.WriteLine(a[i]);
Console.ReadKey();}}}
The algorithm without built-in RND reads the source array and immediately creates an inverted array and then sorting the inverse array shuffles the original array and the sequence is normal.Conclusion: reliable randomness - 2-sided integral randomness.Q.E.D.The Nobel Prize will not receive itself.Possible continuation:Investigation of digits of pi.Experiments of random research.Wave-like probability logarithmic.2020 Developments of foreign like-minded people.