Welcome to the ToeQuest.
Page 1 of 4 1234 LastLast
Results 1 to 10 of 33

Thread: tame primes

  1. #1
    Raider of the lost time
    Join Date
    Nov 2003
    Location
    United States
    Posts
    11,778
    Blog Entries
    10
    Thanks Given
    1,106
    Thanked 1,472x in 1,192 Posts
    Rep Power
    158

    tame primes

    Using spreadsheet software an m by n infinite ordered matrix can be finitely modeled for finite arbitrary numbers of m-row and n-column such that m and n vary from 0, 1, 2, 3, 4, 5, 6, 7, 8…. For each matrix element calculation as a function of both m and n by this expression: e(m, n)=2m+3n. It can be noted that the following elements are prime numbers: (1,0)=2, (0,1)=3, (1,1)=5, (2,1)=7, (1,3)=11, (5,1)=13, (7,1)=17, (8, 1)=19, (10, 1)=23, (13, 1)=29, (14,1)=31, (17,1)=37, (19,1)=41, (20,1)=43, so on and so forth. Furthermore there are patterns of alternate even and odd columns with prime pattern distributions of single prime and twin primes. Likewise, the rows alternate between single row of mixed odd and even composite numbers and two consecutive rows of primes. Moreover, the entire set of whole numbers with the exception of unity are repeated in a pattern from lower left to upper right on both side of the diagonal. The elements along the diagonal are increasing multiples of 5. The numbers that are not repeated are: 0, 2, 3, 4, 5, 7. the numbers repeated twice are: 6, 8, 9, 10, 11, and 13. The numbers repeated 3 times are: 12, 14, 15, 16, 17, and 19. The numbers repeated 4 times are: 18, 20, 21, 22, 23, and 25. The numbers repeated 5 times are: 24, 26, 27, 28, 29, and 37. The numbers repeated 6 times are: 30, 32, 33, 34, 35, and 37. The numbers repeated 7 times are: 36, 38, 39, 40, 41, and 43. This pattern of groups of 6 elements seems to repeat with twin primes appearing in the same repeated group numbers.
    Time independence: [∂E(g)]²=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: a(tr(t)=c²

  2. #2
    Moderator
    Join Date
    Aug 2005
    Location
    United Kingdom
    Posts
    11,621
    Blog Entries
    5
    Thanks Given
    295
    Thanked 896x in 724 Posts
    Rep Power
    154

    Smile Re: tame primes

    What about the untamed prime of 1=on and zero=off!




    regards michael.
    Humilty,coupled with boldness,surprises truth to
    reveal herself?

  3. #3
    Grandmaster
    Join Date
    Feb 2007
    Location
    United States
    Posts
    11,904
    Blog Entries
    28
    Thanks Given
    1,782
    Thanked 3,989x in 2,767 Posts
    Rep Power
    181

    Awards Showcase

    Re: tame primes

    Contact Fredrick of ToeQuest—he did a lot of work on the patterns of primes—even proved '0' necessary.

  4. #4
    Raider of the lost time
    Join Date
    Nov 2003
    Location
    United States
    Posts
    11,778
    Blog Entries
    10
    Thanks Given
    1,106
    Thanked 1,472x in 1,192 Posts
    Rep Power
    158

    Re: tame primes

    Those are used for the binary digits inside a computer and fortunately a computer does not need to know prime reality using only 0 and 1, only base 10 users would be aware of prime integrity.
    Time independence: [∂E(g)]²=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: a(tr(t)=c²

  5. #5
    Moderator
    Join Date
    Aug 2005
    Location
    United Kingdom
    Posts
    11,621
    Blog Entries
    5
    Thanks Given
    295
    Thanked 896x in 724 Posts
    Rep Power
    154

    Smile Re: tame primes

    Quote Originally Posted by AntonioLao View Post
    Those are used for the binary digits inside a computer and fortunately a computer does not need to know prime reality using only 0 and 1, only base 10 users would be aware of prime integrity.
    Is not the intergrity of one,without equal?



    regards michael.
    Humilty,coupled with boldness,surprises truth to
    reveal herself?

  6. #6
    Raider of the lost time
    Join Date
    Nov 2003
    Location
    United States
    Posts
    11,778
    Blog Entries
    10
    Thanks Given
    1,106
    Thanked 1,472x in 1,192 Posts
    Rep Power
    158

    Re: tame primes

    Quote Originally Posted by austintorn@aol.com
    Contact Fredrick
    Thanks. Somehow I get the feeling that anyone working on proving Riemann Hypothesis and get the Clay Mathematics Institute reward of $1 Million for the Millenium Prize is not willing to share what they are doing.
    Time independence: [∂E(g)]²=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: a(tr(t)=c²

  7. #7
    Raider of the lost time
    Join Date
    Nov 2003
    Location
    United States
    Posts
    11,778
    Blog Entries
    10
    Thanks Given
    1,106
    Thanked 1,472x in 1,192 Posts
    Rep Power
    158

    Re: tame primes

    Quote Originally Posted by mkirkpatrick
    Is not the intergrity of one,without equal?
    This could be the reason why I prefer substituting 0 with -1 as appearing in Hadamard matrices. Nonetheless 1 and -1 are singulars with its individual integrity uncompromise.
    Time independence: [∂E(g)]²=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: a(tr(t)=c²

  8. #8
    Moderator
    Join Date
    Aug 2005
    Location
    United Kingdom
    Posts
    11,621
    Blog Entries
    5
    Thanks Given
    295
    Thanked 896x in 724 Posts
    Rep Power
    154

    Smile Re: tame primes

    Quote Originally Posted by AntonioLao View Post
    This could be the reason why I prefer substituting 0 with -1 as appearing in Hadamard matrices. Nonetheless 1 and -1 are singulars with its individual integrity uncompromise.
    The number 10 shown as a circle with a one in the centre is an ancient symbol for
    showing the number of creation-or of bringing the Un-manifest into manifestation.




    regards michael.
    Humilty,coupled with boldness,surprises truth to
    reveal herself?

  9. #9
    9th degree Black Belt
    Join Date
    May 2004
    Posts
    1,755
    Thanks Given
    736
    Thanked 355x in 258 Posts
    Rep Power
    52

    Re: tame primes

    Quote Originally Posted by AntonioLao View Post
    Using spreadsheet software an m by n infinite ordered matrix can be finitely modeled for finite arbitrary numbers of m-row and n-column such that m and n vary from 0, 1, 2, 3, 4, 5, 6, 7, 8…. For each matrix element calculation as a function of both m and n by this expression: e(m, n)=2m+3n. It can be noted that the following elements are prime numbers: (1,0)=2, (0,1)=3, (1,1)=5, (2,1)=7, (1,3)=11, (5,1)=13, (7,1)=17, (8, 1)=19, (10, 1)=23, (13, 1)=29, (14,1)=31, (17,1)=37, (19,1)=41, (20,1)=43, so on and so forth. Furthermore there are patterns of alternate even and odd columns with prime pattern distributions of single prime and twin primes. Likewise, the rows alternate between single row of mixed odd and even composite numbers and two consecutive rows of primes. Moreover, the entire set of whole numbers with the exception of unity are repeated in a pattern from lower left to upper right on both side of the diagonal. The elements along the diagonal are increasing multiples of 5. The numbers that are not repeated are: 0, 2, 3, 4, 5, 7. the numbers repeated twice are: 6, 8, 9, 10, 11, and 13. The numbers repeated 3 times are: 12, 14, 15, 16, 17, and 19. The numbers repeated 4 times are: 18, 20, 21, 22, 23, and 25. The numbers repeated 5 times are: 24, 26, 27, 28, 29, and 37. The numbers repeated 6 times are: 30, 32, 33, 34, 35, and 37. The numbers repeated 7 times are: 36, 38, 39, 40, 41, and 43. This pattern of groups of 6 elements seems to repeat with twin primes appearing in the same repeated group numbers.
    Quote Originally Posted by AntonioLao View Post
    Somehow I get the feeling that anyone working on proving Riemann Hypothesis and get the Clay Mathematics Institute reward of $1 Million for the Millenium Prize is not willing to share what they are doing.
    Hi Antonio,

    Here is some information in light of prime numbers:

    http://threes.com/cms/index.php?opti...2153&Itemid=50

    http://www.pentapublishing.com/Math.html

    The big secret of prime numbers is that prime numbers are not a phenomenon onto themselves; rather these numbers are the remaining product of something else: they are left unharmed by the Regime of Division reigning where they can on all numbers. Prime numbers are just the group left standing; indivisible by any other number than themselves and 1, they are the survivors of this harsh regime. The important message here: being a prime number is a circumstantial aspect, not an essential aspect.

    An example about relationships that I have used once before is the following:
    Ten people are involved in an accident, leaving six people with broken bones, and four people unhurt. You walk by and then we end up with a group of six people with broken bones and a group of five people unhurt. The former is based on a single occurrence, the latter is not. The unhurt numbers (prime numbers) should not be treated as a single group.

    Einstein already delivered us the relativity principle, and all you need to do is apply it to the prime numbers.

    What I like reading in your description are:

    A: "This pattern of groups of 6 elements seems to repeat with twin primes appearing in the same repeated group numbers."

    In the pentaist theory number 6 is the overall number of a dualist universe. Number 5 is actually the synergy number of what are really only four different elements. Of these four, 2 are actually different versions of just one single third element which on top of it all is only a circumstantial (yet vital) element, and the remaining 2 are the only ones of pure oppositional (and therefore
    delivering a dual) nature. The number 6 is the number of the phenomenon of nothing. Please, don't confuse the phenomenon of nothing with either nothing or nothingness.

    B: "
    Moreover, the entire set of whole numbers with the exception of unity are repeated in a pattern from lower left to upper right on both side of the diagonal."

    I italicized "with the exception of unity," because it is such a special number. As you can see in the first link I provided (containing a few parts that should be edited)
    of trees.com, 1 is actually a 'doubled' prime number. When knowing that duality reigns in our universe (but is somewhat polite towards unity) then each prime number can be seen as a dual number. For instance, 5 = 5 x 1. Each number can always be seen as itself x 1, and still be the same. If I add another 5 x to this equation, the outcome is changed of course into 25. Yet if I add another 1 x to this equation I truly get the same outcome, as in 5 x 1 x 1 = 5, or 5 x 1 x 1 x 1 x 1 x 1 x 1 x 1 = still just 5.

    All prime numbers (but not 1) are numbers that have one part of 'unity' and one part that is divisible just by themselves. The number 1 (not considered a prime number anymore since Peano created his five axioms for the natural numbers) has two parts of this unity. It is the only number that is a prime number twice.

    While there is an abundance of relationships to be found between prime numbers, and prime numbers can quickly be computed nowadays in seconds, these numbers do not belong to a universe that is based on singularity, for such universe could not exist. The prime numbers belong to our real universe.

    Can I collect my million dollar award now?


    The difference between a structure based on unification and a structure without unification hinges on the question if nothing is just plain nothing or if nothing is mighty fundamental. Read In Search of a Cyclops with titillating mathematical evidence (see homepage) to find out if separation belongs to the fundamental basics of our universe - or not.

  10. #10
    Raider of the lost time
    Join Date
    Nov 2003
    Location
    United States
    Posts
    11,778
    Blog Entries
    10
    Thanks Given
    1,106
    Thanked 1,472x in 1,192 Posts
    Rep Power
    158

    Re: tame primes

    Quote Originally Posted by Fredrick
    prime numbers can quickly be computed nowadays in seconds,
    Thanks. What I can provide might be Fermat's lost algorithm on primes factorization. the calculation check out on the TI-84 up to 8-digit numbers. I would like to test the same in a supercomuter and maybe compare to others. As a bonus, I can also throw in the algorithmic proof for Goldbach conjecture. Maybe you and me can share the millennium prize when this algorithm is accepted as the correct one for also proving Riemann Hypothesis.
    Time independence: [∂E(g)]²=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: a(tr(t)=c²

 

 
Page 1 of 4 1234 LastLast

Thread Information

Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  
Back to top