Answer:
C
Step-by-step explanation:
C, because the second line keeps adding 6 to it and, the third line keeps adding 7.
Answer:
Check the explanation
Step-by-step explanation:
(a)Let p be the smallest prime divisor of (n!)^2+1 if p<=n then p|n! Hence p can not divide (n!)^2+1. Hence p>n
(b) (n!)^2=-1 mod p now by format theorem (n!)^(p-1)= 1 mod p ( as p doesn't divide (n!)^2)
Hence (-1)^(p-1)/2= 1 mod p hence [ as p-1/2 is an integer] and hence( p-1)/2 is even number hence p is of the form 4k+1
(C) now let p be the largest prime of the form 4k+1 consider x= (p!)^2+1 . Let q be the smallest prime dividing x . By the previous exercises q> p and q is also of the form 4k+1 hence contradiction. Hence P_1 is infinite
Answer:
I think i wanna say one of the fractions
Step-by-step explanation:
Answer:
B
Step-by-step explanation:
x is the value of x which you input into the function and f(x) is the actual function and therefore the output. so when x=3, f(x)= -2. f(3)=-2
I uploaded the answer to a file hosting. Here's link:
tinyurl.com/wtjfavyw
