TOPICS
Search

Search Results for ""


561 - 570 of 4349 for prime numbersSearch Results
Trigonometric functions of pi/p for p prime have an especially complicated Galois-minimal representation. In particular, the case cos(pi/23) requires approximately 500 MB of ...
The Euler numbers, also called the secant numbers or zig numbers, are defined for |x|<pi/2 by sechx-1=-(E_1^*x^2)/(2!)+(E_2^*x^4)/(4!)-(E_3^*x^6)/(6!)+... (1) ...
In Note M, Burnside (1955) states, "The contrast that these results shew between groups of odd and of even order suggests inevitably that simple groups of odd order do not ...
Carmichael's conjecture asserts that there are an infinite number of Carmichael numbers. This was proven by Alford et al. (1994).
A wide variety of large numbers crop up in mathematics. Some are contrived, but some actually arise in proofs. Often, it is possible to prove existence theorems by deriving ...
Trigonometric functions of npi/7 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 7 is not a ...
A number is said to be simply normal to base b if its base-b expansion has each digit appearing with average frequency tending to b^(-1). A normal number is an irrational ...
Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...
The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...
A number k such that nk^2 has its last digit(s) equal to k is called n-automorphic. For example, 1·5__^2=25__ (Wells 1986, pp. 58-59) and 1·6__^2=36__ (Wells 1986, p. 68), so ...
1 ... 54|55|56|57|58|59|60 ... 435 Previous Next

...