Number Theory Problem: To transmit a positive integer less than 1000, the Networked Number Node offers two options. Option 1. Pay $d to send each digit d. Therefore, 987 would cost $9 + $8 + $7 = $24 to transmit.
Option 2. Encode integer into binary (base 2) first, and then pay $d to send each digit d. Therefore, 987 becomes 1111011011 and would cost $1 + $1 + $1 + $1 + $0 + $1 + $1 + $0 + $1 + $1 = $8.
What is the largest integer less than 1000 that costs the same whether using Option 1 or Option 2?

Worth 15 points handsome jack is buying a pony made of diamonds. the price of the pony is p dollars, and jack also has to pay a 25% diamond pony tax. which of the following expressions could represent how much jack pays in total for the pony? a= p = 1/4 b= p+0.25p c=(p + 1/4)p d=5/4p 0.25p choose 2 answers

1. an economy consists of three workers: larry, moe, and curly. each works 10 hours a day and can produce two services: mowing lawns and washing cars. in an hour, larry can either mow one lawn or wash one car; moe can either mow one lawn or wash two cars; and curly can either mow two lawns or wash one car. a. calculate how much of each service is produced under the following circumstances: a. all three spend all their time mowing lawns. b. all three spend all their time washing cars. c. all three spend half their time on each activity d. larry spends half of his time on each activity, while moe only washes cars and curly only mows lawns b. using your answers to part a, draw a production possibilities frontier and label points a, b, c, and d on your graph. explain why the production possibilities frontier has the shape it does. c. are any of the allocations calculated in part a inefficient? explain.

Acaterer knows he will need 60, 50, 80, 40 and 50 dinner napkins on five successive evenings. he can purchase new napkins initially at 25 cents each, after which he can have dirty napkins laundered by a fast one-day laundry service (i.e., dirty napkins given at the end of the day will be ready for use the following day) at 15 cents each, or by a slow two-day service at 8 cents each or both. the caterer wants to know how many napkins he should purchase initially and how many dirty napkins should be laundered by fast and slow service on each of the days in order to minimize his total costs. formulate the caterer’s problem as a linear program as follows (you must state any assumptions you make): a. define all variables clearly. how many are there? b. write out the constraints that must be satisfied, briefly explaining each. (do not simplify.) write out the objective function to be minimized. (do not simplify.)