Timeline for Counting the number of prime triplet
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 7, 2015 at 11:19 | history | suggested | user76479 | CC BY-SA 3.0 |
correction
|
| Sep 7, 2015 at 11:12 | review | Suggested edits | |||
| S Sep 7, 2015 at 11:19 | |||||
| Jan 2, 2012 at 16:34 | vote | accept | user15864 | ||
| Dec 29, 2011 at 9:43 | comment | added | user15864 | These kinds of integers are used many times for multi prime RSA case. | |
| Dec 29, 2011 at 9:26 | answer | added | Felipe Voloch | timeline score: 5 | |
| Dec 29, 2011 at 8:38 | comment | added | Gerhard Paseman | It would be nice to get some motivation for doing this. Also, you are unlikely to get an exact count for l larger than , say, 30. If you want a rough estimate, the count should have close to l - 3n digits, where n is the number of digits of m. Gerhard "Ask Me About System Design" Paseman, 2011.12.29 | |
| Dec 29, 2011 at 8:09 | comment | added | user15864 | Yes $l$ is fixed. | |
| Dec 29, 2011 at 8:07 | comment | added | Qiaochu Yuan | Is $l$ also fixed? | |
| Dec 29, 2011 at 8:07 | history | edited | Qiaochu Yuan | CC BY-SA 3.0 |
added 15 characters in body; edited body
|
| Dec 29, 2011 at 8:05 | history | edited | user15864 | CC BY-SA 3.0 |
deleted 3 characters in body
|
| Dec 29, 2011 at 7:58 | history | asked | user15864 | CC BY-SA 3.0 |