(175 ) 
sn) 
mt = 7) (mod. n), 
when for brevity is put 
u) 
= 4 
= es (m,n) = n (in, n). 
Al 
From this follows the generalised theorem of FeERMAT of this 
region of numbers 
m?@) = 1 (mod. n). 
Now however the congruence exists 
é (v (pi)s P (Pores +s PC ps*)) 
a = 1 (mod. n), 
because the exponent of m is a multiple of each of the arguments 
of the function V (of the least common multiple of the arguments). 
Consequently the above mentioned power is congruent to 1 owing 
to the just named theorem according to each single one of the 
prime number powers p,‘a(4 = 1,...,7) and therefore also according 
to their product. So if x REA more than one (uneven) prime 
factor, we certainly have 
m + == 1 (mod. n) 
and consequently (m,n) is divisible by 4 
If » =p* is the power ofa prime number (one or two members) 
then . 
Eet 
where the symbol 105) is defined by the equation 
