| http://www.w3.org/ns/prov#value | - We shall define R(k) to be a repunit of length k; for example, R(6) = 111111.Given that n is a positive integer and GCD(n, 10) = 1, it can be shown that there always exists a value, k, for which R(k) is divisible byn, and let A(n) be the least such value of kFind the least value of n for which A(n) first exceeds one-million.This problem can be solved by applying the principles of long division so
|
