Permuted multiples: Difference between revisions
Content added Content deleted
m (→{{header|J}}: use notation in description consistent with notation in implementation) |
m (→{{header|J}}: 123456 cannot be n) |
||
| Line 438: | Line 438: | ||
=={{header|J}}== |
=={{header|J}}== |
||
Because 1*n and 6*n have the same number of digits, and because 2*6 is 12, we know that the first digit of n must be 1. And, because 1*m is different for any m in 1 2 3 4 5 and 6, we know that n must contain at least 6 different digits. So |
Because 1*n and 6*n have the same number of digits, and because 2*6 is 12, we know that the first digit of n must be 1. And, because 1*m is different for any m in 1 2 3 4 5 and 6, we know that n must contain at least 6 different digits. So n must be at least 123456. And, as mentioned on the talk page, n must be divisible by 3. |
||
In other words: |
In other words: |
||