Solve: K= 2(11 - k) + 14
Answers
k=22-2k+14
2k+k=22+14
3k=36
k=36/3
k=12
Related Questions
Len is baking a square cake for his friend wedding. When served to the guests, the cake will be cut into square pieces 1 inch on the side. The cake should be large enough so that 121 guests get one piece. How long should each side of the cake be?
Please help ASAP! Is angle BAD less than, greater than, or equal to 90 degrees? Explain why. What about angle BCD?
if a boy grows 5 inches, he will be one-half as tall as his sister. His sister is 68 inches tall. How tall is the boy?
HELP ME PLZZ I NEED HELP WITH THIS !!
Answers
any point to the right of x=-2 is a solution
y<2x+7
to find, plot 2 points by subsitution
when x=0, y=7
when x=1, y=9
plot the points (0,7) and (1,9)
the point is (-1,4)
draw a line through them
then try a point to see which side to shade on
is 0,0 in that shaded reigon?
no
shade below
look at shaded reigon
Answer:
x>-2
Step-by-step explanation:
A. 49
B. 39
C. 37
D. 47
Answers
Answers
x=32a+30=58b+44 where a and b are the quotients you get on dividing x by 32 and 58.
Simplifying this equation you get 16a+15=29b+22
16a= (16+13)b+22-15 or 16a=16b+13b+7
16(a-b)=13b+7
Now I have to find a value for b where 13b+7 is divisible by 16. The least common multiple of these numbers can be found bygoing through the multiplication tables of 13 and 16 and 13x13+7=176,while 16x11 is also 176.
Now that the value of b is found to be 13, we can substitute it in our first equation, x=58b+44=58x13+44=798.
Now find the least common multiple of 58 and 32
LCM (n,m)=nm/GCD (n,m) where GCD is the greatest common divisor of n and m
LCM (58, 32)=58x32/2 as 2 is the GCD of 58 and 32
LCM (58, 32)= 1856/2= 928
Add this LCM to the previous answer, ie, 798 to get the next answer in the series. 798+928=1726
Add the LCM again to the last answer to get the final answer, that is less than 3000=1726+928=2654
Final answer:
The query is a mathematical problem about diophantine equations and the Chinese Remainder Theorem. By setting up the equations 32n + 30 and 58m + 44, we search for a number that fits both conditions and is less than 3000. That number is 1978.
Explanation:
The problem described is a common type of question in number theory, specifically in the field of diophantine equations. In mathematics, a diophantine equation is a polynomial equation where the solutions are sought in integers. This problem consists in finding a common remainder when dividing by different numbers, which is the essence of the Chinese Remainder Theorem.
We can set up the equations as follows: the number can be written as 32n + 30 (this gives a remainder of 30 when divided by 32) and as 58m + 44 for some integers n and m (this gives a remainder of 44 when divided by 58). Now, we check for possible solutions less than 3000 by trying out different values of 'n' and 'm'.
After checking several possibilities one by one, the smallest positive number that satisfies both equations is 1978.
Learn more about Diophantine Equations here:
#SPJ11
B) II
C) III
D) IV
Answers
Answer:
Quadrant IV.
Step-by-step explanation:
Abscissa is the value of the x coordinate while ordinate is the y coordinate. In quadrant I, the ordered pair is (positive abscissa, positive ordinate.
Quadrant II has negative abscissa and positive ordinate.
Quadrant III is both negative abscissa and negative ordinate.
Lastly, Quadrant IV has positive abscissa and negative ordinate.
Answers
you have
AND WORK IS ATTACHED!! :D
Answers
Leaving you with $1,569.50
Answer:
108.50
Step-by-step explanation:
1750x.062(6.2%)=108.50