Maths questions (year 6) help 2h

[23kj]

Need detailed workings

1) Given number 7. In one step you can multiply to 7 or erase any one number. Is it possible to get 77 with finite number of steps?

2)Solve the puzzle: R+OO+KKK+EEEE+RRRRR=ROKER, different letters are different numbers, so same letters-same numbers.

3)There are five pipes connected to the pool. Student Karim found for each pipe the ratio of the time it takes to fill the pool when only this pipe is open to the time it takes to fill the pool when all pipes except this one are open. For four of the five pipes Karim got the values 2, 3, 4, 5. What value did Karim get for the fifth pipe?

4) After the collector had accumulated a lot of coins, he decided to distribute them among 30 boxes. After distribution, it turned out that there were no more than 30 coins in each box. The thief, who found out about the coins in the boxes, decided to steal them. From time to time, he sneaks into a collector's house, picks out several boxes and takes the same amount of coins from each selected box. In what is the smallest number of home visits a thief will be able to take all the coins?

 

[Deleted member 4993]

Need detailed workings

1) Given number 7. In one step you can multiply to 7 or erase any one number. Is it possible to get 77 with finite number of steps?

2)Solve the puzzle: R+OO+KKK+EEEE+RRRRR=ROKER, different letters are different numbers, so same letters-same numbers.

3)There are five pipes connected to the pool. Student Karim found for each pipe the ratio of the time it takes to fill the pool when only this pipe is open to the time it takes to fill the pool when all pipes except this one are open. For four of the five pipes Karim got the values 2, 3, 4, 5. What value did Karim get for the fifth pipe?

4) After the collector had accumulated a lot of coins, he decided to distribute them among 30 boxes. After distribution, it turned out that there were no more than 30 coins in each box. The thief, who found out about the coins in the boxes, decided to steal them. From time to time, he sneaks into a collector's house, picks out several boxes and takes the same amount of coins from each selected box. In what is the smallest number of home visits a thief will be able to take all the coins?

Please post 1 (ONE) problem per thread.

Please show us what you have tried and exactly where you are stuck.

Please follow the rules of posting in this forum, as enunciated at:

READ BEFORE POSTING​

Please share your work/thoughts about this problem.

 

[Steven G]

Sorry but no one here will give you detailed working. This is a math help site where we help students solve their own problems. We never solve problems for students. If you want help then follow the posting guidelines by showing us your work so we know how you want to solve your problems and where you are making any mistakes.

Please post back as I would like to see your attempt at these problems and I would like to help you with them. As already mentioned we like to see only one problem per post. So lets work on just problem number 1.