f ( x ) = x + k = 2 ∑ ∞ j = 1 ∏ k ( 2 j − 1 ) j = 1 ∏ k − 1 2 j x 2 k − 1
Function f ( x ) is defined as above for all real x ∈ ( 0 , 1 ) . Find the remainder when ( π 6 ) 2 0 1 9 ( f ( 8 0 7 6 6 0 5 7 ) ) 2 0 1 9 is divided by 2 0 1 9 .
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.
Actually I don't have a solution. Need not make the ∏ too big. The ∑ looks small then and the whole expression looks odd. That is a reason why \ [ \ ] is designed like that. You enter far too many braces { }. Note that \frac 6 \pi π 6 , \tan \theta tan θ and \sin^2 x^2 sin 2 x 2 all work. Don't use \left( \right) unless it is necessary. I will make the brackets bigger than necessary. I amended the problem wording for you actually.
Also the problem should be classified under Calculus instead of Algebra because it involves ∞ . Why must the part of getting of the final answer to be submitted be so tough and misleading. You are testing people to be careful and their patience rather than mathematical skills. I gave up the computation and use Wolfram Alpha instead because I don't think I will learn anything new. The final answer part is to make sure we answer in integer because decimal answer we can get from calculator. Anyway "one of the possible remainders" is unnecessary because sin − 1 x is defined in − 2 π ≤ x ≤ 2 π .
I have added a solution for finding the remainder.
@Chew-Seong Cheong , thanks for suggestions regarding problem framing and use of latex symbols properly. I will keep this in mind.
Problem Loading...
Note Loading...
Set Loading...
Expanding f ( x ) , we have:
f ( x ) = x + 3 2 x 3 + 3 ⋅ 5 2 ⋅ 4 x 5 + 3 ⋅ 5 ⋅ 7 2 ⋅ 4 ⋅ 6 x 7 + ⋯ = k = 0 ∑ ∞ ( 2 k + 1 ) ! ! ( 2 k ) ! ! x 2 k + 1 = 1 − x 2 sin − 1 x Can prove it by Taylor series
Therefore, f ( 8 0 7 6 6 0 5 7 ) = f ( 2 3 ) = 1 − 4 3 sin − 1 2 3 = 3 2 π and
( π 6 f ( 8 0 7 6 6 0 5 7 ) ) 2 0 1 9 ≡ ( π 6 ⋅ 3 2 π ) 2 0 1 9 (mod 2019) ≡ 4 2 0 1 9 (mod 2019) ≡ 6 4 (mod 2019) See note.
Note: Note that 2 0 1 9 = 3 × 6 7 3 has two prime factors. Consider each factor separately.
For factor 3: 4 2 0 1 9 ≡ ( 3 + 1 ) 2 0 1 9 ≡ 1 2 0 1 9 ≡ 1 (mod 3)
For factor 673: Since g cd ( 4 , 6 7 3 ) = 1 , Euler's theorem applies and since 673 is a prime, Euler's totient function ϕ ( 6 7 3 ) = 6 7 3 − 1 = 6 7 2 . Then 4 2 0 1 9 m o d ϕ ( 6 7 3 ) ≡ 4 2 0 1 9 m o d 6 7 2 ≡ 4 3 ≡ 6 4 (mod 673) .
Since 6 4 ≡ 1 (mod 3) , 4 2 0 1 9 ≡ 6 4 (mod 2019) .