Now we can see for n=0,4,8....... the value of = 1
For n=1,5,9....... the value of =i
for n=2,6,10....... the value of =-1
for n=3,7,11....... the value of = -i
similarly for all negative integers also n takes any one value among 1 ,-1 , i ,-i


Let number of souvenirs of type A = x
And number of souvenirs of type B = y
Therefore , the above L.P.P. is given as :
Maximise , Z = 5x +6y , subject to the constraints : 5x +8y ≤ 200 and. 10x +8y ≤ 240 , x, y ≥ 0.
Corner points | Z =5x +6 y |
O( 0 , 0 ) | 0 |
D(0,25 ) | 150 |
A(24,0) | 120 |
B(8,20) | 160…………………(Max.) |
Here Z = 160 is maximum.
i.e. 8 Souvenir of types A and 20 of Souvenir of type B; Maximum profit = Rs 160.


