mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2010-01-31, 11:35   #1
Nunki
 
Nunki's Avatar
 
"R. E."
Apr 2007
France

278 Posts
Default Decomposition into weight * level + jump

Dear Mersenneforum,

Let be a(n) an integer sequence strictly increasing, we define :
the jump (gap, first difference) of a(n) by
d(n) = a(n+1) - a(n);
l(n) by
l(n) = largest l such that d(n) = a(n) mod l, 0 if no such l exists, or
l(n) = a(n) - d(n) if a(n) - d(n) > d(n), 0 otherwise;
the weight by
k(n) = smallest k such that d(n) = a(n) mod k, 0 if no such k exists, or
k(n) = smallest k greater than d(n), that divides l(n), 0 if l(n)=0;
The level by
L(n) = l(n) / k(n), 0 if k(n) = 0.
In the Euclidean division of a(n) by its weight k(n), the quotient is the level L(n), and the remainder is the jump d(n). We have the unique decomposition a(n) = k(n) * L(n) + d(n) = weight * level + jump when l(n) is different from 0 which can be rewritten when a(n+1) < (3/2) * a(n).
Principles of classification:
If for a(n), l(n) = k(n) = L(n) = 0 then a(n) is not classified.
If for a(n), l(n) <> 0 and k(n) > L(n) then a(n) is classified by level , if not then it is classified by weight.
The decomposition applied to the natural numbers is the sieve of Eratosthenes. Applied to prime numbers, this decomposition is used to obtain a new classification of primes:
http://reismann.free.fr/classement_en.php
We can do some interesting conjectures about this classification:
http://reismann.free.fr/conjecture_en.php
I made a big effort of presentation, I updated my web site, my preprint and created a user page on the oeisWiki:
http://reismann.free.fr/index_en.html
http://arxiv.org/abs/0711.0865
http://oeis.org/wiki/User:R%C3%A9mi_Eismann
All comments, criticisms, suggestions and help are welcome.

RĂ©mi.

PS: please the moderators, don't put this thread in Miscellaneous Math Threads, I don't claim anything just that I invented an original way to see the numbers and I want to share it.
PS2: Th oeisWiki is still under construction. At this time, the main content is derived from the classic OEIS, and all updates should be done there.
PS3: sorry for my poor English.
Nunki is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
TF bit level davieddy Puzzles 71 2013-12-22 07:26
ECM level program henryzz GMP-ECM 8 2012-09-15 17:00
Simple high jump physics davieddy Science & Technology 7 2012-08-07 22:59
Probability of TF per bit level James Heinrich PrimeNet 11 2011-01-26 20:07
Big jump up for me in Top Producers list (?) Freightyard PrimeNet 2 2009-11-07 19:48

All times are UTC. The time now is 23:23.

Tue May 18 23:23:01 UTC 2021 up 40 days, 18:03, 0 users, load averages: 1.37, 1.64, 1.76

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.