Answer:
4
Step-by-step explanation:
Given:
A, B, C, D have distinct positive values for mod 6
A (mod 6) = 1
B (mod 6) = 2
C (mod 6) = 4
D (mod 6) = 5
Each mod 6 value cannot be a zero since the product ABCD is not a multiple of 6.
Furthermore, in order that ABCD mod 6 > 0, we cannot have a residue equal to 3, else the product with a residue 2 or 4 will make the product a multiple of 6.
Thus the only positive residues can only be 1,2,4,5
A*B*C*D (mod 6) > 0 = 1*2*4*5 (mod 6) = 4
666 is haw many 666 to 666 and 666
Answer:
(2,-2)
Step-by-step explanation:
The solution to a system of equations like these, is where the two lines intersect. In this case, I believe, it would be at point (2,-2). Although, it is a little hard to pinpoint without the labeled number lines.
Hope this helps! Best of luck!
Answer:
5 nails and 4 screws
Step-by-step explanation:
Make it into an expression where N= amount of nails bought and S= amount of screws bought. Then set it equal to the amount he paid.
ie: 2n+1s=14
Now make another equation for how many he bought.\
ie: n+s=9
Now subtract one of the letter variables from the second equation to get one on alone.
ie: n=9-s
Now, since you have a value for N, substitute it for the value in the original equation so that there's only one variable.
ie: 2(9-s)+1s=14
Now solve for S.
ie: 18-2s+s=14
ie: -s=-4
ie: s=4
Now you have a number value for S that you can plug in the original equation to find the value of N.
ie: 2n+4=14
ie: 2n=10
ie: n=5
Now plug in your values for N and S into the original equation to check it. Your answer is 5 nails and 4 screws.
