This problem is said to have appeared in Google's entrance exam.
Problem:
1
1 1
2 1
1 2 1 1
1 1 1 2 2 1
what is the next line ? [S]
Thursday, August 24, 2006
Friday, August 18, 2006
Colouring Problem
Problem : Six sides of a die are painted with six different colours.In how many ways can this be done ?
See comment for clue
See comment for clue
Labels:
enumerative combinatorics
Divsion problem[S]
Problem : find the maximum value of 'n' such that 18^n divides 181!
See comment for clue[S]
See comment for clue[S]
Subscribe to:
Posts (Atom)