Suppose a NR is an infinite sequence. Define f: Z+ R by where Z+ = =...

       

Transcribed Image Text:

Suppose a NR is an infinite sequence. Define f: Z+ R by where Z+ = = f(i) (a(i-1)+a(i) + a(i + 1))/3, for all i Z+ {i Zi > 0}. Consider this algorithm in which x, y, and z are real, p and N are integer, b is real sequence of at least N items. {N > 0} x, y = a(0), a(1) p=1 {I} while pN do z= a(p+1) b(p)=(x+y+2)/3 x, yy, z pp+1 end while {Vi {1,..N} b(i) = f(i)} State a loop invariant I that could be used to verify this algorithm. Activate V Suppose a NR is an infinite sequence. Define f: Z+ R by where Z+ = = f(i) (a(i-1)+a(i) + a(i + 1))/3, for all i Z+ {i Zi > 0}. Consider this algorithm in which x, y, and z are real, p and N are integer, b is real sequence of at least N items. {N > 0} x, y = a(0), a(1) p=1 {I} while pN do z= a(p+1) b(p)=(x+y+2)/3 x, yy, z pp+1 end while {Vi {1,..N} b(i) = f(i)} State a loop invariant I that could be used to verify this algorithm. Activate V