prime numbers发音

意思翻译

质数；[数]素数（primenumber的复数）

相似词语短语

prime───vi.作准备；adv.极好地；n.初期；青年；精华；全盛时期；n.(Prime)人名；(英)普赖姆；(德)普里梅；adj.主要的；最好的；基本的；vt.使准备好；填装

prefixed numbers───带前缀的数字

numbers───n.（Numbers）Numbers表格；n.[数]数字（number的复数）；算术

use numbers───使用数字

informer prime───告密者

twitch prime───抽搐素数

prime script───原稿

prime day───亚马逊会员促销日

ramified prime───分支素数

双语使用场景

That is impressive because those are three consecutive prime numbers.───这是令人印象深刻的，因为7、11和13刚好是三个连续的素数。

This is because there are comparatively many more non-prime Numbers than primes.───这是因为非素数比素数多得多。

You pick two huge prime numbers "p" and "q."───首先 选择两个很大的质数“p”和“q”，并对他们求积得到“n=p*q”。

For the purposes of describing where to put the probes, we're going to look at a simple program for determining prime numbers.───为了说明把探测放在什么地方，我们来看一个用于判断素数的简单程序。

However, one can find such a pair of prime numbers, if any, for a given even number.───但是，如果对于给定的一个偶数，存在这样一对素数的话，人们是可以找到的。

First, the computer must determine the factors of the large number. Then, the computer must determine if the factors are prime numbers.───首先，计算机要找到这个数字的因子，然后该计算机还要判定这个是因子是否是素因子。

Goldbach Conjecture to prove that an arbitrary large even number can be expressed into two prime numbers, and!───哥德巴赫猜想，证明任意大的一个偶数都可以表示成为两个素数的和！

Numerous arithmetical problems concern prime numbers and most of them still remain unresolved, sometimes even after several centuries.───大量的数论问题都跟素数相关，它们中的大部分仍然悬而未解，有些甚至过了几个世纪依然无法攻克。

If a sequence of three integers contains two prime numbers and an integer, and that integer must be dividable by three.───如果一个序列的三个整数包含两个素数和一个整数，该整数必须可分三。

英语使用场景

A simple code to generate prime numbers. Applet of the type of procedure!

Guide the Number Muncher to all the prime numbers.

In the same way, it is not known if there exists an infinity of prime numbers, the decimal representation of which does not use the digit 7.

Consider the relative frequency of prime numbers.

2, 3 and 7 are prime numbers.

To multiply several prime numbers into a larger product is easy; any elementary school kid can do it.

We do not collect prime numbers or polynomials.

In this paper we study systems of Diophantine inequalities and equations with prime numbers. We improve previous results by more delicate estimates of exponential sums.

If a sequence of three integers contains two prime numbers and an integer, and that integer must be dividable by three.