Talk:Product of divisors: Difference between revisions

Talk:Product of divisors (view source)

409 bytes added , 3 years ago

There are other algorithms other than the obvious one...

3,036

edits

Revision as of 17:54, 20 December 2020 (view source) Blek (talk \| contribs) (→‎Choosing the right abstraction) ← Older edit		Latest revision as of 21:00, 21 December 2020 (view source) Tigerofdarkness (talk \| contribs) (There are other algorithms other than the obvious one...)
(3 intermediate revisions by one other user not shown)
Line 9: There are numbers called divisorial related to that problem. Single ~~responsibility~~responsability. It is like ~~created~~creating the sigma function with all the cases or to use gamma function instead of factorial. ~~--Blek~~ http://oeis.org/wiki/Divisorial --Blek == There are alternative algorithms == ... for calculating the sum/product of the divisors that don't rely on enumerating the divisors and then summing/multiplying them (As in Simonjsaunders demonstrates with the C++ sample) for this and the Sum Of Divisors Task. --[[User:Tigerofdarkness\|Tigerofdarkness]] ([[User talk:Tigerofdarkness\|talk]]) 20:58, 21 December 2020 (UTC)