sigmasternchen/libsfuid
1
0
Fork 0
mirror of https://github.com/sigmasternchen/libsfuid synced 2025-03-16 00:19:07 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Update README.md

Browse source
This commit is contained in:
overflowerror 2019-01-23 00:45:12 +01:00 committed by GitHub
parent 2aeff36187
commit 8c9d87fc4e
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions

2
README.md
View file

@ -55,7 +55,7 @@ It's basically a kind of MCG (multiplicative congruential generator) but instead
So the formular to get a specific ID is:
![s(i) := p\*i mod m](https://latex.codecogs.com/gif.download?s%28i%29%20%3A%3D%20p%20%5Ccdot%20i%20%5Cmod%20m)
![s(i) := p\*i mod m](https://raw.githubusercontent.com/overflowerror/null/master/projects/libsfuid/formular.gif?token=AEuWLXTFaZj0xp6HvvskmihKWeIQcRIdks5cR6sxwA%3D%3D)
The condition for p and m is that their GCD is 1. I chose m to be a power of 2 so it's prime factors are only 2. For p I chose a prime that is about 25 % of m. For that I hardcoded a list of possible primes candidated into the program.