Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What is a good algorithm to compute the value of the i-th digit in a k-ary representation of a number n?
Example:
For function bitval(int k, int i, int n):
bitval(5, 4, 9730) = 2 because in a 5-ary (quinary) representation of the number 9730 (which is 302410) the 4th digit (from the right) is 2.
Something like:
(where
**is the exponentiation operator and/is integer (truncating) division) should do it. Use(i-1)if you want to number the digits from the right starting with 1 rather than starting with 0.