Number Theory

    

Quadratic Sequence Primality Test

Authors: Mar Detic

We introduce a primality testing framework based on examining the greatest common divisors (GCDs) of a candidate integer p with terms froma quadratic sequence defined by Sq = q2 + 2q for odd integers q. This approach generalizes and extends classical primality criteria by leveraging properties of quadratic forms. We formalize this method as a conjecture,analyze its computational complexity, discuss potential error cases such as pseudoprimes, and present empirical validations demonstrating its effectiveness.

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2025-06-01 20:56:09
[v2] 2025-06-03 23:52:15
[v3] 2025-07-23 20:25:30

Unique-IP document downloads: 376 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus