Timeline for Pascal triangle and prime numbers
Current License: CC BY-SA 4.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 29 at 18:33 | history | protected | Yemon Choi | ||
| Mar 29 at 14:56 | review | Close votes | |||
| Apr 3 at 11:56 | |||||
| Mar 29 at 14:28 | comment | converted from answer | user525479 | Pascal's Triangle Modulo n and Its Applications to Efficient Computation of Binomial Coefficients digitalcommons.unl.edu/cgi/… Hope this is helpful. | |
| Mar 24, 2023 at 17:11 | review | Close votes | |||
| Apr 1, 2023 at 3:11 | |||||
| Mar 24, 2023 at 13:35 | history | edited | YCor | CC BY-SA 4.0 |
fixed typo (mine!)
|
| Mar 24, 2023 at 10:18 | history | edited | YCor | CC BY-SA 4.0 |
formatting
|
| S Nov 4, 2017 at 2:23 | history | suggested | jeq | CC BY-SA 3.0 |
Copied images to imgur.com, as they were not being displayed because of new https rule. Renoved now unneeded initial remarks.
|
| Nov 4, 2017 at 1:19 | review | Suggested edits | |||
| S Nov 4, 2017 at 2:23 | |||||
| May 23, 2017 at 12:37 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| May 14, 2010 at 18:03 | answer | added | HenrikRüping | timeline score: 4 | |
| May 14, 2010 at 18:00 | answer | added | André Henriques | timeline score: 5 | |
| May 14, 2010 at 7:35 | answer | added | Foafo Smyth | timeline score: 0 | |
| Dec 29, 2009 at 9:14 | comment | added | Qiaochu Yuan | It's far too slow. Nobody knows an effective method to compute factorials. (A related result along these lines is Wilson's theorem, which is also useless as a primality test: en.wikipedia.org/wiki/Wilson%27s_theorem). | |
| Dec 18, 2009 at 16:45 | comment | added | Alix Axel | If and only if n is a prime, the n'th row will be all highlighted. Can't this be used to test the primality or is it too slow? | |
| Dec 17, 2009 at 17:52 | answer | added | Dan | timeline score: 1 | |
| Dec 17, 2009 at 17:13 | vote | accept | Alix Axel | ||
| Dec 17, 2009 at 17:12 | history | edited | Greg Kuperberg | CC BY-SA 2.5 |
added 82 characters in body
|
| Dec 17, 2009 at 17:04 | answer | added | Harrison Brown | timeline score: 15 | |
| Dec 17, 2009 at 17:03 | comment | added | Greg Kuperberg | The quote messes things up in Reid's comment. For primes, the pattern that you found was published by Edouard Lucas in 1878. It is not hard to make a calculation for composite numbers, but Lucas made the point that the answer is much nicer for primes. en.wikipedia.org/wiki/Lucas_theorem | |
| Dec 17, 2009 at 16:55 | answer | added | Michael Lugo | timeline score: 5 | |
| Dec 17, 2009 at 16:44 | comment | added | Reid Barton | Here is a starting point: en.wikipedia.org/wiki/Lucas'_theorem | |
| Dec 17, 2009 at 16:37 | history | asked | Alix Axel | CC BY-SA 2.5 |