Search Results for ""
341 - 350 of 2142 for Trigonometry Angles Pi 17Search Results
A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...
The regular nonagon is the regular polygon with nine sides and Schläfli symbol {9}. The regular nonagon cannot be constructed using the classical Greek rules of geometric ...
J. Tupper concocted the amazing formula 1/2<|_mod(|_y/(17)_|2^(-17|_x_|-mod(|_y_|,17)),2)_|, where |_x_| is the floor function and mod(b,m) is the mod function, which, when ...
A number n is called amenable if it can be built up from integers a_1, a_2, ..., a_k by either addition or multiplication such that sum_(i=1)^na_i=product_(i=1)^na_i=n (1) ...
A nialpdrome is a number whose hexadecimal digits are in nonincreasing order. The first few are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 32, 33, 34, 48, 49, ...
A positive integer n>1 is quiteprime iff all primes p<=sqrt(n) satisfy |2[n (mod p)]-p|<=p+1-sqrt(p). Also define 2 and 3 to be quiteprimes. Then the first few quiteprimes ...
Given the sum-of-factorials function Sigma(n)=sum_(k=1)^nk!, SW(p) is the smallest integer for p prime such that Sigma[SW(p)] is divisible by p. If pSigma(n) for all n<p, ...
The sequence produced by sorting the digits of a number and adding them to the previous number. The values starting with n=1, 2, ... are 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...
Lehmer's formula is a formula for the prime counting function, pi(x) = (1) where |_x_| is the floor function, a = pi(x^(1/4)) (2) b = pi(x^(1/2)) (3) b_i = pi(sqrt(x/p_i)) ...
If pi on V and pi^' on V^' are irreducible representations and E:V|->V^' is a linear map such that pi^'(g)E=Epi(g) for all g in and group G, then E=0 or E is invertible. ...
...