B) Prove or disprove by example or by exhaustive checking that every integer greater than 1 is either prime or sum of two primes.

Every integer greater than 1 is either prime or composite.

Step-by-step explanation:

Let us negate this statement.

Assumption - any number greater than 1, is neither prime nor composite.

A prime number has only 2 divisors, and a composite number has at least 3.

Let a number be X such that X >1.

Now X is divisible by 1 (Any integer is divisible by 1)

And X is divisible by X (X/X = 1, if X is not zero)

So by this, we see X has at least 2 divisors, X is either prime, or composite if it has more divisors!

So our assumption is wrong, and every integer greater than 1 is either prime or composite.

f(x) has value 150 at x= 0

and 0 at x= 3

so d(f(x))/dt = slope = -150/3 = -50

answer: bearing in mind that a rectangle has a perimeter of length + length + width + width.

step-by-step explanation:

p = perimeter

l = length

x=width

p = 2l + 2x

p = 2(l+x)     < ==== perimeter of the base of the box.