Cody

# Problem 161. Wilf-Zeilberger pairs

Solution 228933

Submitted on 10 Apr 2013 by Tanguy
• Size: 31
• This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
%% F = @(n,k)(sin(n)+sin(k)) G = @(n,k)(n+k) n = 6; k = 4; y_correct = false; assert(isequal(wzpair(F,G,n,k),y_correct))

``` F = @(n,k)(sin(n)+sin(k)) G = @(n,k)(n+k) ```

2   Pass
%% F = @(n,k) (((-1)^k)*nchoosek(n,k)*nchoosek(2*k,k)*4^(n-k)/nchoosek(2*n,n)); G = @(n,k)((2*k-1)*F(n,k-1)/(2*n+1)) n = 7; k = 2; y_correct = true; assert(isequal(wzpair(F,G,n,k),y_correct))

``` G = @(n,k)((2*k-1)*F(n,k-1)/(2*n+1)) ```

3   Pass
%% F = @(n,k)(sin(n)+sin(k)) G = @(n,k)(n+k) n = 7; k = 2; y_correct = false; assert(isequal(wzpair(F,G,n,k),y_correct))

``` F = @(n,k)(sin(n)+sin(k)) G = @(n,k)(n+k) ```

4   Pass
%% F = @(n,k) (((-1)^k)*nchoosek(n,k)*nchoosek(2*k,k)*4^(n-k)/nchoosek(2*n,n)); G = @(n,k)((2*k-1)*F(n,k-1)/(2*n+1)) n = 6; k = 4; y_correct = true; assert(isequal(wzpair(F,G,n,k),y_correct))

``` G = @(n,k)((2*k-1)*F(n,k-1)/(2*n+1)) ```