The application of the Euclidean division theorem for the positive integers allowed us to establish a set which contains all the prime numbers and this set we called it set of supposedly prime numbers and we noted it ...The application of the Euclidean division theorem for the positive integers allowed us to establish a set which contains all the prime numbers and this set we called it set of supposedly prime numbers and we noted it E<sub>sp</sub>. We subsequently established from the previous set the set of non-prime numbers (the set of numbers belonging to this set and which are not prime) denoted E<sub>np</sub>. We then extracted from the set of supposedly prime numbers the numbers which are not prime and the set of remaining number constitutes the set of prime numbers denoted E<sub>p</sub>. We have deduced from the previous set, the set of prime numbers between two natural numbers. We have explained during our demonstrations the origin of the twin prime numbers and the structure of the chain of prime numbers.展开更多
Is the Christian doctrine espoused by contemporary Christians really the true meaning of Christ?What is the basic doctrine of Christ?How should believers believe in and practice Christian doctrine?This article analyze...Is the Christian doctrine espoused by contemporary Christians really the true meaning of Christ?What is the basic doctrine of Christ?How should believers believe in and practice Christian doctrine?This article analyzes this and distinguishes between the faithful of Christ and that of the church,two types of believers who are similar in form but not identical in nature.展开更多
为了解决复数域下基于QR分解的LLL(A.K.Lenstra,H.W.Lenstra and L.Lovász)算法中复Givens旋转矩形式不统一的问题,文章从复数域下原始LLL算法中Gram-Schmidt系数与QR分解的上三角矩阵R中元素之间的关系出发,证明了上三角矩阵R的...为了解决复数域下基于QR分解的LLL(A.K.Lenstra,H.W.Lenstra and L.Lovász)算法中复Givens旋转矩形式不统一的问题,文章从复数域下原始LLL算法中Gram-Schmidt系数与QR分解的上三角矩阵R中元素之间的关系出发,证明了上三角矩阵R的元素与Gram-Schmidt系数以及Lovász条件之间的等价的关系;从复数的指数形式出发,推导出2种适合LLL算法的复Givens旋转矩阵形式,并证明只有其中一种符合Lovász条件下复Givens旋转矩阵形式。仿真结果表明,采用基于QR分解的复数域LLL算法的MIMO系统相比采用基于Gram-Schmidt正交化LLL算法的MIMO系统具有更好的误比特率性能。展开更多
文摘The application of the Euclidean division theorem for the positive integers allowed us to establish a set which contains all the prime numbers and this set we called it set of supposedly prime numbers and we noted it E<sub>sp</sub>. We subsequently established from the previous set the set of non-prime numbers (the set of numbers belonging to this set and which are not prime) denoted E<sub>np</sub>. We then extracted from the set of supposedly prime numbers the numbers which are not prime and the set of remaining number constitutes the set of prime numbers denoted E<sub>p</sub>. We have deduced from the previous set, the set of prime numbers between two natural numbers. We have explained during our demonstrations the origin of the twin prime numbers and the structure of the chain of prime numbers.
文摘Is the Christian doctrine espoused by contemporary Christians really the true meaning of Christ?What is the basic doctrine of Christ?How should believers believe in and practice Christian doctrine?This article analyzes this and distinguishes between the faithful of Christ and that of the church,two types of believers who are similar in form but not identical in nature.
文摘为了解决复数域下基于QR分解的LLL(A.K.Lenstra,H.W.Lenstra and L.Lovász)算法中复Givens旋转矩形式不统一的问题,文章从复数域下原始LLL算法中Gram-Schmidt系数与QR分解的上三角矩阵R中元素之间的关系出发,证明了上三角矩阵R的元素与Gram-Schmidt系数以及Lovász条件之间的等价的关系;从复数的指数形式出发,推导出2种适合LLL算法的复Givens旋转矩阵形式,并证明只有其中一种符合Lovász条件下复Givens旋转矩阵形式。仿真结果表明,采用基于QR分解的复数域LLL算法的MIMO系统相比采用基于Gram-Schmidt正交化LLL算法的MIMO系统具有更好的误比特率性能。
