LO5. Let GTE(x, y) be defined as 1 if xy GTE(x, y) = 0 otherwise CS...

 

Transcribed Image Text:

LO5. Let GTE(x, y) be defined as 1 if xy GTE(x, y) = 0 otherwise CS Scanned with CamScanner Provide a recursive definition for GTE(x, y). In addition to the basic functions, the only other functions you may use in your definition are binary addition, subtraction, multiplication, x-1, Sgn, and Sgn. Hint: credit will not be awarded if your recursive case does not depend on the value of GTE(x, y). For example, f(x,y) = x+y+0 GTE(x, y) is a function of x and y that does not depend on GTE(x, y) even though GTE(s, y) appears in its definition. LO5. Let GTE(x, y) be defined as 1 if xy GTE(x, y) = 0 otherwise CS Scanned with CamScanner Provide a recursive definition for GTE(x, y). In addition to the basic functions, the only other functions you may use in your definition are binary addition, subtraction, multiplication, x-1, Sgn, and Sgn. Hint: credit will not be awarded if your recursive case does not depend on the value of GTE(x, y). For example, f(x,y) = x+y+0 GTE(x, y) is a function of x and y that does not depend on GTE(x, y) even though GTE(s, y) appears in its definition.