查询词典 integer solution

Typically,0.2 mmol of Cd solution, and 0.4 mmol of MPA solution were mixed in a 40 ml solution and the pH of the solution was adjusted to 10.0 by solution was palced in a three-necked flask and was deaerated.

通常情况下， 0.2浓度的镉溶液，和0.4浓度的MPA的混合溶液中40ml溶液和pH值的溶液是调整，以10.0的溶液放置在是在三口瓶中，并除去溶液中的气体。

Typically,0.2 mmol of cd solution, and 0.4 mmol of mpa solution were mixed in a 40 ml solution and the ph of the solution was 二氰基丙酸乙酯 to 10.0 by solution was palced in a three-necked flask and was deaerated.

通常情况下， 0.2浓度的镉环硫乙烷，和0.4浓度的mpa的混合溶液中40巯基丙酸甲酯溶液和ph值的溶液是调整，以10.0的溶液放置在是在三制作乙酸钙中，并除去溶液中的气体。

Such a process includes the preparation of an initial stabilized peptized solution including a titanium precursor material, an organic solvent, an acid agent, the mixing of said initial solution with a large amount of water, the pH of the obtained intermediate solution being less then 3, subjecting said intermediate solution and its dispersion to a heat-treatment, the exchange of water by an organic solvent with low surface tension to obtain a final solution that is finally dispersed.

这样一种方法包括制备包含钛母体材料、有机溶剂、酸介质之开头的稳定化胶溶溶液，将此起始溶液同大量水混合，所得到中间溶液的pH小于3，使此中间溶液及其分散体系经受热处理，用低表面张力的有机溶剂更换水来获得末了加以分散的最终溶液。

This article outlines the integer aliquot concept in the first primary theory of numbers, the basic nature, as well as some special integer divisible characteristics.

本文先概述初等数论中整数的整除概念、基本性质，以及一些特殊整数的可除性特征。

Carries on the classification to the question, analyzes each kinds of questions the explanation mentality, inquires and summarizes that it can 100 within the odd number aliquot aliquot characteristic, finally discovered that any integer can by the lowliest place digit be 1,3,7,9 aliquot integer characteristics according to the lowliest place numeric classification, each kind has certain rule.

对问题进行分类，分析各类问题的解答思路，探寻、总结出能被100以内奇数整除的整除特征，结果发现任何一个整数能被末位数字是1，3，7，9整除的整数特征可按末位数字分类，每一类都有一定的规律。

Finally, we obtain the solutions of the 0-1 Integer Programming problem. The most merit of the model is its automatization characteristic, and the model fits to solve arbitrary 0-1 Integer Programming problem having arbitrary variable element.

该模型的最大优点在于具有自动化的特点；同时，从理论上来讲，该模型适合含有任意变量的任意0-1整数规划问题的求解。

We studied the asymptotic properties of the integer part of the k-th root positive integer and gave an interesting asymptotic formula.

研究了一个关于正整数κ次根的整数部分序列的均值，并利用初等的方法得到了一个有趣的渐近公式： 3。

A verifier can be convinced that the committed number x is neither less than the integer a nor more than the integer baiter the protocol is operated only once, and hence the exact proof that x lies in the interval is achieved.

为了去掉这种方法上的重复性，通过联合运用两承诺值相等协议及CFT证明协议提出了一个证明承诺值位于特定区间的新协议，协议运行一次便可使验证者确信承诺值x位于区间中。

In the problem, there are m persons who are to be assigned to do n jobs, and the number of the persons who are assigned to do the jth job is bj, where bj is an unknown positive integer number to be calculated such that djbjej, dj and ej are known positive integer number (j=1,2,…,n) such that ∑nj=1bj=m and m≥n.

考虑一类较一般的最优指派问题：欲指派m个人做n项工作，要求每个人只做一项工作，第j项工作可以由bj个人共同去做，其中bj是待求未知数，满足dj≤bj≤ej(即ej，dj为第j项工作所需人数的上下限)及∑nj=1bj=m，dj，ej为已知常数，j=1，…，n。

In the thesis , we give combinatorial proof of some q-identities using integer partition.In the thesis some vital identities with binomial coefficient are given with their combinatorial proof, and the q-analogues of some identities are offered with corresponding combinatorial proof using integer partition.

本文给出了一些重要的二项式系数恒等式的组合证明或组合解释，并从分拆的角度给出了一些q-恒等式的组合证明，其中突出的成果是给出了平方和恒等式的一个直接的组合证明并给出了偶数平方和与奇数平方和的q-模拟及组合证明。

But this is impossible, as long as it is engaging in a market economy, there are risks in any operation.

但是，这是不可能的，只要是搞市场经济，是有风险的任何行动。

We're on the same wavelength.

我们是同道中人。