Consider Statement 1: All prime numbers greater than 3 are equal to a multiple of six, plus 1 or minus 1. Let P(x) be the statem
ent "x is a prime number." Let Q(x) be the statement "x is greater than 3." Let R(x) be the statement "x % 6 = 1 or x % 6 = 5." (i.e. x is a multiple of 6, plus or minus 1) Let U be the domain of x. (% represents the modulo operation in this question.)
a. Given the following definitions of U, translate the above statement into an expression of predicate logic.
If an OS is using paging with offsets needing 12 bits, give the offset (in decimal or hexadecimal) to: the third word on a page the last word on a page.