Riddles and Puzzles: Extend the following to a valid equation

[jbriggs444]

90. We have an elliptic camembert. Is it possible to cut it into two pieces with one straight cut such that the pieces form a heart?

Yes.

I don't demand proofs, as long as the solution is correct.

Spoiler

Cut the ellipse on a nice diagonal, flip one piece top for bottom then rejoin the sliced faces.

 

[fresh_42]

Spoiler

 

[fresh_42]

91. A student sends a postcard to his father with the following encrypted text:
\begin{array}{lr}
&\text{ SEND }\\
+&\text{ MORE }\\
\hline \\
&\text{ MONEY }
\end{array}
Which amount of money does he ask for?

D103

 

[bluej]

Spoiler

View attachment 247078

French cheese with German instructions! Do you think it smells

 

[fresh_42]

French cheese with German instructions! Do you think it smells

Nope, but tastes very well. They don't cheat with the fat.

 

[bluej]

# 91

Spoiler

That's over 10K! Hope it's GBP, or EUR, or plain old $, and not like rupees or something

 

[fresh_42]

# 91

Spoiler

That's over 10K! Hope it's GBP, or EUR, or plain old $, and not like rupees or something

It might have been any of the above currencies, but it's not 10,000!

 

[bluej]

It might have been any of the above currencies, but it's not 10,000!

The keyword "over" seems to have been overlooked:)

 

[fresh_42]

The keyword "over" seems to have been overlooked:)

As you did with the link, I guess.

But we are still looking for the digits of the calculation.

 

[bluej]

As you did with the link, I guess.

But we are still looking for the digits of the calculation.

Sorry! I had to deduce it's punctuation since 5-somethingx10^(17k+) seems likely to exceed the available equivalent in world circulation in any currency and denomination. But, didn't take into account summing up over parallel universes, my bad

 

[bluej]

#91:

Spoiler

10k + 652

 

[fresh_42]

#91:

Spoiler

10k + 652

Don't be so lazy!
\begin{array}{lr}
&9567\\
+&1085\\
\hline \\
&10652
\end{array}

 

[fresh_42]

92. Eight rooks are placed on the main diagonal of a chessboard. Then each of them makes a knight move. At the beginning none of the rooks threatened another rook. Is this possible even after their moves?

D103

 

[mfb]

92. Eight rooks are placed on the main diagonal of a chessboard. Then each of them makes a knight move. At the beginning none of the rooks threatened another rook. Is this possible even after their moves?

D103

Spoiler

A1 -> B3, D4->C2, B2->A4, C3->D1. No rook is threatening another and the four rooks in that half stayed in their 1/4 of the board (they form the other diagonal now). Mirror it for the other four.

 

[fresh_42]

93. Each of the seven dwarves has his own bed. One evening, the smallest dwarf decides to confuse the process a bit. He does not lie down in his own bed, but in another, randomly picked.

The second smallest dwarf, who goes to sleep next, goes to his bed - if this is free. If this is occupied, he randomly chooses another bed. The following dwarves do the same.

What is the probability that the biggest dwarf will sleep in his own bed this evening?

D103

 

[fresh_42]

94. If $(F_n)_n$ is the ordinary Fibonacci sequence ($F_1=F_2=1$). What is
$$
\sum_{n=1}^\infty F_n \,10^{-(n+1)}
$$

D104

 

[Not anonymous]

Spoiler

$9\;9\;9\;=\;6$
If cube-root and square-root operations are acceptable, then here is one set of solutions:
$(9\; /\; \sqrt 9) + \sqrt 9=\;6$
$\sqrt[3]8 + \sqrt[3]8 + \sqrt[3]8 =\;6$
$7 - (7\; /\; 7) =\;6$
$(6\; / \; 6) \times 6 =\;6$
$(5\; /\; 5) + 5 =\;6$

 

[KnotTheorist]

Spoiler: Partial Spoiler to 94

We know that the sum converges by the ratio test. If we take the limit as n goes to infinity of |a_n+1/a_n|, we get F_n+110^-(n+2) / F_n10^-(n+1) = F_n+1/10F_n = φ/10 ≈.1618 < 1. Thus the summation converges.

From here, I am lost. I have done some calculations and written out the first hundred terms and they get close to .011235955056.

 

[bluej]

Spoiler: #94

$\sum_{n=1}^\infty F_n \,10^{-(n+1)} = \frac {1} {10} \sum_{n=1}^\infty \frac { F_n } {10^n}=\frac {1} {10} \frac {10} {89}=\frac {1} {89}=0.011235955$

 

[lpetrich]

Solution of #94

Spoiler

The Fibonacci series has closed-form solution
$$ F_n = \frac{1}{\sqrt{5}} \left[ \left( \frac{1+\sqrt{5}}{2} \right)^n - \left( \frac{1-\sqrt{5}}{2} \right)^n \right] $$
The sum that we want to calculate I will write more generally as
$$ S(a) = \sum_{n=0}^\infty F_n a^{n+1} $$
Inserting the Fibonacci series gives
$$ S(a) = \frac{a}{\sqrt{5}} \sum_{n=0}^\infty \left[ \left( a \frac{1+\sqrt{5}}{2} \right)^n - \left( a \frac{1-\sqrt{5}}{2} \right)^n \right] $$
We have geometric series here, so we get sums
$$ S(a) = \frac{a}{\sqrt{5}} \left[ \frac{1}{1 - a \frac{1+\sqrt{5}}{2}} - \frac{1}{1 - a \frac{1-\sqrt{5}}{2}} \right] = \frac{a^2}{1 - a - a^2} $$
Substituting in a = 1/10 gives
$$ S(1/10) = \sum_{n=1}^\infty F_n 10^{-n-1} = \frac{1}{89} $$

 

[fresh_42]

95. What are the smallest emirp and permutable three digit primes in the decimal system?

D104

 

[KnotTheorist]

Spoiler: 95 Spoiler

113
131
311

 

[fresh_42]

Spoiler: 95 Spoiler

113
131
311

Do you know the emirp, too?

 

[bluej]

Do you know the emirp, too?

Spoiler

smallest: 13; smallest 3-digit: 107

 

[fresh_42]

Spoiler

13

Three decimal digits!

 

[bluej]

Three decimal digits!

Knew you'd say dat added above in spoiler
Question not stated very precisely Mr 42..

 

[fresh_42]

Question not stated very precisely Mr 42..

... three digit primes ...

Question not read very precisely Mr. bluej..

 

[bluej]

Question not read very precisely Mr. bluej..

Can be read in 2 parts as 1) smallest emirp and 2) permutable three digit primes (i.e. all?)
Smallest 3-digit emirp in 10base system is 107.
Its more interesting in base 16!

 

[fresh_42]

Here's one I might regret ... for having to check the solutions ...

96. The rule is simple: choose a pin, jump over another horizontally or vertically into and if there is a hole, and remove the pin you jumped over. Is there a strategy which leads to a single pin in the middle of the board?
In order that we have a common notation, the first moves could (not have to) be:
1. 5-10-H / 10
2. 12-11-10 / 11
3 ...

D104

 

[mfb]

The Fibonacci sum without magic and without using the explicit formula:
Take out the first two elements:
$$\sum_{n=1}^\infty F_n 10^{-n-1} = 0.011 + \sum_{n=3}^\infty F_n 10^{-n-1}$$
Now use the recursive definition:
$$\sum_{n=3}^\infty F_n 10^{-n-1} = \sum_{n=3}^\infty (F_{n-2}+F_{n-1}) 10^{-n-1}$$
Some index shifting:$$= \sum_{n=1}^\infty F_{n} 10^{-n-3} + \sum_{n=2}^\infty F_{n} 10^{-n-2}$$
Let the second sum start at n=1 and subtract its first term, in addition unify the exponents:
$$= -0.001 + 0.01\sum_{n=1}^\infty F_{n} 10^{-n-1} + 0.1\sum_{n=1}^\infty F_{n} 10^{-n-1}$$
If we call the original sum X, then we can summarize this as $X = 0.011 - 0.001 + 0.01 X + 0.1 X$ or simplified $0.89 X = 0.01$, which is solved by $X=1/89$.

 

[fresh_42]

97. What is the smallest natural number $n$ such that $\varphi(n) \neq \varphi(p)$ for all primes $p\,?$

D105

 

[lpetrich]

#97 - presumably the Euler phi function, the count of all positive integers less than the arg that do not evenly divide the arg.

Spoiler

For prime number p, $\varphi(p) = p - 1$. Thus, for some n where there is no p that makes $\varphi(n)$ and $\varphi(p)$ equal, $\varphi(n) + 1$ must be a composite number. The smallest n that makes that happen is n = 15, and $\varphi(15) = 8$.

 

[fresh_42]

98. How many options are there to represent the number $1,000$ as sum of two or more consecutive natural numbers?

D106

 

[lpetrich]

#98

Spoiler

Let us first add the consecutive natural numbers between any two of them, $n_1$ and $n_2$. That sum is
$$ N = \sum_{n=n_1}^{n_2} n = \frac12 n_2(n_2 + 1) - \frac12 n_1(n_1 - 1) = \frac12 (n_2 - n_1 + 1) (n_2 + n_1) $$
or $2N = (n_2 - n_1 + 1) (n_2 + n_1)$. This expression means that a solution can be obtained by factoring 2N. Doing so gives $2N = f_1 f_2$ with the two f's being natural numbers, and one sets each factor equal to a factor of the sum expression: $f_1 = n_2 - n_1 + 1$ and $f_2 = n_1 + n_2$. Solving gives
$$ n_1 = \frac12 (f_2 - f_1 +1) ,\ n_2 = \frac12 (f_1 + f_2 - 1) $$
The pairs of lowest and highest natural numbers are thus

• 1000, 1000
• 198, 202
• 55, 70
• 28, 52

 

[fresh_42]

99. The regular $4,294,967,295-$gon can be constructed with compass and ruler. How?

D106