Number Theory

    

A Polynomial Recursion for Prime Constellations

Authors: Scott B. Guthery

An algorithm for recursively generating the sequence of solutions of a prime constellation is described. The algorithm is based on an polynomial equation formed from the first n elements of the constellation. A root of this equation is the next element of the sequence.

Comments: 8 Pages.

Download: PDF

Submission history

[v1] 2016-06-30 11:00:58

Unique-IP document downloads: 302 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