Anonymous user
Talk:Minimum positive multiple in base 10 using only 0 and 1: Difference between revisions
Talk:Minimum positive multiple in base 10 using only 0 and 1 (view source)
Revision as of 14:20, 3 March 2020
, 4 years ago→How does it work "C code for Ed Pegg Jr's 'Binary' Puzzle algorithm" ?: corrected ten =( 10^x-1)%num to //ten == 10^(x-1)%num
m (→How does it work "C code for Ed Pegg Jr's 'Binary' Puzzle algorithm" ?: corrected ten =( 10^x-1)%num to //ten == 10^(x-1)%num) |
|||
Line 53:
count=0;
for(ten=1,x=1;x<=n1;x++){
//ten ==
val[x]=ten;
int mod = ten;
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)
: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 ==
| |||