Compute hash value according to multiplication methodHashing 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?

Multi tool use
Multi tool use

If Manufacturer spice model and Datasheet give different values which should I use?

Shell script can be run only with sh command

Can I interfere when another PC is about to be attacked?

Can an x86 CPU running in real mode be considered to be basically an 8086 CPU?

Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)

Japan - Plan around max visa duration

How do you conduct xenoanthropology after first contact?

Why is the design of haulage companies so “special”?

Is it possible to do 50 km distance without any previous training?

Why CLRS example on residual networks does not follows its formula?

N.B. ligature in Latex

How is it possible to have an ability score that is less than 3?

I’m planning on buying a laser printer but concerned about the life cycle of toner in the machine

The magic money tree problem

Why is "Reports" in sentence down without "The"

Are tax years 2016 & 2017 back taxes deductible for tax year 2018?

A function which translates a sentence to title-case

Banach space and Hilbert space topology

XeLaTeX and pdfLaTeX ignore hyphenation

Motorized valve interfering with button?

How can I fix this gap between bookcases I made?

Why don't electron-positron collisions release infinite energy?

TGV timetables / schedules?

The use of multiple foreign keys on same column in SQL Server



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?













2












$begingroup$


In Introduction to Algorithms, CLR, p264 they state this:



enter image description here



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









share|cite







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$
















    2












    $begingroup$


    In Introduction to Algorithms, CLR, p264 they state this:



    enter image description here



    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









    share|cite







    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$














      2












      2








      2





      $begingroup$


      In Introduction to Algorithms, CLR, p264 they state this:



      enter image description here



      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









      share|cite







      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:



      enter image description here



      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






      share|cite







      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.











      share|cite







      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.









      share|cite




      share|cite






      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 8 hours ago









      tedted

      1133




      1133




      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.




















          1 Answer
          1






          active

          oldest

          votes


















          3












          $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.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            Makes sense, I had forgotten about this step thanks
            $endgroup$
            – ted
            5 hours ago












          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.









          draft saved

          draft discarded


















          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









          3












          $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.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            Makes sense, I had forgotten about this step thanks
            $endgroup$
            – ted
            5 hours ago
















          3












          $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.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            Makes sense, I had forgotten about this step thanks
            $endgroup$
            – ted
            5 hours ago














          3












          3








          3





          $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.






          share|cite|improve this answer









          $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.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 5 hours ago









          Yuval FilmusYuval Filmus

          196k15184349




          196k15184349











          • $begingroup$
            Makes sense, I had forgotten about this step thanks
            $endgroup$
            – ted
            5 hours ago

















          • $begingroup$
            Makes sense, I had forgotten about this step thanks
            $endgroup$
            – ted
            5 hours ago
















          $begingroup$
          Makes sense, I had forgotten about this step thanks
          $endgroup$
          – ted
          5 hours ago





          $begingroup$
          Makes sense, I had forgotten about this step thanks
          $endgroup$
          – ted
          5 hours ago











          ted is a new contributor. Be nice, and check out our Code of Conduct.









          draft saved

          draft discarded


















          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.




          draft saved


          draft discarded














          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





















































          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







          qRQZRoclZifWNnxhfQX52xcFVRRYWd,rv6f,lFAu49PGnQSLh 1,d,w4FJit LIKaT
          eavOBiq0SPZ GMKBa6,N742FvU,rPOggQNJJ9xQY9,xe8Q FYWU9xDfv7 HKnBQmE42Nsod1

          Popular posts from this blog

          Disable / Remove link to Product Items in Cart Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How can I limit products that can be bought / added to cart?Remove item from cartHide “Add to Cart” button if specific products are already in cart“Prettifying” the custom options in cart pageCreate link in cart sidebar to view all added items After limit reachedLink products together in checkout/cartHow to Get product from cart and add it againHide action-edit on cart page if simple productRemoving Cart items - ObserverRemove wishlist items when added to cart

          Adjektiivitarina Tarinan tekeminen | Esimerkki: ennen | Esimerkki: jälkeen | Navigointivalikko

          HP P840 HDD RAID 5 many strange drive faiuresHP SmartArray P400: How to repair failed logical drive?Reusing Raid 5 Drive?reliably and automatically determine connection path of physical position of HDD from /dev/sdX device fileHow to replace failed drive in RAID 5 array in HP DL380 G4 serverQuestions on increasing RAID 5 arrayRaid 10, Logical device are missingHP Code 341 “Physical Drive State: Predictive failure. This physical drive is predicted to fail soon.”HPE 1.92TB SATA 6G Mixed Use SFF SSD very slow compared to SAS HDD HP disksHP drive array “ready for rebuild” (RAID5)Hard Disc Failure or RAID Glitch