Prove that there are infinitely many primes of the form 4n + 3; of the form 6n + 5. (h) remark the last problem can be stated thus: each of the arithmetic progressions 3,7,11,15, 19, infinitude of primes. one of the famous theorems of number theory (the proof of which lies deeper than the methods of this book), due to dirichlet, is that the arithmetic progression a, a + b, a + 2b, a + 3b, are relatively prime, that is if (a, b) = 1. and 5, 11, 17, 23,29, contains an contains infinitely many primes if the integers a and b > 0

hbfhv.hjgfskhgfdbmx n

step-by-step explanation:

9-15%

shell's the art director at her local community center. she paid $10 and for each child that attends she earns $4.

for each child she ears $4 that is the slope m = 4

she paid $10, that is the initial amount paid. so 10 is the y intercept b

m =4   and b = 10

y intercept is 10 so the point is (0,10)

we start graph from y intercept (0,10)

slope = 4 . we know slope = rise / run

slope = 4   or 4/1   are same

rise = 4   and run = 1

for rise we move 4 units up and for run we move 1 unit to the right

the graph is attached below

x axis is the number of child she attends

y axis is the amount   she earns