Talk:Kaprekar numbers: Difference between revisions

Content added Content deleted

Inline

Revision as of 20:56, 7 June 2011

Java count missing

Just add (and show), the count of how many there are <1million and you will have completed the stretch goal! --Paddy3118 14:07, 7 June 2011 (UTC)

I had actually added it as a test because I saw the other examples do it, but for some reason I didn't read it as a requirement so I took it out. Mornings are hard. --Mwn3d 14:47, 7 June 2011 (UTC)

:-)
--Paddy3118 17:29, 7 June 2011 (UTC)

Why the complexity?

The wikipedia page says "Let X be a non-negative integer. X is a Kaprekar number for base b if there exist non-negative integers n, A, and positive number B satisfying ...". In other words A can be zero. Why do we have to have a bunch of text claiming that A cannot be zero but A can be an empty string and that it is meaningful to add an empty string to a number? --Rdm 20:56, 7 June 2011 (UTC)

@@ Line 3: / Line 3: @@
 :I had actually added it as a test because I saw the other examples do it, but for some reason I didn't read it as a requirement so I took it out. Mornings are hard. --[[User:Mwn3d|Mwn3d]] 14:47, 7 June 2011 (UTC)
 :: :-)<br>--[[User:Paddy3118|Paddy3118]] 17:29, 7 June 2011 (UTC)
+== Why the complexity? ==
+The wikipedia page says "Let X be a non-negative integer. X is a Kaprekar number for base b if there exist non-negative integers n, A, and positive number B satisfying ...".  In other words A can be zero.  Why do we have to have a bunch of text claiming that A cannot be zero but A can be an empty string and that it is meaningful to add an empty string to a number?  --[[User:Rdm|Rdm]] 20:56, 7 June 2011 (UTC)