Compute hash value according to multiplication methodCollision resistant hash functionMin/max of hash function (Whirlpool)Hashing by doing modulo $m$ for $m=p^2$ for a prime $p$ instead of using a prime $m$ - is it that bad?Why having a simple multiplication loop and very good avalanche isn't enough to produce well-distributed hash values?Building static hash table with particular collisionsUnderstanding of hash tablesUniversal family of hash functionsTruth value of a propositionRolling Hash calculation with Horner's methodIs the capacity of a hash table a constant value?
Does bootstrapped regression allow for inference?
Can I legally use front facing blue light in the UK?
Is there a name of the flying bionic bird?
Why was the "bread communication" in the arena of Catching Fire left out in the movie?
Why airport relocation isn't done gradually?
How to deal with fear of taking dependencies
aging parents with no investments
Why did the Germans forbid the possession of pet pigeons in Rostov-on-Don in 1941?
map list to bin numbers
Is domain driven design an anti-SQL pattern?
Lied on resume at previous job
How could a lack of term limits lead to a "dictatorship?"
How to make payment on the internet without leaving a money trail?
COUNT(*) or MAX(id) - which is faster?
What do the Banks children have against barley water?
When blogging recipes, how can I support both readers who want the narrative/journey and ones who want the printer-friendly recipe?
What are the advantages and disadvantages of running one shots compared to campaigns?
New order #4: World
Is ipsum/ipsa/ipse a third person pronoun, or can it serve other functions?
Symmetry in quantum mechanics
What to wear for invited talk in Canada
Pristine Bit Checking
What is the meaning of "of trouble" in the following sentence?
Can the Produce Flame cantrip be used to grapple, or as an unarmed strike, in the right circumstances?
Compute hash value according to multiplication method
Collision resistant hash functionMin/max of hash function (Whirlpool)Hashing by doing modulo $m$ for $m=p^2$ for a prime $p$ instead of using a prime $m$ - is it that bad?Why having a simple multiplication loop and very good avalanche isn't enough to produce well-distributed hash values?Building static hash table with particular collisionsUnderstanding of hash tablesUniversal family of hash functionsTruth value of a propositionRolling Hash calculation with Horner's methodIs the capacity of a hash table a constant value?
$begingroup$
In "Introduction to Algorithms" by C. E. Leiserson, R. L. Rivest and C. Stein (ISBN: 978-0262033848), p. 264 they state this:
I get everything but the last part stating $h(k) = 67$
>>> r = 17612864
>>> bin(r) # r's binary representation
'0b1000011001100000001000000'
>>> int(bin(r)[: 14 + 2], 2) # extract 14 most significant bits and convert to int
8600
hash python
edited yesterday
user02814
1031
asked yesterday
tedted
1134
New contributor
ted is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
In "Introduction to Algorithms" by C. E. Leiserson, R. L. Rivest and C. Stein (ISBN: 978-0262033848), p. 264 they state this:
I get everything but the last part stating $h(k) = 67$
>>> r = 17612864
>>> bin(r) # r's binary representation
'0b1000011001100000001000000'
>>> int(bin(r)[: 14 + 2], 2) # extract 14 most significant bits and convert to int
8600
hash python
edited yesterday
user02814
1031
asked yesterday
tedted
1134
New contributor
ted is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
In "Introduction to Algorithms" by C. E. Leiserson, R. L. Rivest and C. Stein (ISBN: 978-0262033848), p. 264 they state this:
I get everything but the last part stating $h(k) = 67$
>>> r = 17612864
>>> bin(r) # r's binary representation
'0b1000011001100000001000000'
>>> int(bin(r)[: 14 + 2], 2) # extract 14 most significant bits and convert to int
8600
hash python
edited yesterday
user02814
1031
asked yesterday
tedted
1134
New contributor
ted is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
In "Introduction to Algorithms" by C. E. Leiserson, R. L. Rivest and C. Stein (ISBN: 978-0262033848), p. 264 they state this:
I get everything but the last part stating $h(k) = 67$
>>> r = 17612864
>>> bin(r) # r's binary representation
'0b1000011001100000001000000'
>>> int(bin(r)[: 14 + 2], 2) # extract 14 most significant bits and convert to int
8600
hash python
hash python
edited yesterday
user02814
1031
asked yesterday
tedted
1134
New contributor
ted is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited yesterday
user02814
1031
asked yesterday
tedted
1134
New contributor
ted is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited yesterday
user02814
1031
edited yesterday
user02814
1031
edited yesterday
user02814
1031
1031
asked yesterday
tedted
1134
New contributor
ted is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked yesterday
tedted
1134
asked yesterday
tedted
1134
1134
New contributor
ted is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
ted is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
ted is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You haven't extracted the 14 most significant bits. First, you have to write $r$ as a $w$-bit number:
$$
00000001000011001100000001000000
$$
Now you extract the 14 most significant bits:
$$
00000001000011
$$
Converting to decimal, this is 67.
answered yesterday
Yuval FilmusYuval Filmus
196k15184349
$endgroup$
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
yesterday
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "419"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
ted is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f106614%2fcompute-hash-value-according-to-multiplication-method%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You haven't extracted the 14 most significant bits. First, you have to write $r$ as a $w$-bit number:
$$
00000001000011001100000001000000
$$
Now you extract the 14 most significant bits:
$$
00000001000011
$$
Converting to decimal, this is 67.
answered yesterday
Yuval FilmusYuval Filmus
196k15184349
$endgroup$
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
yesterday
add a comment |
$begingroup$
You haven't extracted the 14 most significant bits. First, you have to write $r$ as a $w$-bit number:
$$
00000001000011001100000001000000
$$
Now you extract the 14 most significant bits:
$$
00000001000011
$$
Converting to decimal, this is 67.
answered yesterday
Yuval FilmusYuval Filmus
196k15184349
$endgroup$
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
yesterday
add a comment |
$begingroup$
You haven't extracted the 14 most significant bits. First, you have to write $r$ as a $w$-bit number:
$$
00000001000011001100000001000000
$$
Now you extract the 14 most significant bits:
$$
00000001000011
$$
Converting to decimal, this is 67.
answered yesterday
Yuval FilmusYuval Filmus
196k15184349
$endgroup$
You haven't extracted the 14 most significant bits. First, you have to write $r$ as a $w$-bit number:
$$
00000001000011001100000001000000
$$
Now you extract the 14 most significant bits:
$$
00000001000011
$$
Converting to decimal, this is 67.
answered yesterday
Yuval FilmusYuval Filmus
196k15184349
answered yesterday
Yuval FilmusYuval Filmus
196k15184349
answered yesterday
Yuval FilmusYuval Filmus
196k15184349
answered yesterday
Yuval FilmusYuval Filmus
196k15184349
196k15184349
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
yesterday
add a comment |
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
yesterday
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
yesterday
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
yesterday
add a comment |
ted is a new contributor. Be nice, and check out our Code of Conduct.
ted is a new contributor. Be nice, and check out our Code of Conduct.
ted is a new contributor. Be nice, and check out our Code of Conduct.
ted is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Computer Science Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f106614%2fcompute-hash-value-according-to-multiplication-method%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
