Friends, if you want to see the math first, it's very simple:
Google says 1.00001000001 + 1.00001000001 [is: ]= 2.00002, of course he's lying again and it's 2.00002000002 (my calculator). Of course also 7.0000700007 + 7.000007000007 = 14.000077 (google lies) and 14.000077000707 ( my calculator; microsoft). Then of course for me it should work the same for 0.11110111110 + 0.11110111110 (binary) which is decimal [9 * (0.11110111110 + 0.11110111110) = 1.99982 [google lying] or 1.9998199998 Then of course, ANY prime number should be like that: (p+1+1/p)^2 but I will not check exponent 2 but exponent p! and then and number (N) p1*p2*p3*p4*p5 I will check (N+1+1/N)^N. The equation is actually logarithmic (haff positive; haff negative N) in MANY dimensions; so that (for example) log (base 984210) of 010010011202030005001110010412051302 haffed and exponented would be about 100050043488396370.6171470390084...... (microsoft calculator, not accurate...) Then, this number 1/xed is 9.9949981542584562121086387579778e-18 (floating point, mine will be accurate) and then you can already calculate the haff root of the average p1*p2*p3*p4*p5, then just exponent it and you will get the real primes, remember to check dimensions and divide properly and then I will receive as many divisors I want within O(the size of the number binary representaion) or something like this. Maybe twice as much but still very simple, nobody will be able to cheat me on this. Remember that I can distinguish between positive/negative zeros and no math will do this. Then if you continue with the example of google, even 14.000077 is enough to know that the prime number is 7; but for me it will be much easier - you will see. The Americans knew that already since the beginning of time counting! Here's another example: 101000.0000000101 + 101000.00000101 = 202000.0000010201 (101 is binary prime); // times 5; 1010000.0000051005 + 1010000.0000051005 = 2020000.000010201; 1010000.0000051005 + 1010000.00000051005 = 2020000.00000561055 1010000.0000051005 + 1010000.000000051005 = 2020000.000005151505 // times 0.49 (0.7*0.7); 989800.00000499849 + 989800.00000499849 = 1979600.00000999698 989800.0000027491695 + 989800.0000027491695 = 1979600.000005498339 989800.00000252423745 + 989800.00000252423745 = 1979600.0000050484749 // all agree on 1979600; [1979600 + [1/1979600]]^1979600 would be a very big number, but I could define only the middle part as what interests me. square root of [1979600] is 1406.9825 ; [1406.9825 + [1/1406.9825]] is 1406.9832; squared is 1979601.72508224 :: then 19796 is (101 times 196); 101 times 49 times 4; then 101 would be prime (any base). If instead I started with any other number then I would get it's divisors. Even if I receive one binary number whois a multiplication of two big primes - it will be very easy to locate them. Just expand them exponentially until I receive the combination of the original primes. For example: 92851476503082611 * 10000; haff [sq.] root is 30471540247.103133759239626326128 ; 30471540247.1031337592724438336 including opposite root (of course, should not let computer round like this). squared: 928514765030826110001.99999999951 1-30471540247.1031337592724438336 ::= -30471540246.1031337592724438336 then squared:928514764969883029508.79373248094 difference is 60943080493.2062675186 ; added 1/x: 60943080493.20626751861640875374 squared;divided by 40000: haffroot: 304715402 integer; 92851476503082611 mod 304715402 is: 287061007 now I can already represent 92851476503082611 as a permutation of 304715402 and 287061007, if I calculate 304715402!287061007! then 92851476503082611will divide them. but this is all done base ten automatically. I will do it my bases and then it will work. Uri First deadandalive Mobile Phone: +972-50-9007559 E-mail: [EMAIL PROTECTED] // [EMAIL PROTECTED] Update: Left HTTP, WWWW and port numbering. send me papers or to [EMAIL PROTECTED] . I completed my 0.1 version of real deadanyalive quantum relativity redefining back timespacing intergalactic worldwide [top secret: if you have any US ARMY* on your planet they will never allow it]. Recounting back every second since twice BCC doubling + not counting at all any uncountable; using only prime countable numbers equal to 21 (base 21 recursivley) who are all equal to 0base0 and 1base1 who are identical twins base 21 [21===the number of fingers;eyes;body parts & number of equal signs not equal counting both left to right; right to left and all 21 dimensions of nothing]. Read my autoreply for more information [my HTTP/SMTP not working]. - This message is confidential - ================================================================= To unsubscribe, send mail to [EMAIL PROTECTED] with the word "unsubscribe" in the message body, e.g., run the command echo unsubscribe | mail [EMAIL PROTECTED]
