[got your e-mail, Shachar Shemesh].
Sorry I can't continue off list, unless asked by "authorities", this
issue is very urgent and important to everybody, so I believe, we have
been cheated and lied for decades if not centuries by the government
of the United States of America and their agents, I must know that
actual humans read this and not robots or USA agents, if you want to
filter it out then just filter anything related to Quantum relativity
or prime numbers, But I will also define a better protocol for the
future, we will be able to do anything and program our own computers
and not depend on SMTP & Google, we will not ask people to "stop
sending us mail" but we may just decide not to read it (our friends
will help us decide what's more important and what's not).
I read about the disasters going on in Africa, and believe me you and
i are also affected by this conspiracy. How many hours did you spend
converting from binary to base ten, ASCII to UTF-8, HTTP:::// to
HTTP:// (no mistakes are allowed here! STAANDDAAARRDS!); Hebrew
(wanted to write Ivrit, but this computer doesn't support it) not
supported on your computer or you can't read it, while they are making
their money on our behalf big time, and if you think your RSA keys are
safe with them, I can tell you (TOP; TOP SECRET) they already know how
to find prime divisors in gilliseconds, it's like dividing 10/5, not
more complicated than that (I WILL PROVE THIS!), and it's the TOP, TOP
SECRET of the USA (plus RGB screens) and you know that encryption
technology is already top secret and you need permission from there,
if you think why my friend John Nash and me have been in their torture
hospitality, then they have a good reason to put me there again.
Anyway friends, we all know base 2 and base 10 (binary and decimal),
but did anybody try to divide numbers in base 3? it turns out to me
that it might be THAT EASY! Just convert your number to base 2 & base
3; then check both your number and the complement of it (binary
11-[any digit] for base 3), repeat this with ANY DIGIT and then go to
base 2;3;6;12;36;21 etc. etc. and you will find your divisors there.
If you don't believe me why don't you try for yourselves? convert the
number to base 3; if it divides by 3 you got one divisor, if not then
go on to base 6; then take the base 2 and base 3 numbers and put them
in base 6 - it must be compatible (if 1001 is a prime number, it
should be in all bases - actually it's not in ANY base and I will
prove this). Same with 111:seven. If it's a prime then 101010 should
be also a prime in base 10; (at lease 111 is a divisor), checked and
yes: 7 times 14430, base 10 is 101010. but why base 10? why not base
100? my calculator divides 100010001000 by 7 as 1428714300. Then I
will show you a simple algorithm how to find your divisors (the
Americans knew it already long time ago, top secret), but remember
that 1000/7 (base ten) is actually 142.857 (repeating....) and that
this number times 100010001 is actually 1428714300. This is the key to
success. Did you wonder why computers are allways binary and not base
3? This is the conspiracy. Never use floating point or this algorithm
will not work. Define your own numbers - you can use strings. And
remember - each digit must be represented exactly as it is - no
randomness or cutting allowed here. It will be a complete
deterministic algorithm: no guessing and no randomality whatsoever.
The complex numbers are not comlex enough for me, since they use
Euclidan geometry. So I will define more complex numbers for me. But
you can still use them, if you remember the golden triangle then
already your clock can tick the 12 times 30 degrees (pi/6), then of
course you can also define ANY degree and if you divide your number to
base 3600 (for example), the remainder can be just a nuclear supernova
which you can grow faster then the speed of American lies approaching
themselves looking at their own mirror. Then ANY number can be allways
converted to base 3600 (your ANY number, it will be very easy to
locate your divisors but you will have to use more dimensions than
two, this is another conspiracy. Let me show you just an example
(later I will program this).
But first, remember I don't want just to locate divisors. I am
receiving a "number" who is supposed to be "not prime", and I don't
know how much is the number because I could be living inside a black
hole, or hiding from the big bad Americans, and I don't want to reveal
anything before I find out who they are. So first, I will define the
first number (none: either one or zero) to be exactly haffway between
one and zero: both average and logarithmic average, so actually my o
(ono; or zero) will be haff (0.5) but ALSO haff logarithmic,
directional and the ONLY real prime number, can be also ANY number,
7.0 or 0.7 or 7/0 or 0/7 (division by o allowed here!), so for now I
will just call it "0//7-i//i-7//0" or sometimes maybe also 0/7/7/0 or
0.7.7.0 but remember it's not the good old "real positive 0.7" but can
be ANY complex number between 0 and 1 (to be defined).
The number 7 will be defined as the outer sphere of my "black hole",
nobody will be able to approach 7 if not understanding the rules, but
also 7 can be 1 or 1/7 or 1/google^7 or any number I want. If you are
approaching the speed of american lies [ght] and are already at the
0.7c; then double your speed you will not be 1.4c; but somewhere going
back or to another dimension, then remember that 0+0 is not the same
as 0-0 and think about newton's relativity first. 0 will be just not
accelerating or with the same acceleration as allways (depends on your
matter - 1916 relativity).
Anyway, the next number after 0.7.7.0 who is not a prime will be one,
symmetric to 0 (all numbers starting with 0 and ending with 0 are 0),
but then one will be just the reversed 0.7.7.0: 7.0.0.7 or
7//0-i//i-0//7; but since this is already not allowed, I will count
the number of 0's and 1's and create 2 permutations for 0, 3 for 1:
0::=="0//7-i//i-7//0" OR "0//7-[0//7]i//i[7//0]-7//0"
1::==0:replace 0/7 and multiply by either -i or -01 or +iii
so if I'm decodning strings here, I can just give them letters or
matrixes, or just as:
0::[ o//z-i//i-z//o | o//ii-zz//zz-ii//o ] // choose any strings you want here;
1::[ z//o-i-i///i-i-o//z | z//o-i-0110///0110-i-o//z | z//o-i+iii///iii+i-o//z ]
now, the next number MUST be a prime, but if they pretend it is not
then I will divide it for them! let's accept any number in base 36
(ANY base up to 36), then I will convert it to them to base 6, then
base 2 and base 3 would be the same number - if divided by prime
divisors then same prime divisors.
so let the number be ANY number in base 6 now (can be also base 36
from base 10), for example 127 * 8191 * 131071 * 524287; my calculator
says 71485234969173889. I could take this, but I want to show you
something. So I will change it to base 100; then take 99-[any digit]
and let's check this number (I will also convert right to left):
07.14.85.23.49.69.17.38.89 --> 92.85.14.76.50.30.82.61.10 (9 digits
base 100); then convert to 10.61.82.30.50.76.14.85.92; convert to base
10: 1.0.6.1.8.2.3.0.5.0.7.6.1.4.8.5.9.2 (18 digits, base 10, don't
know how to divide it!); then convert to base 6.6 (36): (and adding
dots):
0.1.0.0.1.0.0.1.1.2.0.2.0.3.0.0.0.5.0.0.1.1.1.0.0.1.0.4.1.2.0.5.1.3.0.2
that's 36 digits - ANY base and actually I might also maybe convert to
base 2 and 3 but for now let's work base 6. It should work better
maybe if I convert to bases 2;3 but base 6 is OK with me. It can be
also same number base 10; 11; 12; 21; 42; 36 or even YOUR PRIME NUMBER
BASE!
OK! now I have the number. remember that the last digit is like +0;
then from -0 go back (I need more dimensions, will define later) and
then I will just reverse it:
0.1.0.0.1.0.0.1.1.2.0.2.0.3.0.0.0.5.0.0.1.1.1.0.0.1.0.4.1.2.0.5.1.3.0.2::2.0.3.1.5.0.2.1.4.0.1.0.0.1.1.1.0.0.5.0.0.0.3.0.2.0.2.1.1.0.0.1.0.0.1.0
the dots :: point to me where the symmetry begins. Then, since they
already gave me a new two-digits ID number (don't know what they want
from me), still remember my old ID number so I will take the numbers
2489 from it, add 0 and 1 so there I have 012489; will present it as
"984210+012489" and that's my base counting (42 would be sufficient as
well); then I will just check if this number divides by 984210; if not
then all permutations of it and going back:
$number:==0.1.0.0.1.0.0.1.1.2.0.2.0.3.0.0.0.5.0.0.1.1.1.0.0.1.0.4.1.2.0.5.1.3.0.2::2.0.3.1.5.0.2.1.4.0.1.0.0.1.1.1.0.0.5.0.0.0.3.0.2.0.2.1.1.0.0.1.0.0.1.0
$mybase42:=="9.8.4.2.1.0+0.1.2.4.8.9";
strreplace:$number::[matrix: 0-->"0+0"; 1-->"1+1"; 2-->"2+2";
3-->"4+4"; 4-->"8+8"; 5-->"9+9"]
then I will try to divide the number with my number $mybase42; might
be easier in binary so maybe I should switch to binary. anyway: check
for strings and replace: create 3 strings and then each of them will
replace digits with it's adjacent digits. for example 1+1 will be
replaced with either 2+1 or 1+1 or 1+0 or 0+1 or 1+1 or 1+2; maybe six
times, then check again etc. matrix!
then I will rotate $mybase42: positive/negative:
$mybase42[0/1/2/4/8/9]::==$mybase42[0/9/1/8/2/4]
and check the number again. The idea is that I'm checking all
permutations here very quickly because they are adding, if the number
is not divided by 984210 then I check (984210!), if not then next step
(984210!!) and so on, then find the number who divides this number
(actually I don't have to be symmetric, I just want to because the
direction is for me to decide), then when I find the permutation who
divides this number, I divide this number to this permutation and
should find it's first 5 divisors NOT including my 0 (allways divides
any number, my only real prime number, but remember addition,
multiplication, logarithmic, any are the same in my math!); then I
should come out with the first 6 divisors of this number (going 6
dimensions simlultaneously) and believe me - the Americans know how to
do it for decades! I will try to program a working program when I
have time.
Anyway, when I rotate I also add somethings to my strings, then
strings who repeat themselves add to each other. It's like the pascal
triangle; something like this (but more dimensions):
(both linear and logarithmic:)
0.7 == 0/7 == 7/0 == 7.0 == 0.5 == 0.1 == ANY number (also complex)
0.7 ||| 7.0
0.7||7.0 +|||+ 0.7||7.0
0.7||7.0||0.7++|||++7.0||0.7||7.0
so you see, the plus signs grow much faster at the both sides of the
straight line, then all "black light" will go there and expand
exponentially; all permutations will be checked simultaneously and I
can even implement it on a linear computer, very fast dividing ANY
number BUT it will also work from real "black holes", no need to
program them, just accept radiation and it will appear. Actually all
"black matter" is like this such as my hair (except white hairs), same
with red matter, blue matter, green matter etc. Spacetime has colours
and they depend on us and our relativity to them; nobody's "colour
blinded" and that's just another US conspiracy.
When I have time I will try implementing a working software - I'm very
busy but TRUST me - the Americans already knew this long time ago and
they are hiding all this from all us, their slaves (is't it supposed
to be the end of slavery time in calendar)?
Anyway, the idea is to check each permutation simultaneously with
strings, replace and check again, convert to my base 42 (42 will do
fine here too; check it!; I just wanted to go exponentially faster)
and then when I can represent the number in base 42 - double/tripple
its size and find the divisors. It will be very simple even for big
numbers - no number is too big. But remember they are not numbers - it
can be my our your picture too! be careful and that's why we need our
own encryption system and not related to the United States. I'm so
pissed off with them - I already want to create a separate network not
related at all to the Internet (at least - not dependent on it). It
will not be owned by me or anybody - and will be zillion times faster.
But remember - they will do what they can to prevent it. It's a lot of
money involved. They can lose the entire domain name system, ICANN,
VERISIGN, everything! The whole nuclear secrets, going to the moon.
Everything! I can even relocate the moon for them. It's not a joke,
it's truth magic. When you understand what truth is, then the speed of
lies is the only one limited here. The speed of truth can never be
limited. Ask them how much is their speed of light, how much is one
lightyear + another lightyear, how much is one meter + one meter and
how much is one nanometer + two. There is no difference - I never saw
straight lightyears and there are never are. Why don't you see the
stars when you look at this screen? Because it's an RGB screen and we
are all brainwashed, my friends. we all are.
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]
