>Hi Donald ---
>
>Whew --- this is higher math theory / cryptography stuff. You may have to do some math research on this one. My searches of Yahoo and AltaVista turned up nothing but hints about it.
>
>
>>Has anyone heard of the "Remainder Modulo Seven System" or "Divide by Seven Check Scheme" for generating check digits?

if it is a base 7 scheme that means only 0,1,2,3,4,5,6 will be the result ?
that leaves lotsa room for error.


>>
>>I have a client who is requiring this procedure for generating check digits.
>>
>>TIA
>>
>>Don Burton

modulo arithmetic comes from the "Euclidean Algorithm"]
and was used to determine whether or not a number was a prime number.


if you check out a second year university course textbook in "Classical Algebra" (not linear algebra) usually
they will cover an encryption scheme based on modulo arithmetic and the "Euclidean Algorithm"
but the prime numbers are usually a lot larger than 7

the system in mathematically/computationally intensive and if you encrypt using this method i do not know if you want VFP math functions are fast enough.

HTH Dave.