Un criterio generale di divisibilità

In this paper using modulo n arithmetic, we give a general divisibility criterion, together with some examples and additional observations. Such criterion holds for each divisor D and for each base b of the chosen number system. It turns out to be especially fast when D ≤ 2b;. in particular for b = 10 and D = 7 or 8 it gives a much simpler rule than the ones generally used.