MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

All of the following ${p_{i},q_{i}}$are prime numbers, ${n,m,k}$ are pre-assigned integers. Consider the product of cyclic groups $\prod_{1}^{n} \mathbb Z_{p_{i}^{n_{i}}}$ then we asked the question:

How many subgroups of order $\prod_{1}^{n} p_{i}^{m_{i}}$ are there in the finite product of cyclic group?$(m_{i} \leqslant n_{i})$

For the initial problem, it's relatively easier,

How many subgroups of order $2^k$ in the product $\mathbb Z_{2^p} \times > \mathbb Z_{2^q}$? $(k \leqslant p \times q)$

It's not considered as a homework problem, I guess. Back ground My tutor once stated this problem as some simple application of Sylow Thm and found herself stuck there...

share|cite|improve this question
See my answer to this question:… – Greg Martin Apr 2 '13 at 5:35
Why not just consider one prime at a time? – S. Carnahan Apr 2 '13 at 6:39
I hope the revised question communicates what you intended to ask. – S. Carnahan Apr 2 '13 at 6:48
I might misused the headscript, I did correct it, and now it's clear. Mr. Martin's answer may solve my question greatly, but we discussed this afternoon and the problem is to deal with the different torsions arisen in Fund. Gen. Abelian group Thm. So I don't know if the attempt to reduce the problem to a single prime at a time will cause loss to generality. At least my tutor stated this problem twice and both in the same form. Reason why I tagged it representation problem is because I did remember a similar exercise related to it. – Henry.L Apr 2 '13 at 10:41
FYI:And a more complicated version of the problem is to restrict ourselves to only one prime but with infinite product. – Henry.L Apr 2 '13 at 10:41

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.