Number Theory

   

A Method of Obtaining Large Primes Based on Carmichael Numbers

Authors: Marius Coman

Playing with Carmichael numbers, a set of numbers I’ve always been fond of (I’ve “discovered” Fermat’s “Little” Theorem and the first few Carmichael numbers before I know they had already been discovered), I noticed that the formula C + 81*2^(4*d), where C is a Carmichael number and d one of its prime factors, gives often primes or products of very few primes. For instance, for C = 1493812621027441 are obtained in this manner three primes: 2918779690625137, 6729216728661136606577017055290271857 and 644530914387083488233375393598279808770191171433362641802841314053534708129737067311868017 (a 90-digit prime!), respectively for d = 11, d = 29 and d = 73.

Comments: 2 Pages.

Download: PDF

Submission history

[v1] 2017-11-18 03:29:59

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