Location:
Search - fermat
Search list
Description: 实现素性检测。但不能实现太大的数，只能在小数范围内，而又不能完全确定就是素数，只能粗略估计。-achieve Primality Testing. But too few achieve, only in a minority within, and is not fully ascertained is the prime, only a rough estimate.
Platform: |
Size: 789 |
Author: YY |
Hits:
Description:
2007年robecode大赛亚军代码1!
Platform: |
Size: 12861 |
Author: 李飞 |
Hits:
Description: 实现素性检测。但不能实现太大的数，只能在小数范围内，而又不能完全确定就是素数，只能粗略估计。-achieve Primality Testing. But too few achieve, only in a minority within, and is not fully ascertained is the prime, only a rough estimate.
Platform: |
Size: 1024 |
Author: YY |
Hits:
Description: 线性代数的发展（Linear Algebra）是代数学的一个分支，它以研究向量空间与线性映射为对象；由于费马和笛卡儿的工作，线性代数基本上出现于十七世纪。直到十八世纪末，线性代数的领域还只限于平面与空间。-The development of linear algebra (Linear Algebra) is a branch of algebra, it is to study the vector space with the linear mapping for object as a result of Fermat and Descartes
Platform: |
Size: 501760 |
Author: 杨明 |
Hits:
Description:
2007年robecode大赛亚军代码1!-2007 runner-up code robecode Contest 1!
Platform: |
Size: 12288 |
Author: 李飞 |
Hits:
Description: VC++6.0实现快速、方便的费尔玛因子分解-Fermat of factor decomposition
Platform: |
Size: 3590144 |
Author: lianlp |
Hits:
Description: 原理类似伪费马小定理。
截尾减。
模拟人工判定
-Fermat' s principle of similar small theorem false. Censored minus. Analog manual to determine
Platform: |
Size: 7168 |
Author: blacksapper |
Hits:
Description: Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be because of the difficulty to prove that any given arbitrary number is prime. This is call the primality test. Most of the test for primality are probalistic rather than deterministic,because probalistic test are much more quicker than the deterministic ones. When testing the primality of a given number,one of the theorem that is very largely used is Fermat s little theorem: if "p" is a prime number that is not a factor of a given integer "a",then pow(a, p - 1) = 1 (mod p) or pow(a, p - 1) p = 1 One of the main application of prime numbers nowadays is chryptography,the RSA algorithm for encrypting and decrypting messages is based on prime numbers.- Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be because of the difficulty to prove that any given arbitrary number is prime. This is call the primality test. Most of the test for primality are probalistic rather than deterministic,because probalistic test are much more quicker than the deterministic ones. When testing the primality of a given number,one of the theorem that is very largely used is Fermat s little theorem: if "p" is a prime number that is not a factor of a given integer "a",then pow(a, p- 1) = 1 (mod p) or pow(a, p- 1) p = 1 One of the main application of prime numbers nowadays is chryptography,the RSA algorithm for encrypting and decrypting messages is based on prime numbers.
Platform: |
Size: 11264 |
Author: kbing |
Hits:
Description: 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
Platform: |
Size: 1024 |
Author: li shu |
Hits:
Description: 基于Fermat数变换的大数相乘运算的Verilog实现，可应用于RSA加法芯片中。-Fermat number transform based on multiplying large numbers operations Verilog implementation, can be applied to RSA chip.
Platform: |
Size: 38912 |
Author: 张勇奇 |
Hits:
Description: 《什么是数学》既是为初学者也是为专家，既是为学生也是为教师，既是为哲学家也是为工程师而写的。它是一本世界著名的数学科普读物。书中搜集了许多经典的数学珍品，给出了数学世界的一组有趣的、深入浅出的图画，对整个数学领域中的基本概念与方法，做了精深而生动的阐述。
I·斯图尔特增写了新的一章，以新的观点阐述了数学的最新进展，叙述了四色定理和费马大定理的证明等。这些问题是在柯朗与罗宾写书的年代尚未解决，但现在已被解决了的。-
"What is Mathematics," is not only for beginners but also for experts, not only for students but also for teachers, both as a philosopher, but also for engineers, and written. It is a world-renowned popular science books in mathematics. The book has collected a number of classic mathematical treasures, gives the mathematical world, a group of interesting and easily comprehensible picture of the whole mathematics of the basic concepts and methods, has done a deep and vivid exposition.
I · Stewart by writing a new chapter with a new point of view expounded the latest developments in mathematics, describes the four-color theorem and the proof of Fermat s last theorem and so on. These issues are at the Courant and Robin the age of writing a book yet to be resolved, but has now been settled.
Platform: |
Size: 17385472 |
Author: jnwang |
Hits:
Description: 概率论始于17世纪法国伟大的法国时2
数学家布莱斯帕斯卡和Pierre费尔马，相当于超过两个问题
从比赛的机会。如Pascal和费马问题的解决继续
作为惠更斯影响，伯努利这种早期的研究人员，以及在建立德穆瓦夫尔
一个概率的数学理论。今天，概率论是一个沿用已久的
数学分支，发现在每一个领域应用学术
活动从音乐到物理，从日常的经验，天气预测
预计新的医疗治疗的风险。-Probability theory began in the 17th century when the two great French French
Mathematician Blaise Pascal and Pierre Fermat, the equivalent of more than two issues
From the matches. Such as Pascal and Fermat to resolve the problem continues
Impact as Huygens, Bernoulli these early researchers, as well as in the establishment of Demoivre
A mathematical theory of probability. Today, probability theory is a well-established
Branch of mathematics, found application in every area of academic
Activities from music to physics, from daily experience, weather forecast
Estimated the risk of new medical treatment.
Platform: |
Size: 2935808 |
Author: wangxiaojuan |
Hits:
Description: calculate fermat and shank s algorithms
Platform: |
Size: 1024 |
Author: ilayengl |
Hits:
Description: 采用费马定理生成大素数的C语言源代码，开发工具为Visual 2008-Fermat' s Theorem by generating large prime numbers C language source code
Platform: |
Size: 3026944 |
Author: 张蕾 |
Hits:
Description: poj2420AC代码，采用变步长法求解多边形的费马点-The code for poj2420,which can be used to find the fermat point of a polygon by way of changing step.
Platform: |
Size: 1024 |
Author: 陈陶 |
Hits:
Description: Pollard p-1算法实现
Pollard 方法由Pollard于1974年提出，其基本想法是这样的：设素数，由Fermat小定理，又有，因此就可能是的一个非平凡因子。当然，问题在于我们并不知道是多少。一个合理的假设是的因子都很小，比如说，所有素因子都包含在因子基中，我们来尝试着找到一个能够“覆盖”，即是说，从而，因此我们可以转而求来获得所要的非平凡因子。例如设素因子上限为，便可以简单的取或是最小公倍数.-Pollard p-1 algorithm
Platform: |
Size: 6144 |
Author: 张蒴 |
Hits:
Description: 很好玩的数学知识，费马大定理，以简单幽默历史的方法向你展示数学的魅力-Fermat s theorem
Platform: |
Size: 10443776 |
Author: kaesar |
Hits:
Description: which is uniformly distributed among 0 to 2^32-1 for each */
/* call. sgenrand(seed) set initial values to the working area */
/* of 624 words. Before genrand(), sgenrand(seed) must be */
/* called once. (seed is any 32-bit integer except for 0). */
/* Coded by Takuji Nishimura, considering the suggestions by */
/* Topher Cooper and Marc Rieffel in July-Aug. 1997. -which is uniformly distributed among 0 to 2^32-1 for each */
/* call. sgenrand(seed) set initial values to the working area */
/* of 624 words. Before genrand(), sgenrand(seed) must be */
/* called once. (seed is any 32-bit integer except for 0). */
/* Coded by Takuji Nishimura, considering the suggestions by */
/* Topher Cooper and Marc Rieffel in July-Aug. 1997.
Platform: |
Size: 6144 |
Author: kdcroger |
Hits:
Description: calcola enigma di fermat
Platform: |
Size: 1024 |
Author: marcoo |
Hits:
Description: algorithm of fermat crypto
Platform: |
Size: 11264 |
Author: Abdellatif |
Hits: