almost prime integer detail 殆素数
prime solution to even integer 偶数的素数解
integer with special prime dvisor 有特殊素因子的整数
Much as every integer can be broken down into a product of prime Numbers, the symmetries of any object can be constructed from a collection of basic building blocks known as simple groups.
正如每个整数都可用一些质数的积表示，任一对象的对称都可由所谓简单群的基本构件集合构造出来。
You could also write code that USES a positive integer's factors to determine if it is a prime number (defined as an integer greater than 1 whose only factors are 1 and the number itself).
您还可以编写代码，用一个正整数的因子来确定它是否为素数(定义为大于1的整数，该数字仅有的因子为1和本身)。
A prime number is an integer greater than or equal to 2 that has exactly two distinct natural number divisors, 1 and itself.
素数是指大于等于2且只有两个不同约数的整数：1和它自己。
应用推荐