- 11,593

- 8,058

I know, my bad. But 15+6 is too easy.Moving the goal posts eh ... ?

- Thread starter fresh_42
- Start date
- Featured

- 11,593

- 8,058

I know, my bad. But 15+6 is too easy.Moving the goal posts eh ... ?

Gold Member

- 475

- 122

19.Construct ##21## with symbols from ##\{\,1,5,6,7,*,/,+,-,(,)\,\}## but use the digits at most once.

6 / (1 - (5/7))

- 11,593

- 8,058

How must the prisoner distribute the balls so that his chances to survive are as high as possible?

- 1,106

- 200

There are of course some 'cheating' answers e.g. 1,023,457,98615.What is the smallest prime which includes all ten digits exactly once?

Or to take the radix cheat further, how about 2

Mentor

- 33,392

- 9,111

How must the prisoner distribute the balls so that his chances to survive are as high as possible?

Proof that it is optimal: More than 50% in a vessel requires more white than black there which forces less than 50% in the other one. 49/99 is the closest you can get to 50% winning chance if you have fewer white than black balls, and 100% winning chance is clearly optimal for the other vessel. This strategy is optimal if one vessel has fewer than 50% winning chance. This strategy also beats 50% in both, therefore it must be optimal overall.

- 11,593

- 8,058

'This sentence contains ##n_0## times the ##0##, ##n_1## times the ##1##, ##n_2## times the ##2, \ldots ## and ##n_9## times the ##9##'?

(And don't force me to phrase it without backdoors, you know what I mean.)

Gold Member

- 475

- 122

I don't think I understand what this is asking. "This sentence contains n0 times the 0". "The" 0?

21.Which are the numbers (as symbols) ##n_0,\ldots ,n_9## such that the following statement is true:

'This sentence contains ##n_0## times the ##0##, ##n_1## times the ##1##, ##n_2## times the ##2, \ldots ## and ##n_9## times the ##9##'?

(And don't force me to phrase it without backdoors, you know what I mean.)

- 11,593

- 8,058

Gold Member

- 475

- 122

11,10,9,8,7,6,5,4,3,2 -> 0, 10, 18, 24, 28, 30, 30, 28, 24, 18

- 11,593

- 8,058

What do you mean by this? We need a vector ##\vec{n} \in \mathbb{Z}^{10}## such that11,10,9,8,7,6,5,4,3,2 -> 0, 10, 18, 24, 28, 30, 30, 28, 24, 18

'This sentence contains ##n_0## times ##0##, ##n_1## times ##1##, ##n_2## times ##2## … and ##n_9## times ##9##.'

is true. This implies that ##n_i \leq 11## is an upper bound. But actually no component is greater than nine, so ##\vec{n} \in \{\,1,2,\ldots,9\,\}^{10}##.

Mentor

- 33,392

- 9,111

That would need e.g. 11 zeros in the sentence "This sentence has 11 times '0', 10 times '1', ...", but the sentence with your numbers plugged in doesn't have that many (it just has 2).11,10,9,8,7,6,5,4,3,2 -> 0, 10, 18, 24, 28, 30, 30, 28, 24, 18

Maybe it is clearer if we add "digit"?

"This sentence contains n

Gold Member

- 475

- 122

Ahh I see. "This sentence contains n0 occurances of '0', n1 occurances of '1', "That would need e.g. 11 zeros in the sentence "This sentence has 11 times '0', 10 times '1', ...", but the sentence with your numbers plugged in doesn't have that many (it just has 2).

Maybe it is clearer if we add "digit"?

"This sentence contains n_{0}times the digit '0', n_{1}times the digit '1', ..."

Gold Member

- 475

- 122

21.Which are the numbers (as symbols) ##n_0,\ldots ,n_9## such that the following statement is true:

'This sentence contains ##n_0## times the ##0##, ##n_1## times the ##1##, ##n_2## times the ##2, \ldots ## and ##n_9## times the ##9##'?

(And don't force me to phrase it without backdoors, you know what I mean.)

'This sentence contains

1 times the '0'

7 times the '1'

3 times the '2'

2 times the '3',

1 times the '4',

1 times the '5',

1 times the '6',

2 times the '7',

1 times the '8',

1 times the '9'

- 11,593

- 8,058

- 983

- 173

- 983

- 173

For two kinds of bead, we get solutions like 5 r's 1 g and similar for gr, rb, br, gb, bg, 4r's 2g's, and 3r's 3g's and similar for rb, gb.

rrrrrg - 1 - 6

rrrrgg rrrgrg rrgrrg - 3 - 18

rrrggg rrgrgg rgrgrg - 3 - 9

For 2 different kinds of beads, 33, for at most 2, 36.

rrrrgb rrrgrb rrgrrb - 3 - 9

rrrggb rrgrgb rgrrgb grrrgb rrggrb rgrgrb - 6 - 36

rrggbb - 1 - 1

rgrgbb rggrbb - 2 - 6

rgrbgb - 1 - 3

rgbrgb - 1 - 1

For 3 different kinds of beads, 56, for at most 3, 92.

I could try to derive some general formula.

Mentor

- 33,392

- 9,111

Group by symmetry.

- 60 degree symmetry: 3 bracelets (the uni-color ones)
- 120 degree symmetry but no 180 degree symmetry: 3 (xyxyxy)
- 180 degree symmetry: 3*3*3 options for three beads in fixed order. 3 options are unicolor and counted before, leaving 24. As XYZ=YZX=ZXY we divide by 3 to get 8. In addition xyz=zyx from mirror symmetry, which only matters if all three colors are used, reducing the number by 1. Cross-check: Truly different options are xxy (3*2 options for the colors) and xyz (1 option). In total: 7
- Mirror symmetry across two beads but no rotation symmetry: We are free to choose 4 beads (2 on the symmetry axis, two outside , 3
^{4}=81 options. Again 3 are unicolor, 6 have 120 degree symmetry (xyxy) and 6 have 180 degree symmetry (xyyx), leaving 66. We double-counted (XYZA=AZYX), leaving 33 truly different options. - Mirror symmetry through edges: We are free to choose 3 beads (27 options) and subtract unicolor (3) and 180 degree symmetry (6, xyx), leaving 18. By avoiding the 180 degree symmetry we also avoid a double mirror symmetry. Again we double-counted so we get 9. Cross check: 3 from xyz-zyx, 6 from xxy-yxx. Fits -> 9.
- No symmetry. If we ignore symmetries there are 3
^{6}=729 options. In general 12 options lead to the same bracelet so we have to divide - but we have to take care of the symmetric cases separately. We subtract 3 for the unicolor bracelets (just one orientation), 3*2=6 for the 120 degree symmetry (two orientations), 3^{3}-3=24 for the 180 degree symmetry (but not unicolor), 33*6=198 for the first mirror symmetry, 9*6=54 for the second symmetry, leaving 444 options. Divide by 12 and we get 37 options.

Overall sum: 3+3+7+33+9+37=92.

Annotated quote matching the groups to the previous solution:

rrrrrr, gggggg, bbbbb - 3, unicolor

rrrrrg - 1 - 6 - mirror symmetry through beads

rrrrgg rrrgrg rrgrrg - 3 - 18 - mirror symmetry through edge, mirror symmetry through beads, 180 degree symmetry (6 each)

rrrggg rrgrgg rgrgrg - 3 - 9 - mirror symmetry through beads, no symmetry, 120 degree symmetry (3 each)

For 2 different kinds of beads, 33, for at most 2, 36.

rrrrgb rrrgrb rrgrrb - 3 - 9 - no symmetry, no symmetry, mirror symmetry through beads (3 each)

rrrggb rrgrgb rgrrgb grrrgb rrggrb rgrgrb - 6 - 36 - no symmetry, no symmetry, no symmetry, mirror symmetry through beads, no symmetry, mirror symmetry through beads (6 each)

rrggbb - 1 - 1 - no symmetry

rgrgbb rggrbb - 2 - 6 - no symmetry, mirror symmetry through edge

rgrbgb - 1 - 3 - mirror symmetry through beads

rgbrgb - 1 - 1 - 180 degree symmetry

- 10,227

- 3,092

The easiest way to solve all such problems is to use the successor function ##S## of Peano arithmetic. For instance, the first one can be solved as1.Extend the following to a valid equation, using only mathematical symbols!

Example: ##1\; 2\; 3 \;=\; 1 \longrightarrow - (1 \cdot 2) + 3 = 1##. Solutions are of course not unique.

##9\;9\;9\;=\;6##

##8\;8\;8\;=\;6##

##7\;7\;7\;=\;6##

##6\;6\;6\;=\;6##

##5\;5\;5\;=\;6##

##4\;4\;4\;=\;6##

##3\;3\;3\;=\;6##

##2\;2\;2\;=\;6##

##1\;1\;1\;=\;6##

##0\;0\;0\;=\;6##

$$9-9+9=S(S(S(6)))$$

and the last one

$$S(S(0))+S(S(0))+S(S(0))=6$$

Mentor

- 33,392

- 9,111

- 11,593

- 8,058

Last edited:

Mentor

- 33,392

- 9,111

Is this missing something? There are many options that are trivial to find.

- 983

- 173

- Box of pralines: $7
- Bag of chips: $3
- Chocolate bar: $0.50

I will estimate the minimum number of items purchased using a "greedy" algorithm. First, the minimum purchases, one of each: $7 + $3 + $0.50 = $10.50, giving $89.50 left over. One can have at most 12 boxes of pralines, costing $84 and giving $5.50 left over. One can have at most one bag of chips, giving $2.50 left over. One can have 5 chocolate bars, costing $2.50, with $0.00 left over.

Thus, one should purchase 13 boxes of pralines, 2 bags of chips, and 6 chocolate bars.

Relaxing that minimum-number constraint means that the solution is no longer unique, since

- 1 box of pralines = 2 bags of chips + 2 chocolate bars
- 3 boxes of pralines = 7 bags of chips
- 1 box of pralines = 14 chocolate bars
- 1 bag of chips = 6 chocolate bars

- 11,593

- 8,058

Sorry, yes, forgotten a condition. Corrected now.Is this missing something? There are many options that are trivial to find.

- 11,593

- 8,058

Sorry, I had forgotten the condition of 100 pieces in total.They must all add up to $100, and one should buy at least one of each.

- Box of pralines: $7
- Bag of chips: $3
- Chocolate bar: $0.50

I will estimate the minimum number of items purchased using a "greedy" algorithm. First, the minimum purchases, one of each: $7 + $3 + $0.50 = $10.50, giving $89.50 left over. One can have at most 12 boxes of pralines, costing $84 and giving $5.50 left over. One can have at most one bag of chips, giving $2.50 left over. One can have 5 chocolate bars, costing $2.50, with $0.00 left over.

Thus, one should purchase 13 boxes of pralines, 2 bags of chips, and 6 chocolate bars.

Relaxing that minimum-number constraint means that the solution is no longer unique, since

- 1 box of pralines = 2 bags of chips + 2 chocolate bars
- 3 boxes of pralines = 7 bags of chips
- 1 box of pralines = 14 chocolate bars
- 1 bag of chips = 6 chocolate bars

Science Advisor

- 1,278

- 396

23.John wants to buy sweets for his party. He has $100 to spend. A box Belgian pralines costs $7, chips cost $3, and for 50 cents he gets a chocolate bar. What does he have to buy, if he wants at least one of each and spend the whole $100 to buy exactly 100 pieces in total?

The two conditions can be expressed as a system of linear equations

[tex]

7 n_p + 3 n_c + 0.5 n_b = 100\\

n_p + n_c + n_b = 100

[/tex]

Substracting the second line from two times the first leads to

[tex]

13n_p + 5n_c = 100

[/tex]

Since [itex]n_c[/itex] needs to be a natural number, [itex]13⋅n_p[/itex] needs to be divisible by 5. This is only possible if [itex]n_p[/itex] is equal to 5 (or 0 but this is ruled out by having at least one of the different sweets*). Putting it into the equation yields [itex]n_c[/itex] and using the second equation from above yields [itex]n_b[/itex]:

[tex]

n_p = 5, n_c = 7, n_b = 100-5-7 = 88\\

[/tex]

*Initially, I wrongly included [itex]n_p=0[/itex] as a valid solution

Last edited:

- Posted

- Replies
- 2

- Views
- 2K

- Replies
- 9

- Views
- 2K

- Replies
- 7

- Views
- 2K

- Replies
- 3

- Views
- 1K

- Replies
- 1

- Views
- 952

- Replies
- 2

- Views
- 1K

- Posted

- Replies
- 3

- Views
- 7K

- Replies
- 1

- Views
- 2K

We Value Quality

• Topics based on mainstream science

• Proper English grammar and spelling

We Value Civility

• Positive and compassionate attitudes

• Patience while debating

We Value Productivity

• Disciplined to remain on-topic

• Recognition of own weaknesses

• Solo and co-op problem solving

• Topics based on mainstream science

• Proper English grammar and spelling

We Value Civility

• Positive and compassionate attitudes

• Patience while debating

We Value Productivity

• Disciplined to remain on-topic

• Recognition of own weaknesses

• Solo and co-op problem solving