Here is the question/problem.

Barney goes to the bank with 1000 -$1 bills and 10 paper bags. His instructions to the teller are to plcae the bills in the bags in such a way that when he returns later, he can request any amount of money from $1 to $1000 and the teller must be able to give him the money without opening any of the bags. What amount of money goes into each of the 10 bags?

how would I start to figure this and what do you come up with?

(4*10^3)*(4.5*10*-3)

Operations with scientific notation. Perform the indicated operation. Each final answer must be written in scientific notation.

I don't understand. It looks like it adds up to more than $1000. How much would be in each bag?

Barney goes to the bank with 1000 -$1 bills and 10 paper bags. His instructions to the teller are to plcae the bills in the bags in such a way that when he returns later, he can request any amount of money from $1 to $1000 and the teller must be able to give him the money without opening any of the bags. What amount of money goes into each of the 10 bags?

It is well known that the powers of 2 can be used to represent every number from 1 on up. From 1, 2, 4, 8, 16, 32, etc., 1 - 1, 2 = 2, 3 = 4 - 1, 5 = 1 + 4, 6 = 2 + 4, 7 = 1 + 2 + 4, and so on. Therefore, filling each bag with $1.00 bills of quantities 1, 2, 4, 8, 16, 32, 64, 128, 256 and 489 can be used to fill the bags and be able to give any amount requested without opening the bags.

Bag 1 = 1
Bag 2 = 2
Bag 1 + bag 2 = 3
Bag 3 = 4
Bag 1 + bag 3 = 5
Bag 2 + bag 3 = 6
Bag 1 + bags 2 and 3 = 7
Bag 4 = 8
Bag 1 + bag 4 = 9 and so on.
Bag 1 plus bag

(8.16 · 105) / (1.03 · 102)

(Points : 4)

To get started on solving this problem, let's break it down step by step:

Step 1: Determine the possible combinations
Since Barney needs to have any amount from $1 to $1000 without opening any bags, we need to find all possible combinations of dollar bills that would allow for this.

Step 2: Determine the smallest denomination of bills
Since the smallest requested amount is $1, we need to have at least one $1 bill in one of the bags.

Step 3: Determine the largest denomination of bills
Since the largest requested amount is $1000, we need to distribute the rest of the bills among the bags in a way that allows for any combination.

To do this, you can start by distributing the rest of the bills across the remaining bags evenly, keeping in mind that you cannot use a higher denomination bill than the one needed to achieve a certain amount.

For example, if you want to achieve $50, the highest denomination you can use is a $50 bill. If you want to achieve $75, you can use a $50 bill and a $25 bill, and so on.

By following this process, you can distribute the bills across the bags, ensuring that you have all the possible combinations.

Now let's see how it works in practice:

1) Place one $1 bill in one of the bags to cover the minimum requested amount.

2) Distribute the remaining $999 bills across the bags, starting with the highest denomination of $100 bills and proceeding to lower denominations.

For example:

- Bag 1: Contains one $1 bill
- Bag 2: Contains nine $100 bills (900 in total)
- Bag 3: Contains five $50 bills (250 in total)
- Bag 4: Contains four $20 bills (80 in total)
- Bag 5: Contains six $10 bills (60 in total)
- Bag 6: Contains four $5 bills (20 in total)
- Bag 7: Contains nine $1 bills (9 in total)

By distributing the bills in this manner, you have created a scenario that allows for any amount from $1 to $1000 to be requested, without needing to open any of the bags.

Keep in mind that this is just one possible solution, and there might be other valid distributions as well.