搜索资源列表
2262
- 北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers.
Runge-Kutta_fortain
- 1、用欧拉法、四阶龙格库塔法进行插值计算，求解微分方程。（压缩包内的两个小程序） 2、面向微分方程的仿真程序包。（压缩包内的大程序，ALL OF THE PROGRAM.for） 大程序中又增加了变长的龙格库塔运算方法。-1, using Euler, fourth-order Runge-Kutta method for interpolation, solving differential equations. (Compressed within the two small pro
imageprocess2
- 对矩阵进行四叉树分解，将图像分为文字和非文字的两个类别，形态学梯度检测二值图像的边缘，形态学实例——从PCB图像中删除所有电流线（仅保留芯片对象），计算图像中的欧拉数 -Of the matrix quadtree decomposition, the image is divided into text and non-text of two categories, the morphological gradient detection of the edge binary image,
5
- P0502：计算图像中的欧拉数 P0407：将图像分为文字和非文字的两个类别 P0408：形态学梯度检测二值图像的边缘 P0409：形态学实例——从PCB图像中删除所有电流线，仅保留芯片对象 -P0502: Euler calculated the number of images in the P0407: the text and the image is divided into two categories of non-text P0408: dete
euler
- 关于中国邮递员问题的代码，很不错哦，希望对大家有用-A good code, and hope for all of us
FEMc
- C++编写的有限元计算程序。 版权所有： Comments/Questions can be directed to: Charbel Farhat : charbel@alexandra.colorado.edu Michel Lesoinne: michel@vette.colorado.edu Kendall Pierson : piersonk@vette.colorado.edu -----------------------------------------
all_prmRoot
- 通过欧拉函数和判断两个数是否互素的函数来求出一个数的所有原根。-By Euler' s function and determine whether the two numbers to find the prime function of a number of all primitive roots.
Euler
- 欧拉法阶线性方程组，解决现有的所有方程的线性揭发能够给实现输入输出同步发生十分有用-Euler method linear equations to solve all existing equations discovered able to achieve simultaneous occurrence of very useful input and output
hw4yg
- 利用Euler定理求一个数的所有原根，包含求φ(m).-Euler Theorem by seeking a number of all primitive roots, including the demand φ (m).
Euler-Engineering
- Euler工程，找最长的数列！ 定义一个正整数数列，其迭代公式为： n = n/2 (当n为偶数) n = 3n+1 (当n为奇数) 比如从n=13开始，计算这个数列得： 13 ->40->20->10->5->16->8->4->1 这个数列一共有10项。 要求在小于1百万的所有起始数中，哪个数能产生最长的数列。 -Euler project, find the longest series! Define a p
Archimedes
- 數學大師歐勒(Euler) 找到一個計算圓周率的無窮乘積 : pi/2 = 3/2 * 5/6 * 7/6 * 11/10 * 13/14 * 17/18 * 19/18 * 23/22 * … 有趣的是, 這公式裡, 所有分子都是大於 2的質數, 分母則是不能被 4整除, 且最接近分子的偶數. -Math Masters Euler (Euler) a calculation of pi to find the infinite product: pi/2 = 3/
euler
- provides path of all existing euler paths in a given non directional graph
a
- 在数论，对正整数n，欧拉函数是少于或等于n的数中与n互质的数的数目。 φ函数的值 通式：φ(x)=x(1-1/p1)(1-1/p2)(1-1/p3)(1-1/p4)…..(1-1/pn) 其中p1, p2……pn为x的所有质因数，x是不为0的整数。φ(1)=1（唯一和1互质的数就是1本身）。 (注意：每种质因数只一个。比如12=2*2*3 那么φ（12）=12*（1-1/2）*(1-1/3)=4) 若n是质数p的k次幂，φ(n)=p^k-p^(k-1)=(p-1)p^(k-1)，因为除了
101---Domino
- SGU 101 Domino 题解 能否找一条欧拉路将所有边走一遍，输出路径-SGU 101 Domino problem solution will be able to find an Euler path all the edges go again, the output path
hanshufangcheng
- 都是matlab中经典的函数与方程代码，如埃特金插值，复合求积公式，用欧拉法求一阶常微分方程的数值解，龙格库塔法等-All matlab functions and equations of classical code, such as Aitken interpolation, composite quadrature formula, the first-order Euler method for the numerical solution of ordinary differenti
imageprocess2
- 对矩阵进行四叉树分解，将图像分为文字和非文字的两个类别，形态学梯度检测二值图像的边缘，形态学实例——从PCB图像中删除所有电流线（仅保留芯片对象），计算图像中的欧拉数-Of the matrix quadtree decomposition, the image is divided into text and non-text of two categories, the morphological gradient detection of the edge binary image, mo
Euler-Algorithm-program-CPP
- 详细说明：基因组组装算法 欧拉算法C++源程序：很好的实现基因组组装和拼接的功能，包含实现该功能的所有程序。-Genome assembly algorithms calculate Euler C++ source: well implemented genome assembly and stitching functions, including all procedures to achieve this functionality.
aiux
- 众所周知,欧拉角和四元数是存在对应关系的,后者用于导航等时不存在死区现象-As is known to all, euler angles and quaternions is corresponding relationship exists, the latter is used for navigation, etc. There is no dead zone phenomenon
integyr
- As is known to all, euler angles and quaternions is corresponding relationship exists, the latter is used for navigation, etc. There is no dead zone phenomenon
TVD
- TVD格式的euler方程。各种限制器都有！(Euler equation of TVD scheme. There are all kinds of limiters!)