Let m and n be 2 digit numbers. The number of pairs (m,n) such that n can be subtracted from m without borrowing is
You were given with random five digits 0, 5, 3, 7 and 2. You were just thinking how many five digit numbers you can form using these digits. You thought there can be so many numbers that can be formed, but you want to find the greatest five digits and the smallest five digit number that can be formed by using them. What can be the two numbers? ( Without repeating the digits)