- #1
zetafunction
- 391
- 0
how is it called this function ??
given a number 'n' how is it called this function [tex] P(n,k) [/tex]
so P(n,k) is the number of ways in which an integer 'n' can be expressed as the sum (with repeated summands) of k integers different or not
then for any integers n and k how could i compute [tex] P(n,k) [/tex] ? is there a recurrence equation ??
given a number 'n' how is it called this function [tex] P(n,k) [/tex]
so P(n,k) is the number of ways in which an integer 'n' can be expressed as the sum (with repeated summands) of k integers different or not
then for any integers n and k how could i compute [tex] P(n,k) [/tex] ? is there a recurrence equation ??