[英]Is there a function through which when a and b multiplies the resultant x is same,and x is given by the user
For example all combinations when multiplied together results in x=20.例如,当所有组合相乘时,x=20。 In first sequence, A = 2, B = 10.
在第一个序列中,A = 2,B = 10。
2 x 10 = 20
5 x 4 = 20 etc
The sequences are required must be present in the list.需要的序列必须存在于列表中。
This is a general problem of number theory and there are several algorithms of varying complexity which can be used to perform an “integer factorisation”.这是数论的一个普遍问题,有几种复杂度不同的算法可用于执行“整数分解”。 The fastest would be the general number field sieve .
最快的是通用数域筛。 There are several good examples for quadratic sieves that you can compare as well (eg SIMPQS ).
您也可以比较几个很好的二次筛示例(例如SIMPQS )。 If you aren't considering using it in a productive manner I recommend to look into Dixon's factorization method , since it's a bit more comprehensible.
如果您不考虑以有效的方式使用它,我建议您研究Dixon 的分解方法,因为它更易于理解。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.