# What is the minimum number of boxes needed to satisfy the following conditions?

265 views

What is the minimum number of boxes needed to satisfy the following conditions?

• Each box contains distinct positive integer(s) less than 1001.
• All the boxes put together contain all the positive integers less than 1001.
• No box contains a number that is a multiple of another number in the same box.
posted Mar 6, 2017

Put all the 168 prime numbers less than 1000 viz
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997
in ONE box

Similar Puzzles
+1 vote

What are the largest and smallest 5-digit numbers that satisfy the following conditions?

A. Each digit of the number is a prime digit.
B. Each successive pair of digits forms a 2-digit number that is NOT a prime number.
C. Each of the prime digits must appear at least once in the 5-digit number.

Arrange the following 7 colors in proper order,
from left to right, so that they satisfy the following conditions:
(The colors are blue, brown, green, orange, purple, red, and yellow)

1. Purple is somewhere to the left of green.
2. Red is next to blue.
3. Brown is 3 away from blue (2 between).
4. Yellow is 2 away from red.
5. Blue is in the middle.
6. Orange is directly between yellow and purple.

A knight is in one corner of a 100x100 chessboard. What is the minimum number of moves needed to go to the diagonally opposite corner?

Minimum sum of 5 positive integers on the basis of following conditions:
1. 1 is not allowed
2. two successive integers are not allowed
3. first two prime numbers are not allowed