1.35. 1.36. 1.37. 1.38. 1.39. We want to find the smallest No such that m(2r/N)No = 2rk or No = kN/m. where k is an integer. If No has to be an integer, then N must be a multiple of m/k and m/k must be an integer. This implies that m/k is a divisor of both m and NV. Also, if we want the smallest possible Np, then m/k should be the GCD of m and NV. Therefore, No = N/ged(m, N) (a) If 2{n] is periodic eM0("*¥I7 = eto", where wy = 2n/To. This implies that 2 T_k Ze NT = 2nk az Te _ a =a rational number. (b) If T/To = p/q then z{n] = e/?™("/9)_ The fundamental period is q/gcd(p,q) and the fundamental frequency is ecatn.a) = =F gcatp.g) = Puede) = “gcd. (c) p/gcd(p,q) periods of 2(t) are needed. (a) From the definition of gay(t), we have bey(t) 0 [xt uner fixe 4 7)a(s)dr = bya(-t) (b) Note from part (a) that drr(t) = ¢z2(—t). This implies that @e2(t) is even. Therefore, the odd part of dzz(t) is zero. (c) Here, dy(t) = ¢za(t~T) and dyy(t) = dze(t). (a) We know that 26a (2t) = Sa/a(t). Therefore, 1 Jim, ba(2) = Jim S52 This implies that \ (24) = 54(2). (b) The plots are as shown in Figure $1.38. We have Jim us(€)4(¢) = Jim ua (0)6(¢) Also, Jim, ua(t)6a(¢) = 7