srdanova math

[msbiljanica]

Presupposition-In terms a×(s.c)b , multiplication
Process:
P1 4×(s.0)4=16
P2 4×(s.1)4=13 image
P3 4×(s.2)4=10
P4 4×(s.3)4=7
P5 4×(s.4)4=4

P1 ¤1(2)1¤×(s.0)4=¤1(2)2(2)2(2)2(2)1¤
P2 ¤1(2)1¤×(s.1)4=¤1(2)1(2)1(2)1(2)1¤ image
P3 ¤1(2)1¤×(s.2)4=¤1(1)6(1)1¤
P4 ¤1(2)1¤×(s.3)4=7
P5 ¤1(2)1¤×(s.4)4=¤1(2)1¤

General form
a×(s.0)b=c
a×(s.1)b=c
...
a×(c.d)b=c

[S32b]-multiplication
CM-[S32b]-know a×(s.0)b other do not know , forms withuut any gaps numbers not known

 

[msbiljanica]

PDF - srdanova math.pdf
___________________________________________
Presupposition-The numbers are multiplication , where a contact is deleted
Process:
P1 4 × (s.0)4=¤4(0)4(0)4(0)4¤
P2 4 × (s.1)4=¤3(1)2(1)2(1)3¤ image
P3 4 × (s.2)4=¤2(6)2¤
P4 4 × (s.3)4=¤1(5)1¤
P5 4 × (s.4)4=0

General form
a × (s.0)b=c
a × (s.1)b=c
...
a × (c.d)b=c

[S29]-multiplication subtraction
CM-[S29]-does no know
×You will see a sign in the PDF

 

[msbiljanica]

Presupposition-The numbers are multiplication , contact remains the rest is deleted
Process:
P1 4 × (s.0)4=0
P2 4 × (s.1)4=¤1(2)1(2)1¤ image
P3 4 × (s.2)4=6
P4 4 × (s.3)4=5
P5 4 × (s.4)4=4

General form
a × (s.0)b=c
a ×(s.1)b=c
...
a × (s.d)b=c

[S30]-multiplication opposite subtraction
CM-[S30]-does no know

 

[msbiljanica]

Presupposition-Three (more) merger (multiplication )
Process:
P1 5×(s.3ß3)5=¤1(1)1¤ - image
P2 5×(s.4ß3)5=¤1(3)1¤ - image
5×(s.4ß4)5=¤1(1)1¤ -image
5×(s.4ß5)5=1- image
P3 5×(s.5ß5)=5

General form
a#(s.1ß3)b=c
a#(s.2ßd)b=c
...
a#(s.eßf)b=c , #- calculation operations (×,...)

[S31]-srki
CM-[S31]-does no know

 

[msbiljanica]

Presupposition-Three (more) gap merger (multiplication )
Process:
P1 ¤1(4)1¤×(s.5¤ß3)5=¤1(2)1¤ - image
¤1(4)1¤×(s.5¤ß4)5=2-image
P2 ¤1(4)1¤×(s.6¤ß4)5=4

General form
a#(s.1¤ß3)b=c
a#(s.2¤ßd)b=c
...
a#(s.e¤ßf)b=c , #- calculation operations (×,...)

[S32]-gap srki
CM-[S32]-does no know

 

[msbiljanica]

Presupposition-Srki and gap srki merger (multiplication )
Process:
P1 ¤1(7)1¤=¤1(1)1(1)1(1)1¤×(s.5¤|ß3)6=¤1(1)1(1)1(1)1¤
¤1(1)1(1)1¤=¤1(1)1(1)1(1)¤×(s.5¤|ß4)6=0
P2 4=¤1(1)1(1)1(1)1¤×(s.6¤|ß3)6=2 image
P3 ¤1(1)1(1)1(1)1¤=¤1(1)1(1)1(1)1¤×(s.7¤|ß6)6=¤1(1)1(1)1¤

General form
w=a#(s.1¤|ß3)b=c
w=a#(s.2¤|ßd)b=c
...
w=a#(s.e¤|ßf)b=c , #- calculation operations (×,...)

[S33]-two srki
CM-[S33]-does no know
Note - this is a two-way calculation, and therefore has two equals signs left(srki) right(gap srki)

 

[MeBelle]

I think he's passing secrets to the Ruskies!

 

[msbiljanica]

Presupposition-Subtraction form a-(s.0/s.0)b=0,a-(s.0/s.0)b-(s.0/s.0)b=0 , ...,a-(s.0/s.0)b-
...-(s.0/s.0)b=0 can be written differently counting the subtraction
Process:
P1 12-(..0)4=12 (..c) -counting the subtraction
12-(..1)4=8
12-(..2)4=4
12-(..3)4=0
12:4=3
General form
a-(..0)b=a
a-(..1)b=c
...
a-(..d)b=0
a:b=d

[S34]-counting the subtraction
[S35]-divide
CM-[S34]-does no know ,[S35]-know, axiom

 

[msbiljanica]

Presupposition-Subtraction form a-(s.0/s.0)b=0,a-(s.0/s.0)b-(s.0/s.0)b=0 , ...,a-(s.0/s.0)b-
...-(s.0/s.0)b=0, number b can replaced b=((s.0/s.0)c-(s./s.0)d) , b=((s.0/s.0)c-(s.0/s.0)d-
(s./s.0)e),...,b=((s.0/s.0)c-...-(s.0/s.0)w) , can be written differently counting the subtraction
Process:
P1 12-(..0)112=12
12-(..1)112=11
12-(..2)112=9
12-(..3)112=8
12-(..4)112=6
12-(..5)112=5
12-(..6)112=3
12-(..7)112=2
12-(..8)112=0
12:112=8
General form
a-(..0)bef=a
a-(..1)bef=c
...
a-(..d)bef=0
a:bef=d ...
[S36]-inequality divide
CM-[S36]-does no know

________________________
PDF - srdanova math [S36].pdf

 

[msbiljanica]

Presupposition-Two ( more) multiplying the same numbers can be for short write
Process:
P1 a×(s.c)a=a^(s.c)2, a^(s.a)b
P2 a×(s.c)a×(s.c)a=a^(s.a)3 , a^(s.a)b
P3 a×(s.c)a×(s.c)a×(s.c)a=a^(s.a)4 ,a^(s.a)b
...
General form
a^(s.a)b
[S37]-graduation
CM-[S37]-know,axiom
__________________________________
Presupposition-In terms a^(s.a)b , b can be number 0 (1)
Process:
P1 a^(s.a)0
P2 a^(s.a)1
[S37a]-graduation -amendment

 

[msbiljanica]

Presupposition-Graduation
Process:
P1- 4^(s.0)5=1024
P2- 4^(s.1)5=769
P3- 4^(s.2)5=514
P4- 4^(s.3)5=259
P5- 4^(s.4)5=4
General form
a^(s.0)b=c
a^(s.1)b=d
...
a^(s.e)b=a
[S37b]-graduation
CM-[S37b]-know a^(s.0)b=c , other do not know

 

[msbiljanica]

Presupposition-Two ( more) same number are abbreviated
Process:
P1- {4,4}=4f2
P2-{4,4,4}=4f3
P3-{4,4,4,4}=4f4
....
General form
{a,a}=af2
{a,a,a}=af3
...
{a,...,a}?=afn
[S38]-the same numbers
CM-[S38]- do not know

 

[Outback]

A form of matrix math for circuitry?

 

[msbiljanica]

Presupposition- Part gap number of repetitive two ( more) times
Process:
P1-¤5(1)1(1)1(1)1¤ - ¤5((1)1)f3¤
P2-¤6(2)3(4)3(4)3(4)3(4)5¤ -¤(6(2)(3(4))f45¤
...
General form
¤b((c )d)fn¤
¤b(c )(a(d))fng¤
...
[S39]-the same part gap number
CM-[S39]- do not know

 

[msbiljanica]

Presupposition-Graduation, contact is deleted
Process:
P1- 4^(s.0)5=¤4((0)4)f255¤
P2- 4^(s.1)5=¤3((1)2)f2543¤
P3- 4^(s.2)5=¤2(508)2¤
P4- 4^(s.3)5=¤1(254)1¤
P5- 4^(s.4)5=0
General form
a^(s.0)b=c
a^(s.1)b=d
...
a^(s.e)b=0


[S40]-graduation subtraction
CM-[S40]-dot no know

 

[msbiljanica]

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

 

[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

[S42]-root
[S43]-counter divide
CM-[42] - know [43]-dot no know
_____________________
PDF [S43] - srdanova math [S43].pdf

 

[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

[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:

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:

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