Search Results for ""
521 - 530 of 2617 for Prime Generating PolynomialSearch Results
The set of nilpotent elements in a commutative ring is an ideal, and it is called the nilradical. Another equivalent description is that it is the intersection of the prime ...
Any system of phi(n) integers, where phi(n) is the totient function, representing all the residue classes relatively prime to n is called a reduced residue system (Nagell ...
If n>1, (a,n)=1 (i.e., a and n are relatively prime), and m is the least integer >sqrt(n), then there exist an x and y such that ay=+/-x (mod n) where 0<x<m and 0<y<m (Nagell ...
Diagonalize a form over the rationals to diag[p^a·A,p^b·B,...], where all the entries are integers and A, B, ... are relatively prime to p. Then the p-signature of the form ...
The smallest number of times u(K) a knot K must be passed through itself to untie it. Lower bounds can be computed using relatively straightforward techniques, but it is in ...
A recursive primality certificate for a prime p. The certificate consists of a list of 1. A point on an elliptic curve C y^2=x^3+g_2x+g_3 (mod p) for some numbers g_2 and ...
If n>1 and n|1^(n-1)+2^(n-1)+...+(n-1)^(n-1)+1, is n necessarily a prime? In other words, defining s_n=sum_(k=1)^(n-1)k^(n-1), does there exist a composite n such that s_n=-1 ...
A modification of Legendre's formula for the prime counting function pi(x). It starts with |_x_| = (1) where |_x_| is the floor function, P_2(x,a) is the number of integers ...
Conway's knot is the prime knot on 11 crossings with braid word sigma_2^3sigma_1sigma_3^(-1)sigma_2^(-2)sigma_1sigma_2^(-1)sigma_1sigma_3^(-1). The Jones polynomial of ...
Hadamard matrices H_n can be constructed using finite field GF(p^m) when p=4l-1 and m is odd. Pick a representation r relatively prime to p. Then by coloring white ...
...
View search results from all Wolfram sites (24574 matches)

