Consider the first order predicate formula φ:

∀x[(∀z z|x ⇒ ((z = x) ∨ (z = 1))) ⇒ ∃w (w > x) ∧ (∀z z|w ⇒ ((w = z) ∨ (z = 1)))]

Here 'a|b' denotes that 'a divides b', where a and b are integers.

Consider the following sets:

S1. {1, 2, 3, ..., 100}
S2. Set of all positive integers
S3. Set of all integers

Which of the above sets satisfy φ?

Two numbers are chosen independently and uniformly at random from the set {1, 2, ...., 13}. The probability (rounded off to 3 decimal places) that their 4-bit (unsigned) binary representations have the same most significant bit is ______.

Let G be an arbitrary group. Consider the following relations on G :

R₁: ∀a,b ∈ G, aR₁b if and only if ∃g ∈ G such that a = g^-1bg

R₂: ∀a,b ∈ G, aR₂b if and only if a = b^-1

Which of the above is/are equivalence relation/relations?

Compute $$\mathop {\lim }\limits_{x \to 3} {{{x^4} - 81} \over {2{x^2} - 5x - 3}}$$