Papers
Topics
Authors
Recent
Search
2000 character limit reached

6m Theorem for Prime numbers

Published 19 Sep 2018 in math.GM | (1810.02188v1)

Abstract: We show that for any $P= 6{m+1}.N -1 $ is a prime number for any $1 < N \le 13$ , $N \ne 8$ and $N \ne i{m+1}Mod(6i+1) $ where $ i \in Z+ $ and $ m \in $ $odd$ $Z+ $ for $1 < N \le 13$ and $N \ne 8$ and also we further discussed that $P= 6{m+1}.N -1 $ is a prime number for $ N >13 $ if and only if , $N \ne i{m+1}Mod(6i+1) +(6i +1)a $ $ ; i,a \le Z+ $

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.