Search Results for ""
31 - 40 of 729 for modular sieve methodSearch Results
View search results from all Wolfram sites (18456 matches)In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...
An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...
A compact set W_infty with area mu(W_infty)=8/9(24)/(25)(48)/(49)...=pi/4 created by punching a square hole of length 1/3 in the center of a square. In each of the eight ...
A method for constructing magic squares of odd order, also called the Siamese method.
The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...
The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...
The Sierpiński sieve is a fractal described by Sierpiński in 1915 and appearing in Italian art from the 13th century (Wolfram 2002, p. 43). It is also called the Sierpiński ...
The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...
The method for solving the Goursat problem and Cauchy problem for linear hyperbolic partial differential equations using a Riemann function.
A root-finding algorithm which assumes a function to be approximately linear in the region of interest. Each improvement is taken as the point where the approximating line ...
...