Talk:Pernicious numbers: Difference between revisions

Content added Content deleted

Inline

@@ Line 1: / Line 1: @@
 ==C solution too cryptic?==
-Hi, the C solution is a bit mysterious to me.  The for loop seems to "remove the zeros" as I understand correctly, but then what's so special about 2693408940 ??  How can a simple bitwise & tell if the number of 1 (which is now the length since all zeros have been removed) is prime?
+Hi, the C solution is a bit mysterious to me.  The for loop seems to "remove the zeros" if I understand correctly, but then what's so special about 2693408940 ??  How can a simple bitwise & tell if the number of 1 (which is now the length since all zeros have been removed) is prime?
 A bit of explanation in the introduction of the section or in comment would be welcome--[[User:Grondilu|Grondilu]] ([[User talk:Grondilu|talk]]) 14:43, 12 March 2014 (UTC)