# A sine product with (almost) integer values

Let n, k be integers, $n>1$ and $k \perp n$ denote that k, n are coprime and let $S_n = \{1 \le k \le \lfloor n / 2 \rfloor : k \perp n \}.$ Then $$n \left( \prod_{k \in S_{n}} \sin \left( k \frac {\pi}{n} \right) \right)^{-2} \in \mathbb{Z}.$$

I think this is surprising but I have no proof.

-

## 1 Answer

There are a number of results for products that are closely connected to your product. There are some inessential differences (inverse is not taken), and generally products are over all $k$ from $1$ to $n-1$ relatively prime to $n$, but that would be taken care of by your squaring. Here is a link to a fully available paper by Steven Galovich.

-

Thank you very much for this nice and highly relevant paper. Yes, I think the above formula can be justified by Galovich's theorems. – Jonas Alomo Jun 24 '11 at 21:48
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 7, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.968766450881958, "perplexity_flag": "head"}