Sheila Mae Garcia - Assignment - Summation with predicate logic

Problem 1:

In predicate logic, the sum of all numbers x, from 1 to 40, such that (A(x) B(x)),
can be expressed as follows:

From 1 to 40, [x (A(x) B(x))]

A(x) stands for "x is a multiple of 3," B(x) stands for "x is a multiple of 4," and
(A(x) B(x)) denotes that "x is not a multiple of both 3 and 4."

Problem 2:

In predicate logic, the sum of all integers x, ranging 1 to 50, such that P(x) Q(x),
can be defined as:

[x [P(x) Q(x)] x=1 to 50]

P(x) Q(x) means that "x can either be an even number or a prime number,"
where P(x) is the predicate "x is an even number," Q(x) is the predicate "x is a
prime number," etc.

Problem 3:

Predicate logic is a way to define the sum of all integers x, from 1 to 100, such
that G(x) H(x):

[x (G(x) H(x))] for x=1 to 100

G(x) H(x) signifies "x is a perfect square if and only if x is a perfect cube," where
G(x) is the predicate "x is a perfect square," H(x) is the predicate "x is a perfect
cube," and so on.
Problem 4:

Predicate logic is a way to express the sum of all integers x, from 1 to 70, such
that (M(x) N(x)) (M(x) N(x)):

[x ((M(x) N(x)) (M(x) N(x))] for x=1 to 70

Where (M(x) N(x)) (M(x) N(x)) means "x is divided by 5 but not by 7 or x is
divisible by 7 but not by 5" and M(x) is the predicate "x is divisible by 5" and N(x)
is the predicate "x is divisible by 7".

Problem 5:

In predicate logic, the sum of all numbers x, between 1 to 100, so that R(x) S(x),
can be expressed as:

[x (R(x) S(x))] for x=1 to 100

where the predicate "x is a Fibonacci number" is R(x), "x is a multiple of 6" is
S(x), and "x can be either a Fibonacci number or a multiple of 6" is R(x) S(x).