Find a ten digit number starting with 3 using 0,1,2,3,4,5,6,7,8,9 only once in such a way that if 1). all digits are present then it is divisible by 10 2). last digit is removed then it is divisible by 9 3). again the last digit is removed then it is divisible by 8 4). again the last digit is removed then it is divisible by 7 5). again the last digit is removed then it is divisible by 6 6). again the last digit is removed then it is divisible by 5 7). again the last digit is removed then it is divisible by 4 8). again the last digit is removed then it is divisible by 3 9). again the last digit is removed then it is divisible by 2 10). again the last digit is removed then it is divisible by 1
all digits are removed in sequence i.e after removing last digit in first step last digit of new number will be removed in second step & so on.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!