[msbiljanica]

Presupposition-Graduation, contact remanins , others will be deleted
Process:
P1- 4^-(s.0)5=¤(0(1))_f2541¤
P2- 4^-(s.1)5=¤1((2)1)_f254¤
P3- 4^-(s.2)5=510
P4- 4^-(s.3)5=255
P5- 4^-(s.4)5=4
General form
a^-(s.0)b=e
a^-(s.1)b=d
...
a^-(s.f)b=c
[S41]-graduation opposite subtraction
CM-[S41]-dot no know

This post has been edited by msbiljanica: 25 February 2012 - 02:56 AM

[msbiljanica]

Presupposition-Term written in abbreviated form
a: (..0)b=a
a: (..1)b=c
...
a: (..g)b=1
Process:
625: (..0)5=625 (..d) - counter divisions
625: (..1)5=125
625: (..2)5=25
626: (..3)5=5
625: (..4)5=1
--image--
[S42]-root
[S43]-counter divide
CM-[42] - know [43]-dot no know
_____________________
PDF [S43] - http://www.mediafire...435vx8lu7111n5f

[msbiljanica]

Presupposition-Term written in abbreviated form , number b is replaced with other numbers
,alternating
a:(..0)b=a
a:(..1)b=c
...
a:(..g)b=1
Process:
400:(..1)4=100
400:(..2)5=20
400:(..3)4=5
400:(..4)5=1
--image--
[S44]-inequality root
CM-[S44] -dot no know

[msbiljanica]

Presupposition-Part number (the number of gaps) negates the second number(gap number)
-one of then must be gaps numbers
Process:
--image--
P1- 0=¤3(1)2(1)2¤n(.0)¤2(2)2¤=1
P2- 1=¤3(1)2(1)2¤n(.1)¤2(2)2¤=1
P3- ¤1(2)1¤=¤3(1)2(1)2¤n(.2)¤2(2)2¤=2-image
P4- 1=¤3(1)2(1)2¤n(.3)¤2(2)2¤=1
P5- 0=¤3(1)2(1)2¤n(.4)¤2(2)2¤=1
P6- 1=¤3(1)2(1)2¤n(.5)¤2(2)2¤=2
P7- 0=¤3(1)2(1)2¤n(.6)¤2(2)2¤=1
P8- 0=¤3(1)2(1)2¤n(.7)¤2(2)2¤=0
P9- 0=¤3(1)2(1)2¤n(.8)¤2(2)2¤=0
P10- 0=¤3(1)2(1)2¤n(.9)¤2(2)2¤=0
General form
negates 1=a n (.c)b=negates 2
or
negates 1 =a n (.c)b
negates 2
[S45]-negates
CM-[S45] -dot no know

[msbiljanica]

Presupposition-Part number (the number of gaps) negates the second number(gap number)
-one of then must be gaps numbers, other parts are added
Process:
--image--
P1- 0=¤3(1)2(1)2¤n+(.0)¤2(2)2¤=1
¤2(2)2(1)2¤=
P2- 1 =¤3(1)2(1)2¤n+(.1)¤2(2)2¤=1
¤3(2)1(1)2¤=
P3- ¤1(2)1¤ =¤3(1)2(1)2¤n+(.2)¤2(2)2¤=2
¤3(4)2¤=
P4- 1 =¤3(1)2(1)2¤n+(.3)¤2(2)2¤=1
¤3(1)1(2)2¤=
P5- 0 =¤3(1)2(1)2¤n+(.4)¤2(2)2¤=1
¤3(1)2(2)2¤=
P6- 1 =¤3(1)2(1)2¤n+(.5)¤2(2)2¤=2
¤3(1)2(3)2¤=
P7- 0 =¤3(1)2(1)2¤n+(.6)¤2(2)2¤=1
¤3(1)2(1)1(2)2¤=
P8- 0 =¤3(1)2(1)2¤n+(.7)¤2(2)2¤=0
¤3(1)2(1)2(2)2¤=
P9- 0 =¤3(1)2(1)2¤n+(.8)¤2(2)2¤=0
¤3(1)2(1)3(2)2¤=
P10- 0 =¤3(1)2(1)2¤n+(.9)¤2(2)2¤=0
¤3(1)2(1)4(2)2¤=
General form
negates 1 =a n+(.c)b=negates 2
added=
or
negates 1 =a n+ (.c)b
negates 2=
added=
[S46]-negates added
CM-[S46] -dot no know

[msbiljanica]

Presupposition-Part number (the number of gaps) negates the second number(gap number)
-one of then must be gaps numbers, other parts who have contact where is deleted together
Process:
P1- 0=¤3(1)2(1)2¤n-(.0)¤2(2)2¤=1
2
P2- 1 =¤3(1)2(1)2¤n-(.1)¤2(2)2¤=1
¤1(6)2¤
P3- ¤1(2)1¤ =¤3(1)2(1)2¤n-(.2)¤2(2)2¤=2
¤2(6)1¤
P4- 1 =¤3(1)2(1)2¤n-(.3)¤2(2)2¤=1
3
P5- 0 =¤3(1)2(1)2¤n-(.4)¤2(2)2¤=1
¤3(6)1¤
P6- 1 =¤3(1)2(1)2¤n-(.5)¤2(2)2¤=2
¤3(1)1(4)2¤
P7- 1 =¤3(1)2(1)2¤n-(.6)¤2(2)2¤=1
¤3(1)2(4)2¤
P8- 0 =¤3(1)2(1)2¤n-(.7)¤2(2)2¤=0
¤3(1)2(5)2¤
P9- 0 =¤3(1)2(1)2¤n-(.8)¤2(2)2¤=0
¤3(1)2(1)1(1)1(2)2¤
P10- 0 =¤3(1)2(1)2¤n-(.9)¤2(2)2¤=0
¤3(1)2(1)4(2)2¤
--images--
General form
negates 1 =an-(.c)b=negates 2
suptraction
or
negates 1 =an-(.c)b
negates 2
suptraction
[S47]-negates subtraction
CM-[S47] -dot no know
________
images are in pdf (Download pdf)
PDF - https://docs.google....3eFJES1dsNkZPUQ

[msbiljanica]

Presupposition-Part number (the number of gaps) negates the second number(gap number)
-one of then must be gaps numbers,contact remains , the rest is deleted
Process:
P1- 0 =¤3(1)2(1)2¤n-(.0)¤2(2)2¤=1
¤2(2)2)¤
P2- 1 =¤3(1)2(1)2¤n-(.1)¤2(2)2¤=1
¤2(2)1¤
P3- ¤1(2)1¤ =¤3(1)2(1)2¤n-(.2)¤2(2)2¤=2
¤1(4)1¤
P4- 1=¤3(1)2(1)2¤n-(.3)¤2(2)2¤=1
¤1(2)2¤
P5- 0 =¤3(1)2(1)2¤n-(.4)¤2(2)2¤=1
¤2(2)1¤
P6- 1 =¤3(1)2(1)2¤n-(.5)¤2(2)2¤=2
1
P7- 1 =¤3(1)2(1)2¤n-(.6)¤2(2)2¤=1
1
P8- 0 =¤3(1)2(1)2¤n-(.7)¤2(2)2¤=0
2
P9- 0 =¤3(1)2(1)2¤n-(.8)¤2(2)2¤=0
1
P10- 0 =¤3(1)2(1)2¤n-(.9)¤2(2)2¤=0
0
--IMAGES--
General form
negates 1 =an-(.c)b=negates 2
opposite subtraction
or
negates 1 =an-(.c)b
negates 2
opposite subtraction
[S48]-negates opposite subtraction
CM-[S48] -dot no know

[msbiljanica]

Presupposition-In an operation number can be replaced by other numbers
Process:

P1 2+(s.0)3=5
P2 2+(s.0)4=6
P3 2+(s.0)5=7
P4 2+(s.0)6=8
P5 2+(s.0)x|3₁6|=y
General form
a#(s.q)b=c
a#(s.q)d=e
...
a#(s.q)f=g
a#(s.q)x|b_hf|=y ,#-calculation operations
[S49]-function
CM-[S49] -axiom ,real and infinite
_________________
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
2+(s.0)x|5₅38₃(_50_)₁₀90₇92|=y