Search Results for ""
1901 - 1910 of 13135 for Number PatternsSearch Results
A set A in a first-countable space is dense in B if B=A union L, where L is the set of limit points of A. For example, the rational numbers are dense in the reals. In ...
A Lucas chain for an integer n>=1 is an increasing sequence 1=a_0<a_1<a_2<...<a_r=n of integers such that every a_k, k>=1, can be written as a sum a_k=a_i+a_j of smaller ...
In French and German usage, one milliard equals 10^9=1000000000. American usage does not have a number called the milliard, instead using the term billion to denote 10^9. ...
A real quantity having a value less than zero (<0) is said to be negative. Negative numbers are denoted with a minus sign preceding the corresponding positive number, i.e., ...
Given an integer sequence {a_n}_(n=1)^infty, a prime number p is said to be a primitive prime factor of the term a_n if p divides a_n but does not divide any a_m for m<n. It ...
The multiplicative suborder of a number a (mod n) is the least exponent e>0 such that a^e=+/-1 (mod n), or zero if no such e exists. An e always exists if GCD(a,n)=1 and n>1. ...
The nth Suzanne set S_n is defined as the set of composite numbers x for which n|S(x) and n|S_p(x), where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...
If 1<=b<a and (a,b)=1 (i.e., a and b are relatively prime), then a^n-b^n has at least one primitive prime factor with the following two possible exceptions: 1. 2^6-1^6. 2. ...
Expanded notation is the term given in elementary mathematics education for the expansion of a positive integer in the form sum_(k)b_k10^k, i.e., as a sum of appropriate ...
A prime p is said to be a Sophie Germain prime if both p and 2p+1 are prime. The first few Sophie Germain primes are 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, ... (OEIS ...
...
View search results from all Wolfram sites (53132 matches)

