is a tiny wandering imaginary dinosaur which migrated from AOL in October of 2008.


Thinking Lizard

About Me

My photo
Rhodingeedaddee is my node blog. See my other blogs and recent posts.

Guide

[6-16-2009 Update Insert: Most of what is in this space is now moot. I found out what I was doing wrong and have reinstated Archives and Labels searches. They do work. However, in certain cases you may prefer Labels to Archives. Example: 1976 Today begins in November of 2006 and concludes in December of 2006, but there are other related posts in other months. Note: Labels only shows 20 posts at a time. There are 21 hubs, making 21 (which is for 1976 Today) an older hub.] ********************************* to my online poems and song lyrics using Archives. Use hubs for finding archival locations but do not link through them. Originally an AOL Journal, where the archive system was nothing like the system here, this blog was migrated from there to here in October of 2008. Today (Memorial/Veteran's Day, May 25, 2009) I discovered a glitch when trying to use a Blogger archive. Now, it may be template-related, but I am unable to return to S M or to the dashboard once I am in the Archives. Therefore, I've decided on this approach: a month-by-month post guide. The sw you see in the codes here stood for Salchert's Weblog when I began it in November of 2006. It later became Sprintedon Hollow. AOL provided what were called entry numbers, but they weren't consistent, and they didn't begin at the first cardinal number. That is why the numbers after "sw" came to be part of a post's code. ************** Here then is the month-by-month post guide: *2006* November: 00001 through 00046 - December: 00047 through 00056 -- *2007* January: 00057 through 00137 - February: 00138 through 00241 - March: 00242 through 00295 - April: 00296 through 00356 - May: 00357 through 00437 - June: 00438 through 00527 - July: 00528 though 00550 - August: 00551 through 00610 - September: 00611 through 00625 - October: 00626 through 00657 - November: 00658 through 00729 - December: 00730 through 00762 -- *2008* January: 00763 through 00791 - February: 00792 through 00826 - March: 00827 through 00849 - April: 00850 through 00872 - May: 00873 through 00907 - June: 00908 through 00931 - July: 00932 through 00955 - August: 00956 through 00993 - September 00994 through 01005 - October: 01006 through 01007 - November: 01008 through 01011 - December: 01012 through 01014 -- *2009* January: 01015 through 01021 - February: 01022 through 01028 - March: 01029 through 01033 - April: 01034 through 01036 - May: 01037 through 01044 - ******************************************************* 1976 Today: 2006/11 and 2006/12 -- Rooted Sky 2007: 2007/01/00063rsc -- Postures 2007: 2007/01/sw00137pc -- Sets: 2007/02/sw00215sgc -- Venturings: 2007/03/00216vc -- The Undulant Trees: 2007/03/00266utc -- This Day's Poem: 2007/03/00267tdpc -- Autobio: 2007/04/sw00316ac -- Fond du Lac: 2007/04/00339fdl -- Justan Tamarind: 2007/05/sw00366jtc -- Prayers in December: 2007/05/sw00393pindc -- June 2007: 2007/06/sw00440junec -- Seminary: 2007/07/sw00533semc -- Scatterings: 2008/08/00958sc ** Song Lyrics: 2008/02/sw00797slc ********** 2009-06-02: Have set S M to show 200 posts per page. Unfortunately, you will need to scroll to nearly the bottom of a page to get to the next older/newer page.

Labels

Showing posts with label number theory. Show all posts
Showing posts with label number theory. Show all posts

Friday, May 2, 2008

sw00874math-3at4

22 There are two ways three adjacent integers can be related to "4" that are of interest to me. The one way I am not choosing first begins at zero. In the 6n Elimination Table the odd squares always occur in the +1 column, the column beginning with "7". In today's entry, "4" controls the distribution, but the first n is "1", and each n is a pown integer which is 2 > the preceding n, and "2" is the multiplier, and the odd squares always occur in the -1 column, and there is only one row. # 1 2 3 5 6 7 9 10 11 13 14 15 17 18 19 21 22 23 25 26 27 29 30 31 33 34 35 37 38 39 41 42 43 45 46 47 49 50 51 53 54 55 57 58 59 61 62 63 65 66 67 69 70 71 73 74 75 77 78 79 81 82 83 85 86 87 89 90 91 93 94 95 97 98 99 101 102 103 105 106 107 109 110 111 113 114 115 117 118 119 121 122 123 125 126 127 129 130 131 133 134 135 137 138 139 141 142 143 145 146 147 149 150 151 153 154 155 157 158 159 - final-digit rotations: 1 5 9 3 7; 2 6 0 4 8; 3 7 1 5 9 Since this row consists of groups of three adjacent integers, the first group having a prime pair is: 5 6 7 Beginning with 5 6 7, every group which is greater by "12" than the group preceding it/ might--except for those groups in which "4" or "6" is the final digit--contain a prime pair. The final-digit rotation is: 6 8 0 2 4. Here are the first four: 5 6 7 17 18 19 29 30 31 41 42 43 Beginning with 53 54 55, problems: 65 66 67 77 78 79 89 90 91 do not contain prime pairs because of "5" in the first two, and of "7" in the second two. In both cases "11" and "13" are the complicit multiplicands. Then comes 101 102 103, wherein 101 and 103 is a prime pair. Then comes 137 138 139, wherein 137 and 139 is a prime pair. Then comes 149 150 151, wherein 149 and 151 is a prime pair. Then comes 161 162 163, but/ 7 x 23 = 161. Notice: 23 - 11 = 12; 25 - 13 = 12. Okay, backtrack. 5 x 23 = 115 5 x 25 = 125 7 x 23 = 161 7 x 25 = 175 Further: 175 - 70 = 105; and 175 - 14 = 161, and 105 - 14 = 91 Also: 105 + 14 = 119, and 175 + 14 = 189 So these: 3 x 7, 5 x 7, 7 x 7; 13 x 7, 15 x 7, 17 x 7; 23 x 7, 25 x 7, 27 x 7 [ This means that "5" controls distribution--downwards and upwards-- for every pown including itself via a 1 x, 3 x, 5 x, 7 x, 9 x rotation of single digits and final digits. ] The node number "105" is a good small example of this/ because it isdivisible by 3 and 5 and 7, forcing "3" to 102 and 108; forcing "7" to 98 and 112; and thereby allowing 101, 103, 107, and 109 to be prime numbers. - "107" and "109" bring me to the second way, which I will begin at "4" instead of at "0". The rotation is: 4 8 2 6 0 3 4 5 7 8 9 11 12 13 15 16 17 19 20 21 23 24 25 27 28 29 31 32 33 35 36 37 39 40 41 43 44 45 47 48 49 51 52 53 55 56 57 59 60 61 63 64 65 67 68 69 71 72 73 75 76 77 79 80 81 83 84 85 87 88 89 91 92 93 95 96 97 99 100 101 103 104 105 107 108 109 111 112 113 115 116 117 119 120 121 123 124 125 127 128 129 131 132 133 135 136 137 139 140 141 143 144 145 147 148 149 151 152 153 155 156 157 159 160 161 163 164 165 167 168 169 In this view the pown squares always occur in the +1 column. After 3 4 5, wherever a "4" or a "6" is a final digit in a group, the powns in it cannot be a prime pair. Beginning with 11 12 13, it appears that only where the pewn of a group is divisible by "12" can its powns possibly be a prime pair. In this view it also appears there are fewer prime pairs. In the first view the first prime pair is in the 5 6 7 group. "6" is 6 x 1. In this view "12" is 6 x 2. I am deducing from this that in the first view the pewn in a group containing a prime pair will always be an odd multiple of "6", whereas in the second view the pewn in a group containing a prime pair will always be an even multiple of "6". # Brian A. J. Salchert

Friday, April 25, 2008

sw00870math-3zs5zs7zs.part2

Other integer knowns pertaining to primes and nonprimes: - 1. What I call Elimination Tables can be constructed/ wherein 2 x the pown (positive odd whole number) whose mulitples are being eliminated generates the first pewn divisible by that pown. That pewn and the integer multiples of it become C2 of a three-column table/ wherein C1 contains all the powns which are 1 less than each C2 pewn, and C3 contains all the powns which are 1 greater than each C2 pewn. If "3" and its multiples are the powns being eliminated, all the powns not divisble by "3" will be among the minor or major powns in the table. Many of these powns will be prime numbers, but note that all the squares of powns will be major powns. 2. Some facts about squares, powns, and pewns: a) Subtracting 1 from any pewn square whose final digit is 6 equals a pown which is divisible by "5". b) Subtracting 2 from any pown square often equals a pown which is a prime number, but there are some interesting exceptions. 119, or 7 x 17, is one of these. c) The recurring final-digit sequence for pewn squares is: 4, 6, 6, 4, 0; and the recurring final-digit sequence for pown squares is: 1, 9, 5, 9, 1. d) The Elimination Table for multiples of "3" is the 6n table. At each 6n (C2), the C1 pown and the C3 pown constitute a pair such as 5 7, 11 13, 17 19, 23 25, 29 31, 35 37, 41 43, 47 49, 53 55, 59 61, 65 67, 71 73, 77 79, 83 85, 89 91, 95 97, 101 103, 107 109, 113 115, 119 121. If this table is taken into infinity, all the possible prime pairs exist in it. e) Any integer whose final digit is 5, being divisible by "5", is automatically a nonprime. Therefore, for all powns > 9 only those powns whose final digits are 1 or 3 or 7 or 9 need be inspected for primality. f) 2 is the only pewn prime, and the only pown prime triad is: 3 5 7. g) An integer's power begins at its square. This is why "2" is the only pewn prime. This is also why the lesser of two pown integers is always the ruling eliminator of integers greater than itself. Brian A. J. Salchert

Thursday, April 24, 2008

sw00869math-3zs5zs7zs

( 3) 1+2 4+5 7+8 10+11 13+14 16+17 19+20 22+23 ( 5) 2+3 7+8 12+13 17+18 22+23 27+28 32+33 37+38 ( 7) 3+4 10+11 17+18 24+25 31+32 38+39 45+46 52+53 ( 9) 4+5 13+14 22+23 31+32 40+41 49+50 58+59 67+68 ( 11) 5+6 16+17 27+28 38+39 49+50 60+61 71+72 82+83 ( 13) 6+7 19+20 32+33 45+46 58+59 71+72 84+85 97+98 ( 15) 7+8 22+23 37+38 52+53 67+68 82+83 97+98 112+113

# About 1+2, 2+3, 3+4, and: The first # = the row #, and the second # indicates the column # where the square of the ( #) is. # Next: If the two adjacent #s which sum to a ( #) exists in a prior row, that ( #) is not a prime #. Example: 4+5 is in row 1 column 2, and 4+5 is also in row 4 column 1. # Next: Column 1 is the x1 column, C2 is the x3 column, C3 the x5, C4 the x7, C5 the x9, C6 the x11, C7 the x13; C8 the x15. So, (column # x2) - 1 = the times # for that column. # Next: Since 4+5 is in C2 of R1, which is 3s row, 4+5 = 3x3. # Next: That # which is the second # in R1C1 is the first in R2C1. This means that there are three distinct numbers C1 of any two adjacent rows. These three #s in C1 of R1 and R2 sum to 6. These three #s in C1 of R2 and R3 sum to 9. These three #s in R5 and R6 sum to 18, or 3x6. The ( #) in R5 is 11, and the ( #) in R6 is 13. 11+13=24, or 3x8. 24 - 18 = 6. Go back. 3+5=8; 8 - 6 = 2. 5+7=12; 12 - 9 = 3. So, the distinct #s in adjacent rows rise by 3, and ( #)s in adjacent rows rise by 4 when they are summed as terms in a set of adjacent rows. I am not yet certain what the value of knowing these facts is, but I suspect there is an interpolation value. # Next: A known about primes is that there is a prime number between n and 2n for every integer n > 1. If n = 2, 2n = 4. 3 is between 2 and 4. If n = 3, 2n = 6. 5 is between 3 and 6. If n = 4, 2n = 8. Both 5 and 7 are between 4 and 8. If n = 5, 2n = 10. Both 7 and 9 are between 5 and 10, but we know that 9, or (10 - 1), is not a prime. Between 8 and 16 are 9, 11, 13, and 15. Question: Why do 5+6 and 6+7 equal numbers which are prime numbers, while 4+5 and 7+8 do not? Brian A. J. Salchert

Followers