## Negligible function question.

There is a question:

In constructing obfuscators for point-functions theory, there is a statement that there exists a polynomial-time computable permutation
$$pi : B^n -> B^n$$ and a constant c such that for every polynomial s(n) and every adversary A of size s for all sufficiently large n,

$$Prob[A(pi(x)) = x] <= S(n)^c/2^n$$

I am trying to prove that
$$S^c(n)/2^n$$
where s is a polynomial and c is a constant, is also a negligible function.

Could anyone help me with that?
 PhysOrg.com science news on PhysOrg.com >> City-life changes blackbird personalities, study shows>> Origins of 'The Hoff' crab revealed (w/ Video)>> Older males make better fathers: Mature male beetles work harder, care less about female infidelity

 Similar discussions for: Negligible function question. Thread Forum Replies General Math 6 Calculus & Beyond Homework 2 Calculus 2 Classical Physics 5 General Physics 2