#NEWLINE# def test_karr_convention( ) : #NEWLINE# #INDENT# i = Symbol ( 'i' , integer = True ) #NEWLINE# k = Symbol ( 'k' , integer = True ) #NEWLINE# j = Symbol ( 'j' , integer = True ) #NEWLINE# m = k #NEWLINE# n = ( k + j ) #NEWLINE# a = m #NEWLINE# b = ( n - 1 ) #NEWLINE# S1 = Product ( ( i ** 2 ) , ( i , a , b ) ) . doit ( ) #NEWLINE# m = ( k + j ) #NEWLINE# n = k #NEWLINE# a = m #NEWLINE# b = ( n - 1 ) #NEWLINE# S2 = Product ( ( i ** 2 ) , ( i , a , b ) ) . doit ( ) #NEWLINE# assert ( simplify ( ( S1 * S2 ) ) == 1 ) #NEWLINE# m = k #NEWLINE# n = k #NEWLINE# a = m #NEWLINE# b = ( n - 1 ) #NEWLINE# Sz = Product ( ( i ** 2 ) , ( i , a , b ) ) . doit ( ) #NEWLINE# assert ( Sz == 1 ) #NEWLINE# f = Function ( 'f' ) #NEWLINE# m = 2 #NEWLINE# n = 11 #NEWLINE# a = m #NEWLINE# b = ( S1 - 1 ) #NEWLINE# S1 = Product ( f ( i ) , ( i , a , b ) ) . doit ( ) #NEWLINE# m = 11 #NEWLINE# n = 2 #NEWLINE# a = m #NEWLINE# b = ( n - 1 ) #NEWLINE# S2 = Product ( f ( i ) , ( i , a , b ) ) . doit ( ) #NEWLINE# assert ( simplify ( ( S1 * S2 ) ) == 1 ) #NEWLINE# m = 5 #NEWLINE# n = 5 #NEWLINE# a = m #NEWLINE# b = ( n - 1 ) #NEWLINE# Sz = Product ( f ( i ) , ( i , a , b ) ) . doit ( ) #NEWLINE# assert ( Sz == 1 )