对复整数集Z[i]中高斯定理的注记

本文主要是对Z[i]中的高斯定理做了进一步的讨论,给出了满足p=a_1~2+a_2~2中的a_1,a_2的求法,并指出了其中的a_1~2,a_2~2是被p唯一决定的一对数,同时还给出了适合p^2=a^2+b^2中的a,b的求法,其中,p为奇素数,且适合p≡1(mod 4)。

不定方程x^2+y^2+z^2=w^2的正整数解

本文完全解决了不定方程x^2+y^2+z^2=w^2的正整数解这一问题。

早期代数数论的历史发展

目的探讨早期代数数论的产生和发展。方法文献考证与概念分析。围绕高次互反律和费尔马大定理,分析其中关键的唯一因子分解问题。结果数论是由整数论过渡到复整数论,又从复整数论发展为应用广泛的代数数论。结论早期的代数数论是随着复整数、理想数等新的代数工具的引入应运而生的。

Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database

An important and usual sort of search problems is to find all marked states from an unsorted database with a large number of states. Grover＇s original quantum search algorithm is for finding single marked state with uncertainty, and it has been generalized to the case of multiple marked states, as well as been modified to find single marked state with certainty. However, the query complexity for finding all multiple marked states has not been addressed. We use a generalized Long＇s algorithm with high precision to solve such a problem. We calculate the approximate query complexity, which increases with the number of marked states and with the precision that we demand. In the end we introduce an algorithm for the problem on a ＂duality computer＂ and show its advantage over other algorithms.