Answer:
a= (1,4)
b=(4,2)
c=(2,6)
d=(2,-1)
Step-by-step explanation:
All I did was looked at the regions the points began and ended. I'm not 100% this is correct but I hope I helped!
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
True because a triangle must have 3 angles that add up to 180 degrees and, since a right angle is 90 degrees, it cannot have 2 right angles
Answer:
<u>108</u>
Step-by-step explanation:
Volume of a Square Pyramid :
- V = 1/3 x Base Area x Height
Solving :
- V = 1/3 x (6)² x 9
- V = 36 x 3
- V = <u>108</u> cubic centimeters
Answer and explanation:
Farmer's number of apples = 96 apples
Given that Farmer needs to bag the apples so that there are at least 4 apples in each bag(not less than 4 apples in each bag) and not more than 10 apples in each bag
And also all apples in each bag are equal
We need to find the numbers between 4 and 10(including 4 and 10) that can divide 96 without a remainder
4 can divide 96= 24
5 cannot divide 96 without remainder
6 can divide 96 =16
7 cannot divide 96 without remainder
8 can divide 96=12
9 cannot divide 96 without remainder
10 cannot divide 96 without remainder
From the above we see that the factors of 96 = 4, 6, 8 between 4 and 10
4 apples = 24 bags
6 apples = 16 bags
8 apples = 12 bags
Therefore, there can be 3 possible ways of having equal number of apples in each bag between 4 and 10 apples
