2000 character limit reached
6m Theorem for Prime numbers (1810.02188v1)
Published 19 Sep 2018 in math.GM
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+ $
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.