John,
>> Dividing and taking the remainder to achieve a more-fewer mapping
is---by definition---division-method hashing;
and I insist: the number of possible input values is 46656 and this is
the number of output values exact 46656 (not more-fewer but identical)
- and
(surprise surprise) 46656
Martin Truebner (Trübner?) writes:
and I insist: the number of possible input values is 46656 and this is
the number of output values exact 46656 (not more-fewer but identical)
It is of course immediate that for a set of n characters the number of
permutations of them taken m at a time is n^m
Greetings, Mr. Gilmore,
Apparently I fail to understand some aspect of your claim regarding the
remainders when 36 is used as a divisor. If I divide each of the numbers
from 1 to n by 36, each of the values from 0 to 35 is encountered as a
remainder as many times as all other values, provided n i
John,
I understand prime numbers and also channel programming. What I don't
understand is the mathematical basis for the CAUSE of the clustering around
prime factors of a composite modulo. You have explained what happens but not
why. I agree with Robin's statement that real data is not rando
Those interested in the mathematics of hashing should, predictably,
consult Knuth.
The 2nd volume, Sorting and searching, of TACP, any edition, contains
a section called Hash functions.
On page 509 of the 1st edition there appears the summarizing text:
Such considerations suggest that we choose M
On 11/2/2012 7:40 AM, Bill Fairchild wrote:
Rather than belabor this issue any further, if you could post a link to some
explanation of the mathematical proof why clustering occurs around prime
factors of a composite modulo, I would love to read it and try to understand
what is going on.
IST
It is curious to me that curiosity is spelled without the "u". That's why I
consistently misspell it. Cursed be Webster .
--
John McKown
Systems Engineer IV
IT
Administrative Services Group
HealthMarkets(r)
9151 Boulevard 26 * N. Richland Hills * TX 76010
(817) 255-3225 phone *
john.mck...@hea
On 2 November 2012 04:05, Martin Truebner wrote:
> John,
>
>>> Dividing and taking the remainder to achieve a more-fewer mapping
> is---by definition---division-method hashing;
>
> and I insist: the number of possible input values is 46656 and this is
> the number of output values exact 46656 (not
I still do not see how changing a numbering scheme from based
on ten to a system based on thirty-six does create any clusters.
--
Martin
Pi_cap_CPU - all you ever need around MWLC/SCRT/CMT in z/VSE
more at http://www.picapcpu.de
On 2012-11-02 15:01, Martin Truebner wrote:
> I still do not see how changing a numbering scheme from based
> on ten to a system based on thirty-six does create any clusters.
>
It doesn't. Robin has pretty much acknowledged that if the
input data are uniform, a modulus hash will likewise be unifor
10 matches
Mail list logo
