Search Results for ""
1971 - 1980 of 13135 for Multiplicative Number TheorySearch Results
Some interesting properties (as well as a few arcane ones not reiterated here) of the number 239 are discussed in Schroeppel (1972). 239 appears in Machin's formula ...
According to the novel The Hitchhiker's Guide to the Galaxy (Adams 1997), 42 is the ultimate answer to life, the universe, and everything. Unfortunately, it is left as an ...
The nth central fibonomial coefficient is defined as [2n; n]_F = product_(k=1)^(n)(F_(n+k))/(F_k) (1) = ...
A sequence of numbers V={nu_n} is complete if every positive integer n is the sum of some subsequence of V, i.e., there exist a_i=0 or 1 such that n=sum_(i=1)^inftya_inu_i ...
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 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) = ...
...
View search results from all Wolfram sites (56265 matches)

