Write R(n) to denote the number of bases b, for 2 ≤ b ≤ n − 1, such that n is a repdigitb . Conjecture a condition on n such that R(n) = 1, and prove your conjecture. Recall the mod-and-div(n, m)...

Write R(n) to denote the number of bases b, for 2 ≤ b ≤ n − 1, such that n is a repdigitb . Conjecture a condition on n such that R(n) = 1, and prove your conjecture.

Recall the mod-and-div(n, m) algorithm, reproduced in Figure 7.6(a), that computes n mod k and ⌊n/k⌋ by repeatedly subtracting k from n until the result is less than k

As written, the mod-and-div algorithm fails when given a negative value of n. Follow Case II of Theorem 7.1’s proof to extend the algorithm for n <>