Discussion Overview
The discussion focuses on methods for proving the primality of large numbers expressed in the form a^b + c, particularly when a and c are of similar size. Participants are seeking faster alternatives to general primality proving methods.
Discussion Character
- Exploratory, Technical explanation, Debate/contested
Main Points Raised
- One participant inquires about a method for proving the primality of numbers of the form a^b + c, expressing a desire for a faster approach than existing general primality provers.
- Another participant suggests that the special number field sieve (SNFS) was designed for this purpose, although it is noted that SNFS is primarily a factorization method.
- A participant clarifies that they are specifically looking for a primality proving analogue to SNFS, rather than a factoring method.
- There is an acknowledgment of a misunderstanding regarding the applicability of SNFS, with participants expressing similar experiences of confusion.
- A request is made for verification of the absence of a quick algorithm or program for this specific primality proving task, indicating a concern about resorting to standard methods like ECPP.
Areas of Agreement / Disagreement
Participants do not reach a consensus on the existence of a specific method for proving the primality of numbers of the form a^b + c. Multiple competing views regarding the applicability of existing methods remain unresolved.
Contextual Notes
Participants express uncertainty regarding the availability of efficient algorithms for primality proving in this context, and there is a reliance on definitions and the scope of existing methods.
Frankly, I did *exactly* the same thing myself: I said "that's a perfect SNFS form!" and Googled to find a good client... until I realized that I was searching for the wrong thing.