Recent content by flying2000

  1. F

    If variance is 0, then p(x=c) = 1 c is constant

    I think it is easy but I can't figure it out. :( any help?
  2. F

    Recursive question

    Suppoese T(0) = 1 T(n) = T(n-1) + root(T(n-1)) how many recursion does T(n) need to grow to the number k? can I get this? root(k) < m < c root(k) c is constant and m is the times we need for T(n) goes to k. Any help appreciated!!
  3. F

    Recursive question

    Suppoese T(0) = 1 T(n) = T(n-1) + root(T(n-1)) how many recursion does T(n) need to grow to the number k? can I get this? root(k) < m < c root(k) c is constant and m is the times we need for T(n) goes to k. Any help appreciated!!
  4. F

    Probability questions?

    Thanks a lot. Yes I made a mistake here, the latter should be j -> m-1. Your advice is really helpful..
  5. F

    Probability questions?

    Yes, the buckets are labeled from 0 to m-1, the probaiblity that a ball going to buckets(from 0 to j-1) is 0.9, and going to j-1 to m-1 bucket is 0.1. and inside [0, j-1] and [j-1, m-1] is equally. j is only a number. for example if m=4, j=2 and p(a ball go to bucket 0,1) = 0.9 and p(go to...
  6. F

    Probability questions?

    How to calculate the probability of this questions? Supposed there are m bukcets, n balls. use function f(x) to decide which bucket the ball go. Supposed that the probability a ball going to 0-j is 0.9 and going to j -> m-1 is 0.1. What's the probability of for every bucket there is at...
  7. F

    NFA Problem

    sorry. sorry about that, man. But if you google 'NFSA assignment', you will find that some people name it NFSA, most call it NFA. Since My professor call it NFSA, there is nothing I can do about it and I had to follow him.
  8. F

    NFA Problem

    Thanks U r smart! man.. however, it seems that it only accepts the string end with 1 ocurred even times, not 0. and '01' is also accepted by it. it is not we wanted. Actually, After spending serveral nights on it. I also figure out a way using six states to accept a string end both 1 and 0...
  9. F

    NFA Problem

    it should be 'non-deterministic FSA ' non-deterministic FSA
  10. F

    NFA Problem

    Is that possible using six states to draw a NFSA(NFA) to represent a string ending with a symbol which occured even times in this string(this string is consisted of only 0 and 1).. I thought that the regular expression is (0*10*1)*(0*10*1) + (1*01*0)*(1*01*0), It can be easy using 7 states to...
  11. F

    Does x->infiity (ln |cosx|)/x^2 exist?

    still not get it.. How can I explain that: ln|cosx| grows faster than x^2 if x>X for some X?
  12. F

    Does x->infiity (ln |cosx|)/x^2 exist?

    Does x->infiity (ln |cosx|)/x^2 exist?? I can't apply apply L'Hopital here, since the limit of |cosx| doesn't exist.. Any hints appreciated..
  13. F

    Non-recursive formula

    I have already wrote down previous 20 items, still can't find the relationship I have already wrote down previous 20 items, still can't find the relationship
  14. F

    Non-recursive formula

    How to get a non-recursive formula for y(n): y(n)=1 (n=1 or 2) y(n)=0 (n=3 or 4) y(n)=(y(n-4) + y(n-3))/2 Any hints apprecaited..
  15. F

    How to work that out?

    Thank you so much! U r so helpful, man. thanx!
Top