TOPICS
Search

Search Results for ""


1121 - 1130 of 1570 for Napoleon ProblemSearch Results
The contact triangle of a triangle DeltaABC, also called the intouch triangle, is the triangle DeltaC_AC_BC_C formed by the points of tangency of the incircle of DeltaABC ...
A closed box composed of three pairs of rectangular faces placed opposite each other and joined at right angles to each other, also known as a rectangular parallelepiped. The ...
Form a sequence from an alphabet of letters [1,n] such that there are no consecutive letters and no alternating subsequences of length greater than d. Then the sequence is a ...
A definite integral is an integral int_a^bf(x)dx (1) with upper and lower limits. If x is restricted to lie on the real line, the definite integral is known as a Riemann ...
The Diffie-Hellman protocol is a method for two computer users to generate a shared private key with which they can then exchange information across an insecure channel. Let ...
A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...
Given an arithmetic progression of terms an+b, for n=1, 2, ..., the series contains an infinite number of primes if a and b are relatively prime, i.e., (a,b)=1. This result ...
Using disk point picking, x = sqrt(r)costheta (1) y = sqrt(r)sintheta (2) for r in [0,1], theta in [0,2pi), choose two points at random in a unit disk and find the ...
The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k. (1) It is ...
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 ...
1 ... 110|111|112|113|114|115|116 ... 157 Previous Next

...