<P><B>Abstract</B></P><P>Let PQ denote the set of n∈N such that n is a product of two primes with gcd(n,φ(n))=1 where φ is the Euler function. In this article we aim to find n∈PQ such that any ...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A107591653
-
2009
-
SCOPUS,SCIE
학술저널
30-38(9쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
<P><B>Abstract</B></P><P>Let PQ denote the set of n∈N such that n is a product of two primes with gcd(n,φ(n))=1 where φ is the Euler function. In this article we aim to find n∈PQ such that any ...
<P><B>Abstract</B></P><P>Let PQ denote the set of n∈N such that n is a product of two primes with gcd(n,φ(n))=1 where φ is the Euler function. In this article we aim to find n∈PQ such that any imprimitive permutation group of degree n is multiplicity-free. Let R denote the set of such integers in PQ. Our main theorem shows that there are at most finitely many Fermat primes if and only if |PQ−R| is finite, whose proof is based on the classification of finite simple groups.</P>
Some matrices associated with the split decomposition for a Q-polynomial distance-regular graph