1) given each should be positive, So, each should be at least 1.
remaining 35 should be distributed among 5.
number of ways = (n+r-1) c(r-1)
= (35+5-1)c(5-1)
= 82251
2) first letter is fixed i.e. A, remaining 25 alphabets and 2 letters need to be arranged
no ways = 25 * 24 = 600
next 3 digits need to be arranged out of 10 digits
no of ways = 10 * 9 * 8 = 720
Total no of ways = 600 * 720 = 432000
Can someone solve these for me? Consider the equation X1 X2X3 + X4+X5 40. How many different solutions does this equation have if all the variables must be positive integers? Enter the exact numeric...
if a license plate consists of 2 letters followed by 4 digits, how many different plates could be created having at least one letter or digit repeated? I know its not 6,760,000
A license plate consists of two letters followed by three single digits. (a) How many different license plates can be made? (b) How many different license plates can be made if no two-character U.S. state abbreviations are allowed for the two letters?
I have 4 questions dont know can anyone help me with any of
it?
ii) Consider the 11 letter word MATHEMATICS a) How many distinct words can be formed by rearranging its letters? b) How many 4 letter words can be formed using the letters in the word MATHEMATICS, using letters no more often than they appear in the word? ii) Consider the equation where xi, x2, 13, T4,5 and re are non-negative integers a) How many solutions are there...