• Resolved digiblogger

    (@digiblogger)


    Assuming you want to know: How many different combinations will i get, when I choose k elements from an amount of n total elements.

    the formular is:

    n!/(n-k)!*k!

    I am looking for a way to translate this into CFF Pro ?? Thanks.

    • This topic was modified 5 years, 7 months ago by digiblogger.
Viewing 2 replies - 1 through 2 (of 2 total)
  • Thread Starter digiblogger

    (@digiblogger)

    I already wrote an email ?? I really think I need help to implement

    n!/(n-k)!*k!

    Thread Starter digiblogger

    (@digiblogger)

    did on my own.

    For all:

    Insert a html field with this code:

    <script>
    function factorial(n) {
      return (n != 1) ? n * factorial(n - 1) : 1;
    }
    </script>
    

    Not you can use factorial(YourFieldname)

    • This reply was modified 5 years, 7 months ago by digiblogger.
Viewing 2 replies - 1 through 2 (of 2 total)
  • The topic ‘Facultary n!’ is closed to new replies.