Answer:120
Step-by-step explanation: So he has 85 games and each shelf cant fit 40. Right there 2 x 40 = 80. So his other shelf will have 5 games.
Answer:1. -6 2. -4 3. 6 4. 4
Step-by-step explanation:
-4+-2=-6
0+-4= -4
2+4=6
2+2=4
Answer:
107.5
Step-by-step explanation:
2x21.5/
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:
n=5
Step-by-step explanation:
i hope this helps :)
