Welcome![Sign In][Sign Up]
Location:
Search - prime number computational

Search list

[Documentsmathformulae

Description: 第一章 有关数论的算法 1.1最大公约数与最小公倍数 1.2有关素数的算法 1.3方程ax+by=c的整数解及应用 1.4 求a^b mod n 第二章 高精度计算 2.1高精度加法 2.2高精度减法 2.3高精度乘法 2.4 高精度除法 练习 第三章 排列与组合 3.1加法原理与乘法原理 练习 3. 2 排列与组合的概念与计算公式 练习 3.3排列与组合的产生算法 练习 第四章 计算几何 4.1 基础知识 4.2 线段的相交判断 4.3寻找凸包算法 练习 第五章 其它数学知识及算法 5.1 鸽巢原理 5.2 容斥原理及应用 5.3 常见递推关系及应用-The first chapter on number theory and the algorithm 1.1 common denominator least common multiple of 1.2 on the prime number algorithm 1.3 equation ax+ By = c of the integer solution and application of 1.4 for a ^ b mod n chapter 2.1 high-precision calculation of high-precision adder 2.2 Accuracy of high-precision subtraction 2.3 Multiplication 2.4 Practice Chapter III of high-precision division and combination with adder 3.1 Principle and Practice Multiplication Principle 3.2 and the combination with the concept and formula for calculating practice with the combination of 3.3 with the selection of algorithms to practice in chapter IV 4.1 based on computational geometry 4.2 knowledge of the intersection of line segments to determine the convex hull algorithm to find 4.3 Exercises Chapter V other mathematical knowledge and algorithms 5.1 pigeonhole principle 5.2 Exclusion Principle and Application of 5.3 Recursion relations and the application of common
Platform: | Size: 38912 | Author: endure | Hits:

[JSPJava_Number_Cruncher

Description: 本书深入讲解了有关Java的数值计算,并介绍了常见的Java数值方法及计算特性。全书分为4个部分,共16章,首先对Java的数据表示、数据类型及相关标准进行了详细的介绍。然后,作者分析了数值求根、数值求和、插值、估计、数值积分、求解微分方程等常见的数值计算;讨论了矩阵运算软件包,并讲解了各种矩阵运算的方法。最后,本书给出了一些有趣的数学计算实例。全书内容新颖,举例丰富,而且应用了大量生动的交互式图形程序。 本书适合于有兴趣学习Java数值方法的程序设计者,同时对于从事数值计算及相关工作的人员也具有很好的参考价值。-In Java Number Cruncher, author Ronald Mak explains how to spot-and how to avoid-the subtle programming miscues that can cause vexing calculation errors in your applications. An authority on mapping pure math to computer math, he explains how to use the often-overlooked computational features of Java, and does so in a clear, non-theoretical style. Without getting lost in mathematical detail, you ll learn practical numerical algorithms for safely summing numbers, finding roots of equations, interpolation and approximation, numerical integration, solving differential equations, matrix operations, and solving sets of simultaneous equations. You ll also enjoy intriguing topics such as searching for patterns in prime numbers, generating random numbers, computing thousands of digits of pi, and creating intricately beautiful fractal images.
Platform: | Size: 2884608 | Author: FalconIA | Hits:

[MPIasil_egemen_findPrimesParallel.c

Description: MPI Efficient Finding Prime
Platform: | Size: 2048 | Author: mehmet hakki | Hits:

[CA authjj

Description: CORNACCHIA Algorithm * * GOAL: given d and p prime, find (x,y) such that x^2 + y^2 = d * p * * in this implementation, d = 1. This code does not accept d <> 1 !!! * see "A Course in Computational Algebraic Number Theory" by Henri Cohen * coded by malik@hammoutene.com, 2004,the 5th of August you must install GMP
Platform: | Size: 2048 | Author: silkan | Hits:

[Othergailvsuanfa&jiaofushi

Description: 计算理论导引第二版中的交错式(交错式图灵机)、概率算法(BPP类、素数性)内容概述(An overview of interleaved (interleaved Turing machines) and probabilistic algorithms (BPP class, prime number) in the second edition of computational theory)
Platform: | Size: 299008 | Author: jinyuliyu | Hits:

CodeBus www.codebus.net