Mark up value is either a fixed amount or a percentage of the total cost or selling price.
In this problem, mark up value is the percentage of the total cost.
To determine the retail price, total cost and mark up must be added.
Selling Price = Total Cost + Mark up value based on Total Cost
However, we are looking for the Total cost. Thus, our formula should be
Total Cost = Selling Price - Mark up value based on Total Cost.
Let X = total cost.
Selling Price = $8,000
Mark up vale = 6% of total cost.
X = $8,000 - 6%X
X = $8,000 - 0.06X
To get X, transfer -0.06X to the other side and change its sign from negative to positive.
X + 0.06X = $8000
1.06X = $8000
To get X, divide both sides by 1.06
1.06X / 1.06 = $8000 / 1.06
X = $7,547.17 total cost.
The problem is looking for the mark up value and since it states that the mark up value is 6% of the total cost, then:
Total Cost x 6% = Mark up value
$7,547.17 x 0.06 = $452.83 mark up value
To check:
X + 0.06X = $8000
$7547.17 + $452.83 = $8000
$8000 = $8000 equal.
Answer:look at the angle bro and you got the angle just look at it good enough
Step-by-step explanation:
The 3rd quadrant bc they are both negative points
Answer:
The effect of doubling all the dimensions of a triangular pyramid will have on the volume of the pyramid is to increase it by 8 times.
Step-by-step explanation:
i) volume of triangular pyramid = 
Area height
= (Base of triangle perpendicular height of triangle) height
ii) if we double all the dimensions then the three variables((Base of triangle, perpendicular height of triangle, height of pyramid) will be doubled
and the volume of the new pyramid will be 8 times that of the original one.
Answer:
c) there is an efficient algorithm to test whether an integer is prime
Step-by-step explanation:
The basis of modern cryptography is the fact that factoring large numbers is computationally difficult. No algorithm is efficient for that purpose.
<h3>Choices</h3><h3>a)</h3>
False - there is no known efficient algorithm for factoring large numbers
<h3>b)</h3>
False - there are 78,498 prime numbers less than 1,000,000. That is about 8% of them--far from being "most of the integers."
<h3>c) </h3>
True - a variety of algorithms exist for testing primality. In 2002, a test was published that runs in time roughly proportional to the 7.5 power of the logarithm of the number being tested.
<h3>d)</h3>
False - there is no known efficient algorithm for factoring large numbers
