Let $m_i\geq 2 (1\leq i\leq n)$ be $n$ pairwisely coprime positive integers and let $q_i\geq 2 (1\leq i\leq n)$ be $n$ arbitrary prime powers, let$A=\prod_{i=1}^n(({q_i}^{m_i}-1)/(q_i-1))$. Let $\sigma(A)$ be the number of different prime factors of A, is it true that $\sigma(A)\geq n$? If this is not true, is there is a counterexample? Is there a good way to estimate $\sigma(A)$?
|
2 | deleted 3 characters in body | ||
|
|
||||
|
|
1 |
|
||
The number of different prime factors of a special class of positive integersLet $m_i\geq 2 (1\leq i\leq n)$ be $n$ pairwisely coprime positive integers and let $q_i\geq 2 (1\leq i\leq n)$ be $n$ arbitrary prime powers, let$A=\prod_{i=1}^n(({q_i}^{m_i}-1)/(q_i-1))$. Let $\sigma(A)$ be the number of different prime factors of A, is it true that $\sigma(A)\geq n$? If this is not true, is there is a counterexample? Is there a good way to estimate $\sigma(A)$?
|
||||
