Number Theory

    

Conjecture that States that a Fermat Number is Either Prime Either Divisible by a 2-Poulet Number

Authors: Marius Coman

In this paper I make a conjecture which states that any Fermat number (number of the form 2^(2^n) + 1, where n is natural) is either prime either divisible by a 2-Poulet number. I also generalize this conjecture stating that any number of the form N = ((2^m)^p + 1)/3^k, where m is non-null positive integer, p is prime, greater than or equal to 7, and k is equal to 0 or is equal to the greatest positive integer such that N is integer, is either a prime either divisible by at least a 2-Poulet number (I will name this latter numbers Fermat-Coman numbers) and I finally enunciate yet another related conjecture.

Comments: 2 Pages.

Download: PDF

Submission history

[v1] 2014-10-10 02:04:05

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