Revision as of 07:12, 30 October 2008 edit 124.30.235.62 (talk) →sudar 4edi ← Previous edit		Revision as of 21:19, 10 January 2009 edit undo Maghnus (talk \| contribs) Extended confirmed users 617 edits →error in example Next edit →
Line 30: :I think there still is an error in the example. The Length of A, S and P do not match the above definition. They have length 9 in the example, which is not equal to 3+4+1. <small>—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/84.226.35.96\|84.226.35.96]] ([[User talk:84.226.35.96\|talk]]) 08:59, 5 May 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> ::The 9 bits refer to 4+4+1 (the number of bits ''x'' and ''y'', not the values '''x''' and '''y'''). I have changed '''x''' and '''y''' to '''m''' and '''r''', so hopefully there is less confusion. The whole description is confusing, but I only learned the algorithm a few minutes ago so I won't dare to fix it yet. :) [[User:Maghnus\|Maghnus]] ([[User talk:Maghnus\|talk]]) 21:19, 10 January 2009 (UTC) == Improved method that handles multiplication by the minimum negative number ==

Talk:Booth's multiplication algorithm: Difference between revisions