Cody

# Problem 161. Wilf-Zeilberger pairs

Solution 1211703

Submitted on 13 Jun 2017 by Said BOUREZG
• Size: 11
• 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 = function_handle with value: @(n,k)(sin(n)+sin(k)) G = function_handle with value: @(n,k)(n+k) ans = ' '

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 = function_handle with value: @(n,k)((2*k-1)*F(n,k-1)/(2*n+1)) ans = ''

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 = function_handle with value: @(n,k)(sin(n)+sin(k)) G = function_handle with value: @(n,k)(n+k) ans = ' '

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 = function_handle with value: @(n,k)((2*k-1)*F(n,k-1)/(2*n+1)) ans = ''