the smallest number of the signs + and ♦, by {means} of which it is
possible to
express all the numbers from 1 to m. In order to obtain from theorem
2
the
eva-luation of L(m), we assume that /«l, Pa«*. *»«2, &¡^0, if 1^2.
In
this case,
it is possible to find a more accurate value off,, namely c,«4.
Here,
j> <«)-!,
♦(*}«* t. The inequality(20) takes the for ia of» leg, 8 < logs
m,VJe
■•Mathe-matical Congress 2, 149.5. Povarov G-, M. Synthesis of
endlichen und unendlichen Graphen,Leipzig, 1936. ■Received by Editor
In:atmiacnisimollisposu:out
In: Translations
abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ
i n
a t
m:
i
a
c
n
i s
i n
a t
m:o
l
l
i s
p
o s u
e r
e vwxyzABCDEFGHIJKLMNOP
r
a e s
e n t v
e n
e n
a n
n t
i s
e r
a t
n
e
c v
u
l p u
t
a t
e m o
l
e st
i
e
e
l
i t
f
e l
i s
d i
c tu
m
l
e o
no
n
f
a u
c i
b u
s
r
i s u
s
e r
a t
in: of r :: out of
P: ra :: out of
s: :: out of
n: tv :: out of
n: :: out of
n: atis :: out of
r: at
n: :: out of
0
0
Cd
QCd
00
Q
~Cd
0</PB></P>
</DIV1>
</BODY>
</TEXT>
</TEI.2>
</MOA>
(@)Copyright. 2009. M. Michael Musatov. All Rights Reserved.
grati