Sujet : Re: Fast division (was Re: Suggested method for returning a string from a C program?)
De : antispam (at) *nospam* fricas.org (Waldek Hebisch)
Groupes : comp.lang.cDate : 26. Mar 2025, 14:44:47
Autres entêtes
Organisation : To protect and to server
Message-ID : <vs10cd$3rsg0$1@paganini.bofh.team>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
User-Agent : tin/2.6.2-20221225 ("Pittyvaich") (Linux/6.1.0-9-amd64 (x86_64))
James Kuyper <
jameskuyper@alumni.caltech.edu> wrote:
On 3/25/25 21:04, Janis Papanagnou wrote:
On 22.03.2025 15:07, Waldek Hebisch wrote:
>
Actually, to do fast division of N-bit number by fixed N-bit number
one need 2N-bit multiplication.
I just stumbled across your post and above sentence. Do you mean *one*
multiplication of 2N bit numbers?
I think he meant "one needs 2N-bit multiplication". "one" is a pronoun
in this context, not a number.
Yes, of course "one" in my text above is a pronoun. I do not know
how Janis guessed one multiplication, but it is correct guess.
There is also Newton method which uses multiple multiplications,
but but it is less useful for software at moderate precision
and it is _not_ what I meant.
-- Waldek Hebisch