If r = 1 ∏ n ( 2 r − 1 ) = 1 3 5 1 3 5 , find the value of n .
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.
It can also be shown that: n ! < 2 n ( n ! ) ( 2 n ) ! < ( 2 n ) ! n > 1 The right-hand side is trivial so I'll use induction for the LHS: For n = 2: LHS = 2 and middle = 3 so the inequality is true thus far. Now assume n = k is true, such that for n = k+1: ( ( k + 1 ) ! = k ! ( k + 1 ) < ( k + 1 ) ! 2 k + 1 ( 2 ( k + 1 ) ) ! = ( 2 k + 1 ) k ! 2 k ( 2 k ) ! ⇒ 2 k + 1 > k + 1 Q . E . D . ∴ n ! < r = 1 ∏ n ( 2 r − 1 ) < ( 2 n ) ! ∀ ( n > 1 )
Azhaghu Roopesh M posted this idea in the comments.
Note that this is the very definition of the odd double factorials. That is r = 1 ∏ n ( 2 r − 1 ) = ( 2 n − 1 ) ! ! We are given that the product is 1 3 5 1 3 5 . Note that 1 3 5 1 3 5 = 1 3 ! ! Then ( 2 n − 1 ) ! ! = 1 3 ! ! 2 n − 1 = 1 3 n = 7
How can we "note" that thing?
Just Prime factorize it and bundle them to form Odd positive integers.
1 3 5 1 3 5 = 1 × 3 × 5 × 7 × 9 × 1 1 × 1 3
Max odd integer=13
Hence 2 n − 1 = 1 3 (at max n = r )
∴ n = 7
Can you post a solution without prime factorization? I knew this method . since this is my first calculus-related problem, there might be some elegant way to solve it.
I might have increased the number of the right hand side . In that case, such a solution may be useful which is in terms of 'n'. May be Calculus master @Caleb Townsend may post it. :) Thanks!
Log in to reply
Nihar Mahajan
Here's a calc solution :P
The given product is actually the Double Factorial Function .
As simple as that !
Log in to reply
Exactly!I wanted this ! When you will come back ,till then I would try to learn some Calculus , so that we can have more fun. Thanks!
Log in to reply
@Nihar Mahajan – 1-2 years .
@Nihar Mahajan – I can't post anything better than what has already been said. I used the solution involving the double factorial of odd integers, as I remembered the number 1 3 5 1 3 5 . There are ways to establish formulas for products and sums, but the simplest form in this case is P = ( 2 n − 1 ) ! ! I will post this solution with credit to Azhaghu.
As 1 3 5 1 3 5 = 1 0 0 ˙ + 3 5 ≡ 1 0 ( m o d 2 5 ) and 1 3 5 1 3 5 ≡ − 1 + 3 − 5 + 1 − 3 + 5 ( m o d 1 1 ) ≡ 0 ( m o d 1 1 ) , it implies that 1 1 ≥ 2 n − 1 > 1 5 ⇒ 6 ≥ n > 8 ⇒ n = 6 o r 7 . We can try three times, but ∏ r = 1 6 ( 2 r − 1 ) = 1 0 3 9 5 and ∏ r = 1 7 ( 2 r − 1 ) = 1 3 5 1 3 5
i think there are plenty of good solutions but i'm going to write the easiest : r = 1 ∏ n ( 2 r − 1 ) = ( ( 1 ∗ 2 ) − 1 ) ( ( 2 ∗ 2 ) − 1 ) ( ( 3 ∗ 2 ) − 1 ) ( ( 4 ∗ 2 ) − 1 ) . . . . . . . . = 1 ∗ 3 ∗ 5 ∗ 7 ∗ . . . . . . . and this pattern continues , i.e , multiplying out odd numbers to get 135135 Now , by multiplying the first few odd integers we got from the expansion ,and dividing 135135 by the answer we get 1 ∗ 3 ∗ 5 ∗ 7 = 1 0 5 , 1 0 5 1 3 5 1 3 5 = 1 2 8 7 we next divide 1287 by the next odd integer , which is 9 9 1 2 8 7 = 1 4 3 , we then divide this answer by the next odd integer , which is 11 1 1 1 4 3 = 1 3 and the number we get is the next odd integer in the progression , so that implies that the number 135135 could be written like 1 3 5 1 3 5 = 1 ∗ 3 ∗ 5 ∗ 7 ∗ 9 ∗ 1 1 ∗ 1 3 which would imply that 2 r − 1 = 1 3 2 r = 1 3 + 1 = 1 4 that is r = 2 1 4 = 7 which means that n = 7 or in other words , that value of r=7 would give 13 .
1 3 5 1 3 5 = 1 × 3 × 5 × 7 × 9 × 1 1 × 1 3
2 r − 1 = 1 3
r = 7
I knew that it was easy to guess. Well it would have been better if you had posted an elegant solution!
Problem Loading...
Note Loading...
Set Loading...
This isn't the most elegant solution but it creates a nice looking formula... r = 1 ∏ n ( 2 r − 1 ) = r = 1 ∏ n 2 r r = 1 ∏ 2 n r = 2 n ( n ! ) ( 2 n ) ! = 2 n n ! ( n 2 n ) Now we can go further by showing that: A s n → ∞ , ( n 2 n ) → n π 4 n ⇒ n → ∞ lim r = 1 ∏ n ( 2 r − 1 ) = + π n ! ( n − 1 ) ! 4 n (Plugging in n=7 gives 135135 in the first formula and 137567.7... in the second)