Determine all triplets (X, Y, Z) of base 12 positive integers such that the duodecimal representation of X
Y*(X+1)
Z has no leading zeroes and contains each of the digits from 0 to B exactly once, with the restriction that: at least one of Y and Z is different from 1.
What is the total number of such triplets without any restriction?
(In reply to
solution, I hope by Charlie)
There was actually a small bug in the program but it had no real effect. It should have started x1 off at a value of 2, rather than a number large enough so that taking a power could bring it to the lowest pandigital.
The only effect of correcting this is to show the two solutions each with their factors reversed--really the same numbers.
|
|
Posted by Charlie
on 2023-04-20 22:06:24 |
re: solution, I hope
