Timeline for Factorial algorithm more efficient than naive multiplication
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2023 at 20:01 | comment | added | user25406 | Here's a method that doesn't use a single multiplication. math.stackexchange.com/questions/4711223/… | |
| Jun 3, 2023 at 20:33 | comment | added | user25406 | Here's a method that can get a factorial without using a single multiplication during the process. the method uses pre-computed squares and stored for future use by those who deals with factorials on a daily basis. math.stackexchange.com/questions/4711223/… | |
| Mar 3, 2023 at 15:29 | comment | added | user25406 | Here's a method that cuts the number of multiplications needed to get $n!$ by half. scicomp.stackexchange.com/questions/42510/… | |
| Aug 12, 2021 at 6:33 | comment | added | D.W.♦ | cs.stackexchange.com/q/143090/755 | |
| Jul 10, 2021 at 16:12 | answer | added | gnasher729 | timeline score: 1 | |
| Dec 18, 2020 at 14:33 | answer | added | Sreekumar Ananda Rao | timeline score: 0 | |
| Sep 20, 2015 at 23:55 | review | Suggested edits | |||
| Sep 21, 2015 at 6:17 | |||||
| Sep 21, 2013 at 21:43 | vote | accept | user65165 | ||
| Sep 20, 2013 at 16:56 | answer | added | András Salamon | timeline score: 62 | |
| Sep 20, 2013 at 8:53 | answer | added | Gilles 'SO- stop being evil' | timeline score: 22 | |
| Sep 20, 2013 at 8:18 | history | edited | Gilles 'SO- stop being evil' | CC BY-SA 3.0 |
added 48 characters in body; edited tags; edited title
|
| Sep 20, 2013 at 3:19 | history | tweeted | twitter.com/#!/StackCompSci/status/380893913688854529 | ||
| Sep 20, 2013 at 2:08 | answer | added | Yuval Filmus | timeline score: 11 | |
| Sep 20, 2013 at 2:00 | history | asked | user65165 | CC BY-SA 3.0 |