Recent content by hlzombi

  1. H

    Proving the Theorem: p!/[(p-i)! * i] = 1/p for Prime Number p and Integer i

    http://classes.soe.ucsc.edu/cmpe016/Fall14/hw/hw6.pdf number 5
  2. H

    Proving the Theorem: p!/[(p-i)! * i] = 1/p for Prime Number p and Integer i

    Im trying to verify the theorem under those conditions
  3. H

    Proving the Theorem: p!/[(p-i)! * i] = 1/p for Prime Number p and Integer i

    Apologies, I'm new here. I tried to follow the template as best as I could. To clarify, I'm trying to prove the theorem p!/[(p− i)! * i] * 1/p where 0<i<p when p is a prime number and i is an integer.
  4. H

    Proving the Theorem: p!/[(p-i)! * i] = 1/p for Prime Number p and Integer i

    Prove the following theorem: Theorem For a prime number p and integer i, if 0 < i < p then p!/[(p− i)! * i] * 1/p Not sure how to go about this. I wanted to do a direct proof and this is what I've got so far. let i = p-n then p!/[(p-n)!*(p-n)] but that doesn't exactly prove much.
See more
Back
Top