Log in

View Full Version : srdanova math



msbiljanica
20th January 2012, 12:11
questions
1.Z÷(10^n)=?,Z-integers
2.write in abbreviated form (if the function can be final and natural)
2+5=7 , 2+10=12 , 2+15=17, 2+20=22 , 2+25=27 , 2+30=32 , 2+35=37 , 2+38=40,
2+40=42, 2+41=43 , 2+44=46 , 2+45=47, 2+47=49 , 2+50=52 ,2+57=59 , 2+60=62 ,
2+64=66, 2+70=72, 2+71=73 , 2+78=80 , 2+80=82 , 2+85=87 , 2+90=92 ,2+92=94
3.how to solve this current knowledge of mathematics:
along a (20m) ,deleted between 10 m and 15 m (b=5m) , wet get c (image)
Deleted personally identifiable info.
Can mathematics explain the only two axiom that the rest are just evidence (experiments), if you think so join me show you Srdanova math, see you
natural axiom
What is " nature along "?
-nature along in figure 1
What is "point"?
-start (end) natural long in figure 2
8564
What is the " basic rule "?
-basic rule is determined that the two ( more) longer only have to connect the points
[Sn]-mathematical facts
[S1]-nature along
[S2]-point (natural meaning of)
Definition[natural along]-two points , distance between two points
CM (current mathematics)-[S1]-does not know , [S2]-point is not defined , so anything and everything

msbiljanica
18th February 2012, 08:55
NATURAL MATHEMATICS



Presupposition-natural long merge points in the direction of the first natural along AB
Process:
P1-AB..CD..ABC(AC)
to read- natural along AB to point B, is connected to the natural long CD to point C, shall be
P2-ABC(AC)..DE..ABCD(AD)
read- along the ABC(AC) to point C , connecting with the natural long DE to point D is done
renaming of points , we get along ABCD(AD)
P3-ABCD(AD)..EF..ABCDE(AE)
...
8600

[S3]-along (natural basis)
Definition[along]-the first and last point and the distance between points
CM-[S3]-does not know
__________________________________________________ ____________
Presupposition - All points of a longer (the infinite form) can be replaced with labels: (0), (0,1 ),...,
(0,1,2,3,4,5,6,7,8,9 ),...
Process:
P1-N (0) = {0,00,000,0000,...}
P2-N (0,1) = {0,1,10,11,100,...}
...
P10-N (0,1,2,3,4,5,6,7,8,9) = {0,1,2,3,4,5,6,7,8,9,10,11, ...}
...
8601
[S4]-number along
[S5]-set of natural numbers N
We will use N (0,1,2,3,4,5,6,7,8,9) = {0,1,2,3,4,5,6,7,8,9,10,11,12,...}
Definition[number along]- a starting point (0), the last point at infinity
[number N]-The number 0 is the point 0
-Other numbers are longer, the first item is 0, the last point is the point of the name (number)
CM-[S4].does not know , [S5]-axiom
______________________
Presupposition-Numbers have their points
Process:
P1 0=(.0)
P2 1={(.0),(.1)}
P3 2={(.0),(.1),(.2)}
P4 3={(.0),(.1),(.2),(.3)}
P5 4={(.0),(.1),(.2),(.3),(.4)}
...
8602
[S6]-number points
CM-[S6]does not know

msbiljanica
19th February 2012, 13:20
Presupposition-point numbers have opposite
The process:
P1-0 = (s.0)
P2-1 = (s.0, 1)
P3-2 = (s.0, 1.2)
P4-3 = (s.0, 1,2,3)
P5-4 = (s.0, 1,2,3,4)
...
8604
[S7]-opposite point of
CM-I do not know the opposite point of
___________________________________
Presupposition-numbers are comparable with each other
The process:
P1-two numbers (a, b) are comparable with each other - a> b, a = b, a <b, ).(=(>,=,<)
P2-three numbers (a, b, c) are comparable with each other
8605
P3-four numbers (a, b, c, d) are comparable with each other
8606
...
[S8]-comparability issues
CM-known two of comparability, comparability of three numbers (a number comparable with the number of the PC),comparability of the other knows. b, a = b, a

Blake's Baby
19th February 2012, 23:24
Is anyone playing this game?

Or is he doing it just to get it out of his system?

Is it elaborate spam?

Are there hidden messages?

Enquiring minds want to know!

Oh, no wait, scratch that.

Q
19th February 2012, 23:34
Is anyone playing this game?

Or is he doing it just to get it out of his system?

Is it elaborate spam?

Are there hidden messages?

Enquiring minds want to know!

Oh, no wait, scratch that.

The actual message is a porn website for geeks.

msbiljanica
20th February 2012, 17:07
Presupposition-number ranges for number along
Process:
P1-image
P2-image
P3-image
8608
[S9]-mobility of number
CM-[S9]-does not know
________________-
Presupposition-Number (a) and mobile number (b ) but have no contact with the item
Process:
P1 ¤3(0)2¤
P2 ¤3(1)2¤
P3 ¤3(2)2¤
...
8609
Next - gap number and mobile number have no contact , except to point
...
[S10]-gap number GN={¤a(b)c¤,...,¤g(f)...(d)e¤}
[S11]-gap along
Definition[gap along] a>0-¤0(0)0¤-point
-¤0(a)0¤-two point ,separated by a gap
-¤a(0)0¤,¤0(0)a¤,¤a(0)a¤-along , two points
-¤a(a)a¤-two along , 4 points
...
CM-[S10],[S11] -does no know
______________________________________________
Third Now we can describe ( c ) the number of gaps ,¤10m(5m)5m¤
__________________________________
Presupposition-Number (a) and mobile number (b ) of a contat ,merge
Proces:
P1 3+(.0/.0)2=3
P2 3+(.1/.0)2=3
P3 3+(.2/.0)2=4 - image
P4 3+(.3/.0)2=5
8610
designation means the more we write (.0/.0) , unless specifically indicated to be
P1 3+(.0)2=3
P2 3+(.1)2=3
P3 3+(.2)2=4
P4 3+(.3)2=5
General form
a+(.0)b=c
a+(.1)b=c
...
a+(.d)b=c
[S12]-addition
CM-only form a+(s.0/.0)b=c , others do not know , axiom

msbiljanica
21st February 2012, 16:35
Presupposition-Gap number is comparable with the gap number and number
Process:
P1 ¤a(b)c¤ , a+(s.0)c=z
P2 ¤a(b)c(d)e¤ , a+(s.0)c+(s.0)e=z
P3 ¤a(b)c(d)e(f)g¤ ,a+(s.0)c+(s.0)e+(s.0)g=z
...
number z as it compares as a number of
[S13]-comparability gap numbers
CM-[S13]-does no know
__________________________________________________
Presupposition-Adding the result can be written in short form:
a) a+(s.0)0 , a+(s.0)b , a+(s.0)b+(s.0)b , ...,a+(s.0)b+...+(s.0)b
b ) a+(s.0)b+...+(s.0)b,...,a+(s.0)b+(s.0)b, a+(s.0)b , a+(s.0)0
Process:
P1 - 3+(s.0)0=3 , 3+(s.0)4=7 , 347
3+(s.0)0=3 , 3+(s.0)4=7 , 3+(s.0)4+(s.0)4=11 , 3411
3+(s.0)0=3 , 3+(s.0)4=7 , 3+(s.0)4+(s.0)4=11 , 3+(s.0)4+(s.0)4+(s.0)4=15 , 3415
...
3+(s.0)0=3 , ... , 3+(s.0)4+...+(s.0)4=d , 34

P2 - 3+(s.0)4+(s.0)4+(s.0)4=15 , 3+(s.0)4+(s.0)4=11 , 3+(s.0)4=7 , 3+(s.0)0=3 , 1543
...
3+(s.0)4=7 , 3+(s.0)0=3 , 743
General form -abc , ab
[S14]-srcko
CM-[S14]-does no know
_________________________
Presupposition-Srcko can join a number not that can not be in the structure srcko
Process:
P1 101070 and 5 , 5_101070
P2 5520 and 22 ,5520_22
P3 75 and 25 , 75_25
P4 68 and 2 ,2_68
...
General form -abc_d , d_abc , ab_d ,d_ab...
[S15]-pendant srcko
CM-[S15]-does no know
Note-only one number can be pendand , number two goes into a complex srcko

MarxSchmarx
22nd February 2012, 05:28
msbiljanca - posting personally identifiable information is against the rules here.