Talk:Casting out nines: Difference between revisions
Content added Content deleted
m (moved Talk:Castin' Out Nines to Talk:Casting out nines: capitalization policy) |
No edit summary |
||
Line 8: | Line 8: | ||
--[[User:Rdm|Rdm]] 13:59, 25 June 2012 (UTC) |
--[[User:Rdm|Rdm]] 13:59, 25 June 2012 (UTC) |
||
:OK, you have not misunderstood what I am trying to convey. I wanted to accept any test based on the congruence B^n=1(mod B-1). The Kaprekar numbers are a good objective because they have the property k%(B-1) == (k*k)%(B-1) and are explained elswhere on this site. I would accept any other objective. |
Revision as of 11:58, 26 June 2012
I am trying to understand this task.
Would it be fair to change the final sentence to read:
- The task is to write code that given a numeric base and two numbers that mark the begining and end of a range use only this test to eliminate numbers from the range which cannot be valid Kaprekar numbers -- the result is the rest of the numbers from that range.
Or have I completely misunderstood what you are trying to convey?
--Rdm 13:59, 25 June 2012 (UTC)
- OK, you have not misunderstood what I am trying to convey. I wanted to accept any test based on the congruence B^n=1(mod B-1). The Kaprekar numbers are a good objective because they have the property k%(B-1) == (k*k)%(B-1) and are explained elswhere on this site. I would accept any other objective.