Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

How to solve nchoosek(k,n), when k <=n?

Status
Not open for further replies.

syedshan

Advanced Member level 1
Joined
Feb 27, 2012
Messages
463
Helped
27
Reputation
54
Reaction score
26
Trophy points
1,308
Location
Jeonju, South Korea
Activity points
5,134
Hi all,

I was reading a research paper and trying to dig deep. The authors, at one point, have come to a formula as below.
Now, if n>k it is piece of cake to solve, but since k<=n it is not that easy for me. Any help would be appreciated in solving this.
Especially how I can solve in Matlab.

For reference, the actual equation is below.enter image description here

Capture.JPG
 

Your question is not clear for me.
It seems you have problems if n=k, is it correct ?
However in this case the argument of the summation is (-1)^n/n, since the binomial coefficient C(n,n)=1
 

This is a weird question.

"k" at some point will be equal to "n" because it goes from 1 to n... like it or not. The statement n>k or n=>k is useless.. simply due to the definition of the summation.
 
  • Like
Reactions: BaWY

    BaWY

    Points: 2
    Helpful Answer Positive Rating
Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top