Timeline for Are there open problems for primes which are known for probable primes?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 1, 2015 at 17:43 | comment | added | Lucia | I thought you had in mind questions that "are entirely different" from the membership question: e.g. twin primes, Goldbach etc. For these questions, usually we have guesses for the answer (e.g. number of solutions to a, a+2 with a in some set) based on the size of the sets in question. My point is that the set of pseudoprimes is so small that this wouldn't affect such heuristics (and indeed it would be much harder for some such property to hold with one pseudoprime involved). | |
| Sep 1, 2015 at 17:43 | comment | added | Sungjin Kim | By the way, $c=1/2$ in Pomerance's paper. This value of $c$ is considered as current barrier of our knowledge. | |
| Sep 1, 2015 at 17:24 | comment | added | joro | Thank you, but how "a small set" is answer to the question? As Tao pointed out in comment, the decision problem about membership is much easier. | |
| Sep 1, 2015 at 16:28 | history | answered | Lucia | CC BY-SA 3.0 |