[RESOLVED] The Temple of the Ancient Primes

[nonono]

The underground temple of the lost civilization of the Ancient Primes qwas recently discovered deep in a South American jungle. The keys to the temple were discovered long ago. There are 25 of them, each one numbered with a different prime less than 100.
Each of the temple's doors has a lock which requires a set of keys to open it. The numbers on the keys which open a lock always add to 100, the sacred number of the Ancient Primes.
The keys which open the outer door of the temple are numbered 2, 3, 5, 7, 11, 13, 17, 19, 21. Doors to unimportant rooms inside need only two keys to open them: the broom cupboard needs 3 and 97 and the laundry 17 and 83.

a) Show that no door can be unlocked with exactly eight keys.

There are exactly 35 selections of seven keys which add to 100. So it is not surprising that the temple's main chamber has 35 entry doors, each needing a different selection of seven keys to open it.

b) All of these 35 doors are eventually opened. Find the selection of keys used on one of these doors which contains the key with the highest number.

c) Find the selection of seven keys whose numbers have the largest product.

I need help with all the questions

[opus]

Thats a funny way of bumping a threat, however at least parts of the questions have been answered, why are you posting them again? Did you get a bad grade for not completing the homework in time?

[nonono]

lol nice, just was too lazy to read the question and think for an answer.

Do you know how to delete a thread, or how to mark it as solved?

[nonono]

Done

[opus]

Use the "thread-tools" to mark a thread as resovled (located in the line above post #1 of an opened threat).

... and if you're too lazy to read, guess who is too lazy to answer.

[nonono]

cheers for info

[fuzzboo]

how did u do a)

[opus]

I didn't do it, just 'cause it's not my homework :D