因为素因子集(N∋P_α={p_α∈P_α:2〖≤∀p〗_α,√n→∞})为已知集,所有合数都只归属于它的一个最小素因子族集(N∋d_(σ≤的英语翻译

因为素因子集(N∋P_α={p_α∈P_α:2〖≤∀p〗_α,√n→∞

因为素因子集(N∋P_α={p_α∈P_α:2〖≤∀p〗_α,√n→∞})为已知集,所有合数都只归属于它的一个最小素因子族集(N∋d_(σ≤α)⊂d_α)。使带余除法整数的素因子分解,(n^2)与高次(n^s)不定方程求解,勒让德符号(a/p_i ),雅可比符号(n/m)对方程可解判别,以及欧拉函数等一并得到简化或省略。族筛法(⇒)是以素因子的序从小到大进行的,任何与小于当前素因子有重叠关系的合数都被自然过滤,使得素因子与合数重塑为简单明确的从属关系,极大简化了合数集的求解。
0/5000
源语言: -
目标语言: -
结果 (英语) 1: [复制]
复制成功!
Because the prime factor set (N∋P_α={p_α∈P_α:2〖≤∀p〗_α, √n→∞}) is a known set, all composite numbers belong to only one of its minimum prime factor family sets (N ∋d_(σ≤α)⊂d_α). Make prime factorization of integers with residual division, solve (n^2) and high-order (n^s) indefinite equations, Legendre symbol (a/p_i ), Jacobian symbol (n/m) can be used to distinguish the equation , and the Euler function etc. <br>are simplified or omitted together. The family sieve method (⇒) is carried out from small to large in the order of prime factors. Any composite number that has an overlapping relationship with the prime factor smaller than the current one is naturally filtered, so that the prime factor and composite number are reshaped into a simple and clear subordination relationship. It greatly simplifies the solution of composite number sets.
正在翻译中..
结果 (英语) 2:[复制]
复制成功!
Because the prime factor set (N ∋ P_ α= {p_ α∈ P_ α: 2〖≤∀p〗_ α,√ N →∞} is a known set, and all composite numbers belong only to one of its minimum prime factor family sets (N ∋ d_( σ≤α)⊂ d_ α)。 Prime factorization of integers with remainder division, solution of (n ^ 2) and higher order (n ^ s) indefinite equations, Legendre symbol symbol (a/p_i), Jacobi symbol (n/m), and Euler function, etc<br>Simplify or omit both. The family screening method (⇒) is carried out in the order of prime factors from small to large, and any composite number that overlaps with the current prime factor is naturally filtered, reshaping the prime factor and composite number into a simple and clear subordinate relationship, greatly simplifying the solution of the composite number set.
正在翻译中..
结果 (英语) 3:[复制]
复制成功!
Because the prime factor set (NP _ α = {p _ α ∈ p _ α: 2 [≤ p] _ α, √n→∞}) is a known set, all the composite numbers belong to only one of its smallest prime factor family sets (nd _ (σ≤ α) d _ α). Decomposition of prime factors of integers with division, solution of (n 2) and high-order (n s) indefinite equations, determination of solvability of Legendre symbols (a/p_i) and Jacobian symbols (n/m) to equations, and Euler function, etc.<br> Are simplified or omitted together. The family screening method () is carried out in the order of prime factors from small to large, and any composite number that overlaps with the current prime factor is naturally filtered, which reshapes the prime factor and composite number into a simple and clear subordinate relationship, greatly simplifying the solution of composite number set.
正在翻译中..
 
其它语言
本翻译工具支持: 世界语, 丹麦语, 乌克兰语, 乌兹别克语, 乌尔都语, 亚美尼亚语, 伊博语, 俄语, 保加利亚语, 信德语, 修纳语, 僧伽罗语, 克林贡语, 克罗地亚语, 冰岛语, 加利西亚语, 加泰罗尼亚语, 匈牙利语, 南非祖鲁语, 南非科萨语, 卡纳达语, 卢旺达语, 卢森堡语, 印地语, 印尼巽他语, 印尼爪哇语, 印尼语, 古吉拉特语, 吉尔吉斯语, 哈萨克语, 土库曼语, 土耳其语, 塔吉克语, 塞尔维亚语, 塞索托语, 夏威夷语, 奥利亚语, 威尔士语, 孟加拉语, 宿务语, 尼泊尔语, 巴斯克语, 布尔语(南非荷兰语), 希伯来语, 希腊语, 库尔德语, 弗里西语, 德语, 意大利语, 意第绪语, 拉丁语, 拉脱维亚语, 挪威语, 捷克语, 斯洛伐克语, 斯洛文尼亚语, 斯瓦希里语, 旁遮普语, 日语, 普什图语, 格鲁吉亚语, 毛利语, 法语, 波兰语, 波斯尼亚语, 波斯语, 泰卢固语, 泰米尔语, 泰语, 海地克里奥尔语, 爱尔兰语, 爱沙尼亚语, 瑞典语, 白俄罗斯语, 科西嘉语, 立陶宛语, 简体中文, 索马里语, 繁体中文, 约鲁巴语, 维吾尔语, 缅甸语, 罗马尼亚语, 老挝语, 自动识别, 芬兰语, 苏格兰盖尔语, 苗语, 英语, 荷兰语, 菲律宾语, 萨摩亚语, 葡萄牙语, 蒙古语, 西班牙语, 豪萨语, 越南语, 阿塞拜疆语, 阿姆哈拉语, 阿尔巴尼亚语, 阿拉伯语, 鞑靼语, 韩语, 马其顿语, 马尔加什语, 马拉地语, 马拉雅拉姆语, 马来语, 马耳他语, 高棉语, 齐切瓦语, 等语言的翻译.

Copyright ©2024 I Love Translation. All reserved.

E-mail: