k = 1 ∏ 2 0 1 5 k 2 + 5 k + 6 k 2 + k
If the product above can be written as ( a 4 × b × c × d × e 2 ) − 1 for distinct primes a , b , c , d , e , evaluate a + b + c + d + e .
You may use the List of Primes as a reference.
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.
This fraction could be simplified as
2 2 0 1 7 ! × 6 2 0 1 8 ! ( 2 0 1 5 ! ) × ( 2 0 1 6 ! )
By simplification, this becomes
( 2 0 1 7 × 2 0 1 6 × 2 0 1 5 ! ) × ( 2 0 1 8 × 2 0 1 7 × 2 0 1 6 ! ) 2 2 × 3 × 2 0 1 5 ! × 2 0 1 6 !
We easily cancel the numbers in red, then we factorize the numbers, which yield us
2 0 1 7 2 × 1 0 0 9 × 2 6 × 3 2 × 7 2 2 × 3
Thus, cancelling the terms we get
( 2 4 × 3 × 7 × 1 0 0 9 × 2 0 1 7 2 ) − 1
Giving us
2 + 3 + 7 + 1 0 0 9 + 2 0 1 7 = 3 0 3 8 .
It would be better to clarify this line.
This fraction could be simplified as 2 2 0 1 7 ! × 6 2 0 1 8 ! ( 2 0 1 5 ! ) × ( 2 0 1 6 ! )
Yes, this is an approach that doesn't deal with telescoping product.
The fraction can be factored as ( k + 2 ) ( k + 3 ) k ( k + 1 ) , so consider the expansion of the product from this form:
( 3 ) ( 4 ) ( 1 ) ( 2 ) ∗ ( 4 ) ( 5 ) ( 2 ) ( 3 ) ∗ ( 5 ) ( 6 ) ( 3 ) ( 4 ) ∗ . . . ∗ ( 2 0 1 6 ) ( 2 0 1 7 ) ( 2 0 1 4 ) ( 2 0 1 5 ) ∗ ( 2 0 1 7 ) ( 2 0 1 8 ) ( 2 0 1 5 ) ( 2 0 1 6 )
Note that the numerator of the 3rd fraction matches the denominator of the first fraction. This pattern would continue until the end, and allows us to reduce almost everything, leaving only the following:
( 2 0 1 6 ) ( 2 0 1 7 ) ( 2 0 1 7 ) ( 2 0 1 8 ) ( 1 ) ( 2 ) ( 2 ) ( 3 )
By reducing the numerator with the 2016, we get:
( 1 6 8 ) ( 2 0 1 7 2 ) ( 2 0 1 8 ) 1
It is helpful to point out that 2017 and 1009 are primes, so the prime factorization of the denominator goes quickly into:
( 2 4 ) ( 3 ) ( 7 ) ( 1 0 0 9 ) ( 2 0 1 7 2 ) 1
Thus, 2 + 3 + 7 + 1 0 0 9 + 2 0 1 7 = 3 0 3 8
Simple standard approach, recognizing that we had a canceling telescoping product.
Problem Loading...
Note Loading...
Set Loading...
We can rewrite this as:
k = 1 ∏ 2 0 1 5 ( k + 2 ) ( k + 3 ) k ( k + 1 )
= k = 1 ∏ 2 0 1 5 [ k + 1 k ⋅ k + 2 k + 1 ⋅ k + 2 k + 1 ⋅ k + 3 k + 2 ]
Solving the four telescopic products:
= 2 0 1 6 1 ⋅ 2 0 1 7 2 ⋅ 2 0 1 7 2 ⋅ 2 0 1 8 3
And simpliflying, we get
= 2 4 ⋅ 3 ⋅ 7 ⋅ 1 0 0 9 ⋅ 2 0 1 7 2 1
And our answer is 2 + 3 + 7 + 1 0 0 9 + 2 0 1 7 = 3 0 3 8