Ascii-seeded random number generator

A computer-implemented method of selecting a final user from a set of users, the method comprising:

• assigning a random number from a set of numbers to each user in the set of users;
• arranging the users in the set of users based on the random number assigned to each of the users in the set of users;
• and
• selecting the final user from the set of users, the selecting including:
• selecting a letter from a name of each of the users in the set of users;
• computing a user selection seed value based at least on (i) an ASCII-value representation of the name of each user in the set of users and (ii) an ASCII-value representation of the selected letters from the names of the users in the set of users;
• modifying the computed user selection seed value to produce a modified user selection seed value, the modifying including dividing the computed user selection seed value by B1, wherein B1 is the number of users in the set of users;
• rounding the modified user selection seed value down to an integer value closest to the modified user selection seed value, the integer value being equal to B2;
• computing a user selection offset value by multiplying B1 by B2;
• computing a user selection lookup number by subtracting the user selection offset value from the computed user selection seed value;
• determining the final user by using the computed user selection lookup number and the arrangement of the users in the set of users;
• and
• selecting the final user.

A computer-implemented method of selecting a final user from a set of users, the method comprising:

• assigning a random number from a set of numbers to each user in the set of users;
• sorting the set of users into a first subset of users, a second subset of users, and a third subset of users, the sorting being based at least in part on a present value associated with each of the users in the set of users, a historical value associated with each of the users in the set of users, or both;
• dynamically arranging the users in the first subset of users based on the random number previously assigned to each of the users in the first subset of users;
• removing one or more of the users in the first subset of users, thereby forming a reduced first subset of users, the removing of one user in the first subset of users including:
• computing a first removal seed value that is specific to the one user in the first subset of users based at least on an ASCII-value representation of a name of each user currently remaining in the first subset of users;
• modifying the computed first removal seed value to produce a modified first removal seed value, the modifying including dividing the computed first removal seed value by D1, wherein D1 is the number of users currently remaining in the first subset of users;
• rounding the modified first removal seed value down to an integer value closest to the modified first removal seed value, the integer value being D2;
• computing a first removal offset value by multiplying D1 by D2;
• computing a first removal lookup number by subtracting the first removal offset value from the computed first removal seed value;
• determining the one user in the first subset of users to be removed by using the computed first removal lookup number and the dynamic arrangement of the users in the first subset of users;
• and
• removing the determined one user in the first subset of users from the first subset of users;
• combining the reduced first subset of users and the second subset of users to create a fourth subset of users;
• dynamically arranging the users in the fourth subset of users based on the random number previously assigned to each of the users in the fourth subset of users;
• removing one or more of the users in the fourth subset of users, thereby forming a reduced fourth subset of users, the removing of one user in the fourth subset of users including:
• computing a second removal seed value that is specific to the one user in the fourth subset of users based at least on an ASCII-value representation of a name of each user currently remaining in the fourth subset of users;
• modifying the computed second removal seed value to produce a modified second removal seed value, the modifying including dividing the computed second removal seed value by E1, wherein E1 is equal to the number of users currently remaining in fourth subset of users;
• rounding the modified second removal seed value down to an integer value closest to the modified second removal seed value, the integer value being equal to E2;
• computing a second removal offset value by multiplying E1 by E2;
• computing a second removal lookup number by subtracting the second removal offset value from the computed second removal seed value;
• determining the one user in the fourth subset of users to be removed by using the computed second removal lookup number and the dynamic arrangement of the users in the fourth subset of users;
• and
• removing the determined one user in the fourth subset of users from the fourth subset of users;
• combining the reduced fourth subset of users and the third subset of users to create a fifth subset of users;
• arranging the users in the fifth subset of users based on the random number previously assigned to each of the users in the fifth subset of users;
• and
• selecting the final user from the fifth subset of users.

A computer-implemented method of assigning a random number from a set of numbers to one user in a set of users, the method comprising:

• computing a random number assignment seed value that is specific to the one user in the set of users based at least on an ASCII-value representation of a name of the one user in the set of users, the computing the random number assignment seed value including retrieving by a computer system the ASCII-value representation from an ASCII table;
• modifying by the computer system the computed random number assignment seed value to produce a modified random number assignment seed value, the modifying including dividing the computed random number assignment seed value by A1, wherein A1 is a quantity of unassigned numbers in the set of numbers that are currently available to be assigned to the one user in the set of users;
• rounding the modified random number assignment seed value down to an integer value closest to the modified random number assignment seed value, the integer value being equal to A2;
• computing a random number assignment offset value by multiplying A1 by A2;
• computing a random number assignment lookup number by subtracting the random number assignment offset value from the computed random number assignment seed value;
• determining by the computer system the random number to be assigned to the one user in the set of users from the set of numbers by using the computed random number assignment lookup number and a dynamic arrangement of the unassigned numbers in the set of numbers;
• assigning by the computer system the determined random number to the one user in the set of users;
• storing in a memory device of the computer system an association between the determined random number and the one user in the set of users;
• and
• using the association in a computer-implemented application running on one or more processors of the computer system to increase an accuracy or authenticity of the computer-implemented application.