51 reputation
15
bio website
location
age
visits member for 1 year, 7 months
seen Mar 18 '13 at 16:58

Mar
17
awarded  Notable Question
Oct
21
awarded  Popular Question
Mar
18
accepted how many one to one and onto function?
Mar
18
comment how many one to one and onto function?
M!/N!? So, you are saying that, when M=N, the number of ways of one to one mapping is 1?
Mar
18
asked how many one to one and onto function?
Mar
18
accepted number of ways poker card question
Mar
18
comment number of ways poker card question
so, do you mean the solution is 4*3*C(13,4)*C(13,3)*C(13,2)*C(13,2)?
Mar
18
asked number of ways poker card question
Mar
18
accepted One to one and onto
Mar
17
awarded  Supporter
Mar
17
asked One to one and onto
Mar
8
accepted find the recurrence relation of a string
Mar
8
comment find the recurrence relation of a string
if n=0, there's no string at all. which mean the number of occurrence of a string that not contain 010 is 0. Honestly, I don't rly get this problem too :D
Mar
8
awarded  Editor
Mar
8
comment find the recurrence relation of a string
@rossmilikan edited. as u can see, there's no S0 -> so, S1 is the init, S1 = 1. S2 = 1 + 3 =4
Mar
8
revised find the recurrence relation of a string
added 222 characters in body
Mar
8
asked find the recurrence relation of a string
Feb
8
awarded  Scholar
Feb
8
awarded  Student
Feb
8
accepted Showing that $R$ is an equivalence relation on $X \times X$