Talk:Minimum positive multiple in base 10 using only 0 and 1: Difference between revisions
Content added Content deleted
m (→general observations: added a blank line.) |
m (→How does it work "C code for Ed Pegg Jr's 'Binary' Puzzle algorithm" ?: removed relict of copy&paste) |
||
| Line 98: | Line 98: | ||
:I've added a reference "How to find Minimum Positive Multiple in base 10 using only 0 and 1" which I think helps.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:49, 3 March 2020 (UTC) |
:I've added a reference "How to find Minimum Positive Multiple in base 10 using only 0 and 1" which I think helps.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:49, 3 March 2020 (UTC) |
||
:Thanks, that helps allot --[[User Horst.h|Horst.h]] 14:09, 3 March 2020 (UTC) |
:Thanks, that helps allot --[[User Horst.h|Horst.h]] 14:09, 3 March 2020 (UTC) |
||
=NUM;num++){ |
|||
n1 = num+1; |
|||
//clear pow |
|||
for(i=0;i |
|||
== general observations == |
== general observations == |
||