I will be posting everything i can here, but slowly, as the memories recall themselves to me. the first will be an algorithim for find prime numbers. these things are my children, please respect them and keep them safe from those who would patent and call them there own. I don't believe you can own math myself.
Enjoy :)
Byway, my name is Brian C. Bradley.
Here is my algorithim to finding prime numbers.
WHERE N IS EVEN WHERE N IS ODD
(1.5N)-1=(p[3]) (1.5N)-0.5=(p[3]) AND AN INTEGER
(1.5N)=(p[1,7]) (1.5N)-0.5=(p[1,7]) AND AN INTEGER
(1.5(N-1)+0.5=(p[9]) (0.5N)x2+(0.5N+0.5)=(p[9]) NOT DIVISIBLE BY 3
N+1=(p[9]) (0.5N)x2+2=(p[9]) DIVISIBLE BY 3
once figured, list the numbers
P3{2,4,5,7,8,...}
P1{3,4,6,7,9,...}
P7{3,4,6,7,9,...}
P9{2,5,7,8,...}
the primes are set up as {?}|P
so that the primes are 23,29,31,37,41,43,47,53,59,61,67,71,73,77,79,83,89,91,97,etc.
to get these primes I only had to plug in counting number to N, 1,2,3,4,5,6,etc. but i didn't use 1 becaue prime numbers that low include 5 and 2, which are unique in that no other primes are divisible by 5 or are even.
I may be posting my methods and sciences later. PROTECT IT!
my name is Brian C. Bradley.
Very interesting stuff. How long did it take you to figure out the algorithm?
I got bored and decided to read a book called "The Universal Book of Mathmatics, by david darling."
I read it from front to back, and afterwards I was intrigued by a fractal of the representation of all the known primes. The author remarked that no pattern existed but it seemed to follow a beutiful repition.
I don't believe in impossibilities, so I abandoned what I was taught about "proper mathematics" and adopted my own.
It relies not on proof, facts or fact-nots, but it does rely on patterns, completely and soley. I do require a large amount of data to find patterns though, so prime number, the digits of pi, and related subjects are the only uses I could find.
For your amusement however you can give me any large amount of numbers or text or similar thing and I can find a pattern.
It took 27 hours on paper to answer your question.
You know what? I guess it would be easier for you if I just listed my methods. On paper i have it written...
I theorize that in terms of patterns or sequences, when attempted to collapse into a digital function or constant, that it may be impractical if the restraint of a single or binary dimension is imposed, such as restriction of existence, or value. Relativity must be applied to itself!
{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, ...}[N]=All Real Numbers
N*a = any value in [N]
N*b = diffrent value in [N]
t> = next term
t = current term
Real numbers N*a|t|+1=N*b|t>|
;
Odd or even numbers N*a|t|+2=N*b|t>|
:
obviously if we use the same set above[N] then we can only achieve an odd number half of the time, because the other half is even and t/N*a is not always divisable by 2. An odd number can be discovered by plugging any number into a more complex relation and using the (N*a|t|+2=N*b|t>| to find more. Even numbers can be discovered in a similar way, finding more with the same relation.
The arbitrary +1 can be assumed to be a recipricol of occurence, or an implication of an apearence in the parent set equal to 1/1
;
(N*a|t|2)+1=N*b||>N*a|t|+1||
;
(N*a|t|2)+N*b|>N*a|t||
:
The special operator x2 and the involvement of ROO (recipricol of occurence) togethor in plaintext implies that any number x2 is even and any number that is even, +1 is odd.
;
(I doodled for a while trying to sniff out patterns)
:
The question for prime numbers isn't how many odd numbers when added make an even number (they all do) but what is the redudancy, and how many odd numbers are required. Most obviously the even numbers take up 50% of [N] so that atleast 25% is required to make an even value. all prime numbers are odd(exculding2) and my observation is thata rectangle with and odd area squared when doubled is of course even but a rectangle with an even area squared when dived isn't always odd. Prime numbers greater than 10 always end in 1, 3, 7, or 9.
I have listed their monodigit sum for all 16 combinations. any number ending in 2, 4, 6, or 8 is even. the underlined sums are ten greater than their showed value, thus carrying a one to the tens digit, regardless any number ending in either 0,2,4,6,or8 can be constructed from two odd number thus... (I could go on and on)
1-3---7-9
24-8-0---
-46-02---
---80-46-
----02-68
I think a lot of people don't know what to do with these, you should write a program using your algorithims and release them. You could just make a basic text program that allows you to pick which algo your going to use then processes data based on an input variable.
i am reading about batch files right now.
Siphaxer Wrote:The author remarked that no pattern existed
If you mean for prime numbers then you must have misinterperated what the author said, There are tens, possibly hundreds or thousands of different algorithms that exist for finding prime numbers, though depending on what percentage of accuracy you want to get, some of them can take some time, I personally have used at least five seperate algo's made by other people written in C when I needed to find primes...Also note the algorithm for RSA encryption is based on the fact that you can't factorise to large primes in polynomial time, as it uses large primes to calculate the result.
The one I just made is 100% accurate, for every prime.
and though I don't exactly know what algortihim your talking about, I made something like it when I was trying to invent my own. anyway, it doesn't require bruteforce. You put in the number 2, it spits out 3-4 primes. you put in the number 3 it spits out 3-4 primes. Simply put, it assumes that all primes larger than ten end in 1, 3, 7, or 9 & all thats left is to figure out what they begin with. that is what the input is modified to find, based upon if the input is even or odd, or divisible by three!