let $n=p_1+p_2+\cdots+p_k$ ($p_k$ is kth prime number) then $\prod_{i=1}^k p_i$ is maximum order in $S_n$.
I think it is easy but I am trying to prove it , but I have not any idea how to deal with it. any suggestions ?
thanks
Asked
Active
Viewed 1,003 times
6
-
@martin sleziak :thanks martin – Bobby Jan 25 '12 at 16:24
-
@jonas meyer the part 1 is not hard I can construct element with order \prod_{i=1}^k p_i but i can't show the part 2 – Bobby Jan 25 '12 at 19:54
-
yes but i cant show this – Bobby Jan 25 '12 at 20:10
1 Answers
11
It isn't true in general. I found a reference to a counterexample with Google's help (specifically mentioned in this article, page 9 of the pdf file, page 359 of the publication). Namely, when $k=9$, so that$$n=100=2+3+5+7+11+13+17+19+23,$$ note that $$2^4+3^2+5+7+11+13+17+19=97<100,$$ so $S_{100}$ has an element of order $$2^4\cdot3^2\cdot5\cdot7\cdot11\cdot13\cdot17\cdot19=232,792,560,$$ which is greater than $$2\cdot3\cdot5\cdot7\cdot11\cdot13\cdot17\cdot19\cdot23=223,092,870.$$
Jonas Meyer
- 53,602
-
2(I am not sure if the link is meant to persist, so I am posting a reference to the said article.) David Gomez-Ullate and Matteo Sommacal, Periods of the Goldfish Many-Body Problem (Journal of Nonlinear Mathematical Physics). – Srivatsan Jan 25 '12 at 20:36