- #391
bluej
- 12
- 1
# 91
That's over 10K! Hope it's GBP, or EUR, or plain old $, and not like rupees or something 
Riddles and Puzzles: Extend the following to a valid equation
- Context: Challenge
- Thread starter fresh_42
- Start date
Click For Summary
SUMMARY
The forum discussion revolves around mathematical puzzles and logical reasoning challenges. Participants engage in extending equations, exploring game fairness in coin placement scenarios, and solving riddles involving urns and historical dates. Key topics include the determination of fair game ratios (R/r), the nature of deterministic games, and the analysis of mathematical functions. The conversation highlights the complexity and enjoyment of problem-solving in mathematics.
PREREQUISITES- Understanding of basic algebra and mathematical symbols
- Familiarity with game theory concepts, particularly fairness in games
- Knowledge of combinatorial logic and probability
- Basic understanding of historical dating systems and their implications
- Research mathematical puzzles and their solutions, focusing on logical reasoning
- Explore game theory, specifically the concept of fair games and strategies
- Study combinatorial problems involving urns and probability distributions
- Investigate historical dating systems and their relevance in mathematical contexts
Mathematicians, educators, puzzle enthusiasts, and anyone interested in logical reasoning and problem-solving techniques.
- #392
- 20,815
- 28,445
It might have been any of the above currencies, but it's not 10,000!bluej said:# 91That's over 10K! Hope it's GBP, or EUR, or plain old $, and not like rupees or something
- #393
bluej
- 12
- 1
The keyword "over" seems to have been overlooked:)fresh_42 said:It might have been any of the above currencies, but it's not 10,000!
- #394
- 20,815
- 28,445
As you did with the link, I guess.bluej said:
But we are still looking for the digits of the calculation.
- #395
bluej
- 12
- 1
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 badfresh_42 said:
- #396
bluej
- 12
- 1
#91:
10k + 652
- #397
- 20,815
- 28,445
Don't be so lazy!bluej said:
\begin{array}{lr}
&9567\\
+&1085\\
\hline \\
&10652
\end{array}
- #398
- 20,815
- 28,445
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
D103
- #399
mfb
Mentor
- 37,402
- 14,234
fresh_42 said:
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.
- #400
- 20,815
- 28,445
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
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
- #401
- 20,815
- 28,445
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
$$
\sum_{n=1}^\infty F_n \,10^{-(n+1)}
$$
D104
- #402
Not anonymous
- 143
- 58
##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##
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##
- #403
KnotTheorist
- 24
- 9
We know that the sum converges by the ratio test. If we take the limit as n goes to infinity of |an+1/an|, we get Fn+110-(n+2) / Fn10-(n+1) = Fn+1/10Fn = φ/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.
From here, I am lost. I have done some calculations and written out the first hundred terms and they get close to .011235955056.
- #404
bluej
- 12
- 1
##\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##
\frac {1} {10} \sum_{n=1}^\infty \frac { F_n } {10^n}=\frac {1} {10} \frac {10} {89}=\frac {1} {89}=0.011235955##
Last edited:
- #405
lpetrich
Science Advisor
- 998
- 180
Solution of #94
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} $$
$$ 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} $$
- #406
- 20,815
- 28,445
95. What are the smallest emirp and permutable three digit primes in the decimal system?
D104
D104
- #407
KnotTheorist
- 24
- 9
113
131
311
131
311
- #408
- 20,815
- 28,445
Do you know the emirp, too?KnotTheorist said:
- #409
bluej
- 12
- 1
fresh_42 said:
smallest: 13; smallest 3-digit: 107
- #410
- 20,815
- 28,445
Three decimal digits!bluej said:
- #411
bluej
- 12
- 1
Knew you'd say datfresh_42 said:
added above in spoilerQuestion not stated very precisely Mr 42..
- #412
- 20,815
- 28,445
bluej said:
Question not read very precisely Mr. bluej..fresh_42 said:
- #413
bluej
- 12
- 1
Can be read in 2 parts as 1) smallest emirp and 2) permutable three digit primes (i.e. all?)fresh_42 said:
Smallest 3-digit emirp in 10base system is 107.
Its more interesting in base 16!
- #414
- 20,815
- 28,445
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
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
Last edited:
- #415
mfb
Mentor
- 37,402
- 14,234
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##.
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##.
- #416
- 20,815
- 28,445
97. What is the smallest natural number ##n## such that ##\varphi(n) \neq \varphi(p)## for all primes ##p\,?##
D105
D105
- #417
lpetrich
Science Advisor
- 998
- 180
#97 - presumably the Euler phi function, the count of all positive integers less than the arg that do not evenly divide the arg.
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 ##.
- #418
- 20,815
- 28,445
98. How many options are there to represent the number ##1,000## as sum of two or more consecutive natural numbers?
D106
D106
- #419
lpetrich
Science Advisor
- 998
- 180
#98
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
$$ 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
- #420
- 20,815
- 28,445
99. The regular ##4,294,967,295-##gon can be constructed with compass and ruler. How?
D106
D106
Similar threads
- · Replies 8 ·
Simple Induction
Interesting Algebra Problem
- · Replies 2 ·
- · Replies 7 ·
Challenge
Math Challenge - June 2023
- · Replies 80 ·
Challenge
Math Challenge - May 2021
- · Replies 114 ·