Perform the addition or subtraction and give your answer in Hindu-Arabic form.
A. 55,601
B. 55,591
C. 56,591
D. 55,501
Answer: A
You might also like to view...
A delivery truck must deliver packages to 6 different store locations (A, B, C, D, E, and F). The trip must start and end at A. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.
Using only the nearest-neighbor, repetitive nearest-neighbor, and cheapest-link algorithms (not brute force) on this graph,
A. the cheapest-link and the repetitive nearest-neighbor algorithms both yield the shortest trip. B. the nearest-neighbor algorithm yields the shortest trip. C. the nearest-neighbor and the repetitive nearest-neighbor algorithms both yield the shortest trip. D. the repetitive nearest-neighbor algorithm yields the shortest trip. E. the cheapest-link algorithm yields the shortest trip.
Find the quotient q and a remainder r when a is divided by b, and write the result in the form a = bq + r of the division algorithm for the given choices of a and b.a = 208, b = 6
A. 208 = (6)(34) B. 208 = (6)(34) + 4 C. 208 = (6)(38) D. 208 = (6)(34) + 5
Use the formula for the nth term to find r.a =2, a5 = 512
A. 256
B. 8
C. 
D. 4
Find the perimeter.
A. 735 ft B. 864 ft C. 20,736 ft D. 720 ft