A number theory problem by Ken Kai

Find the smallest \(n\) such that: \(n^2\) and \(n^3\) use all the digit from 0-9 exactly once.
Put answer as 0 if you think that there is no such number.

×

Problem Loading...

Note Loading...

Set Loading...