As already mentionend, what he describes should be called a bijective mixing function. Now when i am given n different values, i can mix them them with his func

As already mentionend, what he describes should be called a bijective mixing function. Now when i am given n different values, i can mix them them with his function and will get n other pairwise different values. That helps me nothing in practive with regard to the task of perfect hashing. Technically i would say, he describes in deed a perfect hashing function, but of questionable quality.