4
$\begingroup$

Does the sequence $\sin(n!)$ diverge(converge)?

It seems the sequence diverges. I tried for a contradiction but with no success. Thanks for your cooperation.

$\endgroup$
  • $\begingroup$ Does the sequence $\sin n$ diverge (converge)? $\endgroup$ – Jika May 27 '14 at 14:07
  • 3
    $\begingroup$ If $n!$ is in degrees (instead of radians), then $\sin(n!)=0$ for all $n\geq6$. $\endgroup$ – barak manos May 27 '14 at 14:12
  • 4
    $\begingroup$ This looks harder than the divergence of $\sin n$. For one, if $\sin n!$ diverges, it follows automatically that $\pi$ is irrational, which is not an obvious fact. With $\sin n$, on the other hand, it is quite easy to prove divergence without knowing that $\pi$ is irrational. $\endgroup$ – Dan Shved May 27 '14 at 14:25
  • 1
    $\begingroup$ Same question for $\cos(n!)$, with some interesting commentary and answers: math.stackexchange.com/questions/8690/is-there-a-limit-of-cos-n $\endgroup$ – Hugh Denoncourt May 27 '14 at 23:51
  • $\begingroup$ My suspicion is that this diverges but that that is not easy to show. (This assumes radians are used.) $\endgroup$ – Michael Hardy Aug 9 '17 at 18:38
1
$\begingroup$

Depends on whether the parameter of $\sin$ is in radians or degrees. If in degree, $n!$ becomes multiple of 360 and after that function value will be zero, for all value of $n$.

In radians this will not happen as $\pi$ is irrational.

$\endgroup$
  • $\begingroup$ I've up-voted this answer, but perhaps one should be explicit in saying that it is incomplete. It doesn't say whether the proposed sequence converges. But that is probably a very hard problem. $\endgroup$ – Michael Hardy Aug 9 '17 at 18:37
-1
$\begingroup$

Hint: Take a subsequence in which $a_{n_i} \approx \pi ( 4i+1)/2 $ and another where $b_{n_j} \approx \pi ( 4i +3)/2$.

$\endgroup$
  • $\begingroup$ Your notation is confused; presumably you mean something like $n_i!\to\pi/2\pmod{2\pi}$. But more importantly, are you sure that your hint can actually be followed through? According to this discussion on MathOverflow, the divergence of $\cos(n!)$, which is equivalent to the divergence of $\sin(n!)$, would imply that $e+\frac{1}{2\pi}$ is irrational, solving an open problem. Your hint works for $\sin n$, but it seems like no one knows whether such subsequences exist here. $\endgroup$ – epimorphic Feb 20 '15 at 2:52
  • $\begingroup$ My hint is to realize you may choose a subsequence in which $sin(n_i!) > 0$ and another in which $sin(n_i)<0$. I guess my notation was bad, but I meant approximately around $1$ and $-1$ respectively. $\endgroup$ – Jeb Feb 20 '15 at 15:23
  • $\begingroup$ As I wrote after that, the "may choose" part needs to be justified because no one has ever been able to prove the simultaneous existence of both sequences. We can't just appeal to the irrationality of $\pi$ as one does when proving that $\sin n$ diverges. For example, one of the other answers in the MO question I linked to shows that $n! \to 0 \pmod{e}$. $\endgroup$ – epimorphic Feb 20 '15 at 15:31
  • $\begingroup$ Gotcha, I figured one may derive the sequence I approximated after playing around with sterling formula for a bit....Guess it's not that easy. $\endgroup$ – Jeb Feb 20 '15 at 21:33

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.