Find ⌊ 2 9 3 3 × 3 7 4 1 × 4 5 4 9 × ⋯ × 2 0 0 5 2 0 0 9 × 2 0 1 3 2 0 1 7 ⌋ .
Details and assumptions
The function ⌊ x ⌋ : R → Z refers to the greatest integer smaller than or equal to x . For example ⌊ 2 . 3 ⌋ = 2 and ⌊ − 5 ⌋ = − 5 .
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.
nice one singh
a good one
Let A = 2 9 3 3 × 3 7 4 1 × … × 2 0 1 3 2 0 1 7 and B = 3 3 3 7 × 4 1 4 5 × … × 2 0 0 9 2 0 1 3
Notice that, by comparing the individual terms, we have 2 5 2 9 × B > A and 2 0 1 7 2 0 2 1 × B < A
So we have:
B × 2 0 1 7 2 0 2 1 < A < 2 5 2 9 × B
A B × 2 0 1 7 2 0 2 1 < A 2 < 2 5 2 9 × A B
2 9 2 0 2 1 < A 2 < 2 5 2 0 1 7
6 9 < A 2 < 8 1
8 < A < 9
Hence ⌊ A ⌋ = 8
Log in to reply
I was waiting for an answer like this...thanks Kyle.
I had a solution with the Gamma-function Γ ( x ) .
2 9 3 3 × 3 7 4 1 × … × 2 0 1 3 2 0 1 7 = ( 8 2 0 1 3 ) ! / ( 8 2 1 ) ! ( 8 2 0 1 7 ) ! / ( 8 2 5 ) ! = ( 8 2 0 1 3 ) ! ( 8 2 5 ) ! ( 8 2 0 1 7 ) ! ( 8 2 1 ) ! =
Γ ( 1 + 8 2 0 1 3 ) Γ ( 1 + 8 2 5 ) Γ ( 1 + 8 2 0 1 7 ) Γ ( 1 + 8 2 1 ) = 8 . 6 3 5 7 1 8 5 7 . . .
with Γ -functions calculated using Mathematica.
Beautifully presented.....awesome!
Well said, Kyle. This is basically what I did (except I was less formal).
How did u managed to get
2 9 2 0 2 1 < A 2 < 2 5 2 0 1 7
from A B × 2 0 1 7 2 0 2 1 < A 2 < 2 5 2 9 × A B ? I know you multiplied both sides by 2 9 2 0 1 7 , but what about the A B ?
Log in to reply
A B = ( 2 9 3 3 × 3 7 4 1 × … × 2 0 1 3 2 0 1 7 ) ( 3 3 3 7 × 4 1 4 5 × … × 2 0 0 9 2 0 1 3 )
A B = 2 9 3 3 × 3 3 3 7 × 3 7 4 1 × 4 1 4 5 × … × 2 0 0 9 2 0 1 3 × 2 0 1 3 2 0 1 7
A B = 2 9 2 0 1 7
I didn't multiply 2 9 2 0 1 7 to the leftmost and rightmost sides (which I can't do without also multiplying the middle part by it), but rather I substituted it for A B .
We can find upper bound by AM-GM i = 3 ∏ 2 5 1 8 i + 5 8 i + 9 ≤ 2 4 9 2 4 9 ( ∑ i = 3 2 5 1 8 i + 5 8 i + 9 ) 2 4 9 = 2 4 9 2 4 9 2 2 4 9 1 ⋅ ( 4 9 8 + ψ ( 8 2 0 2 1 ) − ψ ( 8 2 9 ) ) 2 4 9 ≈ 8 . 8 8 where ψ ( z ) is Digamma function.
lol
did anybody has manual solution
Well,here's a method,but it doesn't give us 8.[ EDIT: Thanks to A Joshi for spotting a mistake.I have corrected it,but this unfortunately gives an worse approximation]
There are 248 expressions in the numerator and 248 in the denominator.All the fractions are of the form x x + 4 .Since the terms aren't too big but there are way too many terms,we can approximate x x + 4 as 1 . 0 1 . Therefore,the whole expression becomes
1 . 0 1 ⋅ 1 . 0 1 . . . . . . . . 1 . 0 1 = ( 1 . 0 1 ) 2 4 8
which is approximately 1 1 . 7 9 .This gives us something close,but not the answer we are looking for.I am sure this method can be improved a bit to give us a closer value.
Log in to reply
There are not 24 but 248 expressions !
Log in to reply
Thank you,I have edited my earlier comment and made some suitable changes.Unfortunately,this gives us an worse approximation.
Well, considering lim x → 0 x x + 4 = ∞ and lim x → ∞ x x + 4 = 0 I don't think this is a good way to estimate.
Log in to reply
Your second limit is incorrect - lim x → ∞ x x + 4 = lim x → ∞ 1 + x 4 = 1 .
Kyle, How did you get that 2 5 2 9 × B > A ? (and the second inequality)
Log in to reply
We have the ff. inequalities:
2 5 2 9 > 2 9 3 3
3 3 3 7 > 3 7 4 1
until
2 0 0 9 2 0 1 3 > 2 0 1 3 2 0 1 7
Multiply all the left-hand sides and all the right-hand sides of the inequalities to get:
2 5 2 9 × 3 3 3 7 × . . . × 2 0 0 9 2 0 1 3 > 2 9 3 3 × 3 7 4 1 × . . . × 2 0 1 3 2 0 1 7
2 5 2 9 × B > A
The proof for the second inequality is similar.
Why did u multiply by A ?
By estimation with the claim 2 9 3 3 × 4 7 4 1 × . . . × 8 n + 5 8 n + 9 ∼ O ( n ) .
Notice that n + 4 n + 8 n n + 4 = ( n n + 4 ) 2 + O ( n − 2 ) but can we do better?
Consider n + k n + 8 + k − ( n n + 4 ) 2 = n 2 ( n + k ) ( 1 6 + 8 k ) n + 1 6 k so that if we set k = − 2 we get an error term of O ( n − 3 ) . When we multiply the error term the degree is increased by 2 since we have n 2 such error term.
∏ i = 3 n 8 i + 5 8 i + 9 = ∏ i = 3 n 8 i + 3 8 i + 1 1 + O ( i − 3 )
= ∏ i = 3 n ( 8 i + 3 8 i + 1 1 + O ( i − 3 / 2 ) ) = 2 7 8 n + 1 1 + O ( n )
So that [ 2 9 3 3 × 3 7 4 1 × . . . × 8 n + 5 8 n + 9 ] ≈ [ 2 7 2 0 1 9 ] = 8
Please note that it still yield error of order n that is very bad for such estimation but it is rather small (about ∼ 0 . 0 0 0 2 6 0 3 n ) so it can be neglected for such a small n .
Should be 8 i + 3 8 i + 1 1 + O ( i − 3 ) , sorry.
"#include <iostream>
int main()
{
double x = 1;
for(double i = 33; i<=2017; i+=8)
{ x=x*(i/(i-4)); }
cout << x;
system("pause"); return 0;
}
Log in to reply
haha nice way of doing it
i also did it in the same way
Can you explain why it is O(sqrt (n)) ??
Log in to reply
It's because we have n 2 such error terms so we multiply n 2 to the error term inside the product. I used i inside but this is also related to n the number of terms so it becomes O ( n ) .
If you are talking about the initial claim, it follows from the above calculation that the final result is about a constant times n . However, I must admit that I didn't 'prove' that it is really asymptotically equal to O ( n ) . To do this, we need an even better estimate, but that would make our calculation inconvenient.
include < iostream > using namespace std;
int main() { double x = 1; for(double i = 33; i<=2017; i+=8) { x=x*(i/(i-4)); } cout « x; system("pause"); return 0; } so answer is [8,63572]=8 :)
Let A = 3 3 . 4 1 . . . 2 0 1 7 3 7 . 4 5 . . . 2 0 2 1 < B = 2 9 . 3 7 . . . 2 0 1 3 3 3 . 4 1 . . . 2 0 1 7 < C = 2 5 . 3 3 . . . 2 0 0 9 2 9 . 3 7 . . . 2 0 1 3
Thus A . B < B . B < C . B . Now A . B = 2 9 2 0 2 1 and C . B = 2 5 2 0 1 7 . The result follows from 8 < A . B < B < C . B < 9 .
(1,25)^249 = 8, ... So, the answer is 8
WHY 1.25
Ya, how did you get that?
ok.. i use assumtion that (33/29)...(2017/2013) = 1,12 ...(249)...1,001 = | (1,25)^249 | = 8. [ n = 249]
Log in to reply
(1.25)^249 = 1.35x10^24....so not between 8 and 9!
(1.00839)^249= 8.008, (1.00886)^249 = 8.993
India me esa nahi chalta hai
If we recast the product in the form : (1+4/29)(1+4/37)...the natural log could be expanded in taylor series for ln(1+x) which can be approximated by the first term x resulting in a series of the form 4/29 + 4/37 +......248 terms. . I was also wondering if we could approximate the sum involved by an integral of the form : 4*$ dx / (29+8x) with x ranging from 1 to 248. The difference between the above integral and the discrete sum would most possibly be less than 1 , in fact it may be even lesser than euler's constant which is approximately 0.5
Problem Loading...
Note Loading...
Set Loading...
In this solution, we use telescoping series & inequalities to approach the problem. The motivation is that: we cannot calculate the fraction exactly at hand, & that is not asked for. We can approximate it, at best, to get an exact floored value. We will make the required value less than and greater than 2 fairly close values, which are easy to calculate, since they telescope. This is fairly a standard technique in such a problem involving a fraction whose numerators & denominators are in A.P.
Note that I = 2 9 3 3 ⋅ 3 7 4 1 ⋅ 4 5 4 9 ⋯ 2 0 0 5 2 0 0 9 ⋅ 2 0 1 3 2 0 1 7
< 2 5 2 9 ⋅ 3 3 3 7 ⋅ ⋯ 2 0 0 7 2 0 1 3 .
Multiplying I to both sides we see that the right side telescopes to 2 5 2 0 1 7 , thereby I < 2 5 2 0 1 7 .
Similarly, I > 3 3 3 7 ⋅ 4 1 4 5 ⋯ 2 0 0 9 2 0 1 3 ⋅ 2 0 1 7 2 0 2 5 ⇒ I 2 > 2 9 2 0 2 5 ⇒ I > 2 9 2 0 2 5 .
Using the above estimates, we see: ⌊ I ⌋ = 8 .