20171231, 22:32  #23 
Dec 2017
2·5^{2} Posts 
A prime number’s numerology can never add to a number N such that 3 divides N for N > 1.
Say we take a number 15. This is equal to 3 x 5. Because it is divisible by 3, then the numerology of this product, namely 15, will also add to a number that is divisible by 3. Since every prime number (apart from 3) is not divisible by 3, then the digits will simply not add to 6, 9, 12, 15, 18, 21, 24, ... etc. This is called the “Divisibility by 3 Rule”, and as a numerologist I believe you should know about this.
I am passionate in numerology as well and have made a conjecture on the numerology of A^2  B^2 for integers A and B. The only constraint is that if B = 0, then A is equivalent to 2, 4, 7 (mod 9). This conjecture also involves squared numbers, and particular cycles which I call “orbits”. I was able to prove this was true for B = 0, but not for the rest of the integers. If you are interested, you can private message me and I will send it to you :) 
20180101, 02:34  #24  
Dec 2017
2^{4}×3×5 Posts 
Quote:
I actually summed the P that is associated with the mersenne Prime to a numerology number. I would really like to add up the mersenne primes to a numerology number and see what they become as a numerology number but that might be to cumbersome 

20180101, 02:50  #25  
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2743_{16} Posts 
Quote:
Instead, what you apparently want to do it to compute Mod(2,9)^p1. That is almost instantaneous already, but you can do even better by doing math. Math will tell you that Mod(2,9)^p1 is a periodic function and repeats over every 6 values: Code:
p%6 0 1 2 3 4 5 Mod(2,9)^p1 0 1 3 7 6 4 So, for p>=5, if p%6 == 1 then your digital root of the Mersenne prime will be 1, else it will be 4. The end. 

20180101, 05:53  #26  
Feb 2017
10100101_{2} Posts 
Quote:
Oh, I thought you had summed up the digits of the mersenne primes themselves, but still interesting. As stated elsewhere numerology is a popular approach to find a pattern to any regular series, e.g 2,3,4,5,6,7,8.9 times tables, with interesting answers w.r.t the cycles of these, base 10. You might want to refer to Batalov post #22. In it he suggests that it might be easy to do the sum of the digits of the value of the mersenne numbers as well. MIGHT make for interesting results. I think that there might either be programme code in some software packages to do this, or the code gurus would know how to programme for this. 

20180101, 22:23  #27 
Feb 2017
3×5×11 Posts 
Hi Batalov
I have to hand it to you.... x mod 9 does return the sum of the digits of any number...amazing. I did not know this because I don't work with modulo function on a regular basis, except for narrow purposes of finding answers to specific modulo equations...has cost me dearly. I have spent hour upon hours adding digits of numbers in the past, often getting incorrect answers as you could imagine, not knowing x mod 9 delivered the answer instantaneously! Respect...aka AliG 
20181203, 01:52  #28  
Sep 2003
3·863 Posts 
Quote:
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Ideal groupings in number fields  carpetpool  Abstract Algebra & Algebraic Number Theory  3  20180113 18:13 
I think I found proof that no odd perfect numbers exist!  Philly314  Aliquot Sequences  3  20141116 14:58 
How to know if you found a mersenne prime.  Sutton Shin  PrimeNet  7  20121002 05:57 
Shortest sequence of numbers not found in M43  Xyzzy  Miscellaneous Math  41  20081108 17:57 
LLT numbers, linkd with Mersenne and Fermat numbers  T.Rex  Math  4  20050507 08:25 