Compute hash value according to multiplication methodHashing by doing modulo $m$ for $m=p^2$ for a prime $p$...
How do I create uniquely male characters?
Is it possible to do 50 km distance without any previous training?
Motorized valve interfering with button?
Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)
Japan - Plan around max visa duration
declaring a variable twice in IIFE
Book about a traveler who helps planets in need
Theorems that impeded progress
Copenhagen passport control - US citizen
How can I hide my bitcoin transactions to protect anonymity from others?
"You are your self first supporter", a more proper way to say it
Are tax years 2016 & 2017 back taxes deductible for tax year 2018?
Why are 150k or 200k jobs considered good when there are 300k+ births a month?
DOS, create pipe for stdin/stdout of command.com(or 4dos.com) in C or Batch?
Why is "Reports" in sentence down without "The"
How old can references or sources in a thesis be?
Example of a relative pronoun
Why are only specific transaction types accepted into the mempool?
Can a German sentence have two subjects?
I’m planning on buying a laser printer but concerned about the life cycle of toner in the machine
Symplectic equivalent of commuting matrices
How is it possible to have an ability score that is less than 3?
What defenses are there against being summoned by the Gate spell?
Pronouncing Dictionary.com's W.O.D "vade mecum" in English
Compute hash value according to multiplication method
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?How would you implement truly random hash functions in practice?Why does this particular hashCode function help decrease collisions?Constraint on Universal set of hash functionsChoosing a non-cryptographic hash function for language with no unsigned integersHash size: do prime numbers “near” powers of two are bad?Function to generate longer bit-sequence from shorter sequence with certain propertiesRolling Hash calculation with Horner's methodWhat is a minimal, pseudo-random hash function?
$begingroup$
In Introduction to Algorithms, CLR, p264 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
asked 3 hours ago
tedted
1083
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, CLR, p264 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
asked 3 hours ago
tedted
1083
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, CLR, p264 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
asked 3 hours ago
tedted
1083
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, CLR, p264 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
asked 3 hours ago
tedted
1083
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 3 hours ago
tedted
1083
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 3 hours ago
tedted
1083
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 3 hours ago
tedted
1083
asked 3 hours ago
tedted
1083
1083
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 1 hour ago
Yuval FilmusYuval Filmus
196k15184349
$endgroup$
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
1 hour ago
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 1 hour ago
Yuval FilmusYuval Filmus
196k15184349
$endgroup$
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
1 hour ago
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 1 hour ago
Yuval FilmusYuval Filmus
196k15184349
$endgroup$
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
1 hour ago
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 1 hour ago
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 1 hour ago
Yuval FilmusYuval Filmus
196k15184349
answered 1 hour ago
Yuval FilmusYuval Filmus
196k15184349
answered 1 hour ago
Yuval FilmusYuval Filmus
196k15184349
answered 1 hour ago
Yuval FilmusYuval Filmus
196k15184349
196k15184349
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
1 hour ago
add a comment |
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
1 hour ago
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
1 hour ago
$begingroup$
Makes sense, I had forgotten about this step thanks
$endgroup$
– ted
1 hour ago
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
