TOPICS
Search

Search Results for ""


1251 - 1260 of 2910 for Integer complexitySearch Results
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 ...
A function f is topologically transitive if, given any two intervals U and V, there is some positive integer k such that f^k(U) intersection V!=emptyset. Vaguely, this means ...
A totative is a positive integer less than or equal to a number n which is also relatively prime to n, where 1 is counted as being relatively prime to all numbers. The number ...
The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...
Values of the trigonometric functions can be expressed exactly for integer multiples of pi/20. For cosx, cos(pi/(20)) = 1/4sqrt(8+2sqrt(10+2sqrt(5))) (1) cos((3pi)/(20)) = ...
To truncate a real number is to discard its noninteger part. Truncation of a (positive) number x therefore corresponds to taking the floor function |_x_|. Truncation also ...
The polyhedron compound of the truncated dodecahedron and its dual, the triakis icosahedron. The compound can be constructed from a truncated dodecahedron of unit edge length ...
The function defined by U(n)=(n!)^(n!). The values for n=0, 1, ..., are 1, 1, 4, 46656, 1333735776850284124449081472843776, ... (OEIS A046882).
The function defined by U(p)=(p#)^(p#), where p is a prime number and p# is a primorial. The values for p=2, 3, ..., are 4, 46656, ...
Let p be an irregular prime, and let P=rp+1 be a prime with P<p^2-p. Also let t be an integer such that t^3≢1 (mod P). For an irregular pair (p,2k), form the product ...
1 ... 123|124|125|126|127|128|129 ... 291 Previous Next

...