9. in principle, the sieve of eratosthenes settles the question as to whether a given positive integer is a prime, but it is impractical because of the immense amount of time and space it can take to carry out the process, even for computers. a better primality test consists of going through the factorisation process - if we have an integer n > 0 such that no prime less or equal to vn divides it, then the integer is prime. use this method to determine whether the given integer n> 0 is prime. show all necessary work. a) n 12,817 b) n 14,653

jml angle lkj & angle mj = lm

region b will make the inequalities y < 2x + 1 and y > -x - 2 true ⇒ answer a

step-by-step explanation:

* lets study the graph and the inequality to solve the question

- the inequality y > -x - 2

∵ the form of the inequality is y > mx + c , m is the slope of the line

  and c is the y-intercept (the line intersect y-axis at point (0 , c)

∴ c = -2 that means the line intersect the y-axis at point (0 , -2)

∵ the sign of the inequality is >

∴ we shad the part over the line

  region a and b

- the inequality y < 2x + 1

∵ the form of the inequality is y > mx + c , m is the slope of the line

  and c is the y-intercept (the line intersect y-axis at point (0 , c)

∴ c = 1 that means the line intersect the y-axis at point (0 , 1)

∵ the sign of the inequality is <

∴ we shad the part under the line

  region b and c

∵ the common region between the two lines is region b

∴ region b will make the inequalities y < 2x + 1 and y > -x - 2 true

table a is wierd

step-by-step explanation:

6*f

1. 2

2. 11

3. 5

4. 6

5. 7

6. 5

7. -1

8. 1

step-by-step explanation: