![]() |
![]() |
#1 |
Dec 2017
24·3·5 Posts |
![]()
Fellow Gimpers,
To seek patterns in Mersenne Prime Numbers one must be creative. This made me turn to music for analyzing composite, prime and Mersenne numbers hopefully to see if there is a difference in the numbers. If the patterns are consistent in such massive integers above then further study must go forward for Mersenne number prediction. What I have done in these three videos is I took the formula 2^Number-1 applied it to 509, 522 and 521. Then I used the number string and input to the solfa cipher. The solfa cipher uses abc notation which takes numbers also and turns it into a mid file. Then I used some software to play it in drums while the input microphone internally received the music. https://www.wmich.edu/mus-theo/solfa-cipher/ After listening and watching the videos several times I notice the composite number is smooth, and the prime is medium smooth, but the Mersenne is a little rough sounding. So far this is a small bit of enticing information if it holds true for other numbers to study then I’m on to something. Enjoy my work so without no further eddo here are the videos. https://www.youtube.com/watch?v=phHkdW4WquM https://www.youtube.com/watch?v=EBITrzrs1J8 https://www.youtube.com/watch?v=MOG7P-kRwHY |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
2 holes in bizarre theorem about composite Mersenne Numbers | wildrabbitt | Math | 120 | 2016-09-29 21:52 |
New Factor leaves a C168 Mersenne Composite | wblipp | ElevenSmooth | 7 | 2013-01-17 02:54 |
Mersenne primes have highly composite p-1? | ATH | Math | 3 | 2009-06-15 13:11 |
Factoring highly composite Mersenne numbers | philmoore | Factoring | 21 | 2004-11-18 20:00 |
Mersenne composite using fibonacci | TTn | Math | 5 | 2002-11-23 03:54 |