A number Z is equal to
Where P is equal to the floor of 1000 times S, where S is:
And Q is defined as the smallest positive integer solution to the equation:
Where a,b,c, and d are positive distinct integers;
Then find Z, where:
Details and Assumptions:
You may use a calculator if you wish, but you may not use Wolfram Alpha.
Good Luck!
If you have any questions or concerns, please notify me in the comments section.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 ∘ Finding P .
In order to find P we are first obliged to find S .
Considering S = ∑ n = 1 1 0 0 n 1 , we can easily recognize it to be a harmonic series sum. Although it has been proven that the series diverges, it does that very slowly, which is due to the fact that the partial sums of the series have logarithmic growth.
However, Euler made an approximation of this series, which states that
∑ n = 1 k n 1 = ln k + γ + ϵ k , where γ ≈ 0 . 5 7 7 2 1 is the Euler–Mascheroni constant and ϵ k = 2 k 1 , which obviously approaches 0 as k → ∞ .
Consequently, we are able to approximate the sum of the first 1 0 0 terms.
Therefore, we find
S = ∑ n = 1 1 0 0 n 1 = ln 1 0 0 + γ + ϵ 1 0 0 ≈ 5 . 1 8 7 3 8 (this is the part where we use a calculator)
Now we can easily find P , considering 1 0 0 0 S = 5 1 8 7 . 3 8 and ⌊ 1 0 0 0 S ⌋ = 5 1 8 7 .
Thus, we get P = 5 1 8 7
2 ∘ Finding Q .
Let us first look at the equation a 3 + b 3 = c 3 + d 3 . This is a Diophantine equation which has infinitely many solutions. However, if we are trying to find the smallest positive solution for Q , we should look at Q as a Taxicab number *, especially considering in both equations (namely a 3 + b 3 = Q and c 3 + d 3 = Q ) Q equals the sum of two cubes. Since we are looking at 2 equations, it is obvious that we need T a ( 2 ) (more commonly known as the Hardy-Ramanujan number), which equals 1 7 2 9 .
Thus, we get Q = 1 7 2 9
From 1 ∘ and 2 ∘ we can finally find Z , which is
Z = Q P = 1 7 2 9 5 2 8 7 = 3 .
Therefore, the solution is Z = 3 .
*In mathematics, the n -th Taxicab number (denoted T a ( n ) ) is defined as the smallest positive number that can be expressed as the sum of two positive algebraic cubes in n distinct ways. The second Taxicab number in particular is more commonly known as the Hardy-Ramanujan number and is also the reason why these numbers got the name "Taxicab".
The anecdote says that while Ramanujan was lying in hospital sick of tuberculosis, Hardy used to visit him every day. One day, Hardy was taken to the hospital with a taxi numbered 1 7 2 9 . He then remarked to his friend that it might be a bad omen since he found the number 1 7 2 9 to be rather dull. However, to his amusement, Ramanujan noted that 1 7 2 9 was in no case a dull number, but the smallest possible number that can be represented as a sum of two cubes in two distinct ways!
Thus, in honor of Hardy's and Ramanujan's "accidental" discovery, these kinds of numbers are called Taxicab Numbers .