Answer:
Lets say that P(n) is true if n is a prime or a product of prime numbers. We want to show that P(n) is true for all n > 1.
The base case is n=2. P(2) is true because 2 is prime.
Now lets use the inductive hypothesis. Lets take a number n > 2, and we will assume that P(k) is true for any integer k such that 1 < k < n. We want to show that P(n) is true. We may assume that n is not prime, otherwise, P(n) would be trivially true. Since n is not prime, there exist positive integers a,b greater than 1 such that a*b = n. Note that 1 < a < n and 1 < b < n, thus P(a) and P(b) are true. Therefore there exists primes p1, ...., pj and pj+1, ..., pl such that
p1*p2*...*pj = a
pj+1*pj+2*...*pl = b
As a result
n = a*b = (p1*......*pj)*(pj+1*....*pl) = p1*....*pj*....pl
Since we could write n as a product of primes, then P(n) is also true. For strong induction, we conclude than P(n) is true for all integers greater than 1.
Answer: 3
Step-by-step explanation:
Answer:
1.42 pages
Step-by-step explanation:
10/7= 1.42 that'd be the pages per second
Add 3 1/2 and 2 1/3,
Firstly, find the common denominator. It is is 6
3 3/6 + 2 2/6
this gets you 5 5/6.
Take this away from 8:
8 - 5 5/6 = 2 1/6
So 2 1/6 of the board is left over.
Let us assume that the number of pieces that can be cut = x
Length of each shelf board = 1 1/3 feet
= 4/3 feet
Total length of board available for making shelf = 18 foot
Then
4x/3 = 18
4x = 18 * 3
4x = 54
x = 54/4
= 13 2/4
As we can see from the above deduction, 13 shelf's can be made from the 18 foot board. There will be about 2/4th of the board remaining, but that 2/4th part will be wasted as it cannot create a complete board.I hope the answer is to your satisfaction and the explanation is clear to you.