TOPICS
Search

Search Results for ""


1141 - 1150 of 4142 for Multiply whole numbers and integersSearch Results
An unknot which can only be unknotted by first increasing the number of crossings.
The operation of taking an nth root of a number.
B_(p+k)=B_k+B_(k+1) (mod p), when p is prime and B_n is a Bell number.
Connectivity properties obey the following hierarchy: convex => star convex => pathwise-connected => connected.
A power series containing fractional exponents (Davenport et al. 1993, p. 91) and logarithms, where the logarithms may be multiply nested, e.g., lnlnx.
A set S of positive integers is said to be Diophantine iff there exists a polynomial Q with integral coefficients in m>=1 indeterminates such that ...
If, for n and d integers, the ratio n/d is itself an integer, then d is said to divide n. This relationship is written d|n, read "d divides n." In this case, n is also said ...
The Eisenstein units are the Eisenstein integers +/-1, +/-omega, +/-omega^2, where omega = 1/2(-1+isqrt(3)) (1) omega^2 = 1/2(-1-isqrt(3)). (2)
n divides a^n-a for all integers a iff n is squarefree and (p-1)|(n-1) for all prime divisors p of n. Carmichael numbers satisfy this criterion.
A subsequence of {a} is a sequence {b} defined by b_k=a_(n_k), where n_1<n_2<... is an increasing sequence of indices (D'Angelo and West 2000). For example, the prime numbers ...
1 ... 112|113|114|115|116|117|118 ... 415 Previous Next

...