+0  
 
+11
1286
11
avatar+983 

Solve the equation:

 

\(\sqrt{a-\sqrt{a+x}}=x\)

 

Prove that if p is a prime number greater than 3, then the numerator of the reduce fraction is:

 

\(1 + \frac{1}{2} + \frac{1}{3} + \dots + \frac{1}{p-1}\)

 

Prove without using logarithm tables, that:

 

\(\frac{1}{\log_2\pi}+\frac{1}{log_5\pi}>2\)

 

In chess, is it possible for the knight to go from the bottom right corner to the upper left corner, but also landing on every single square in the process. 

 

These are really hard, so if you don't know them it's fine. 

 

I just wanted to share these cool problems with you. 

 Apr 27, 2018
edited by GYanggg  Apr 27, 2018
edited by GYanggg  Apr 27, 2018
 #1
avatar
-1

GYanggg: Here is a "real world" problem for you to solve:

The Red Cross in Geneva, Switzerland was offered the following deal by one of the big Swiss banks:

Deposit 1 Swiss franc in the first month, 2 Swiss francs in the second month, 3 Swiss francs in the third month......and so on for 1,000 Swiss francs in the 1000th month, the bank would pay the Red Cross 6% interest compounded monthly on ALL the money deposited. How much money would the Red Cross have accumulated in their account at the end of the 1000th month?

 Apr 28, 2018
 #2
avatar+118678 
+3

Hi Gavin,

I'll give this one a go :)

 

\(\frac{1}{\log_2\pi}+\frac{1}{log_5\pi}>2\)

 

\(LHS\\ =\frac{1}{\log_2\pi}+\frac{1}{log_5\pi}\\ =1\div \frac{\log_\pi\pi}{\log_\pi2}+1\div \frac{\log_\pi\pi}{\log_\pi5}\\ =\frac{\log_\pi2}{\log_\pi\pi}+ \frac{\log_\pi5}{\log_\pi\pi}\\ =\frac{\log_\pi2+\log_\pi5}{\log_\pi\pi}\\ =\frac{\log_\pi10}{1}\\ =\log_\pi10\\ \text{Now pi^2 is approx 9.87 which is less than 10 so}\\ =\log_\pi(\pi^2*\delta) \qquad \text{where delta is a real number slightly bigger than 1}\\ =\log_\pi(\pi^2) +\log_\pi \delta\\ =2+\text{a small positive number}\\ >2\)

 

QED

 Apr 28, 2018
 #3
avatar+983 
+2

Wow! Well done!

GYanggg  Apr 28, 2018
 #4
avatar+983 
+3

Here is my solutions.

 

4. To "light" up all the squares with a knight going from A1 to H8, the knight must travel 63 times.

 

Everytime a knight moves, it goes from black to white square and vise versa. 

 

To go from white to white, the knight must move an even amount of times. 

 

Therefore this is not possible. 

 Apr 28, 2018
 #5
avatar
0

GYanggg, what reduced fraction are you talking about in your second question?

Guest Apr 29, 2018
 #6
avatar+983 
+1

When you add everything up, you reduce the fraction,

 

Would you like the solution?

GYanggg  Apr 29, 2018
 #7
avatar
0

When you add WHAT? the harmonic series up to 1 over p-1? What reduced fraction are you talking about?

Guest Apr 30, 2018
 #8
avatar
0

GYanggg, can you please rewrite the second question? i didn't understand it.

 

thanks!

Guest Apr 30, 2018
 #9
avatar+983 
+2

You add up the fractions.

 

You can see the pattern in the denominators, 1, 2, 3, ....

 

Until p-1, where p is a fraction greater than 3. 

 

Would you like me to post the solution?

 

I hope this answered you question, 

 

Gavin.

 Apr 30, 2018
 #10
avatar
0

1. Do you mean "p is a prime greater than 3"?

 

2. Where is the question? Ok, so we add 1+1/3+1/3+...+1/(p-1), what is the question? You didn't ask me to solve anything.

Guest May 1, 2018
 #11
avatar
0

Prove that the numerator of the reduced fraction is divisible by p^2

 May 1, 2018

4 Online Users

avatar
avatar
avatar