Search Results for ""
371 - 380 of 13135 for Highly Composite NumberSearch Results
A pseudoperfect number for which none of its proper divisors are pseudoperfect (Guy 1994, p. 46). The first few are 6, 20, 28, 88, 104, 272, ... (OEIS A006036). Primitive ...
An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...
A solution zeta_k=e^(2piik/d) to the cyclotomic equation x^d=1. The de Moivre numbers give the coordinates in the complex plane of the polygon vertices of a regular polygon ...
A number theoretic character, also called a Dirichlet character (because Dirichlet first introduced them in his famous proof that every arithmetic progression with relatively ...
A figurate number corresponding to a pentagonal pyramid. The first few are 1, 6, 18, 40, 75, ... (OEIS A002411). The generating function for the pentagonal pyramidal numbers ...
A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...
Let G_1, G_2, ..., G_t be a t-graph edge coloring of the complete graph K_n, where for each i=1, 2, ..., t, G_i is the spanning subgraph of K_n consisting of all graph edges ...
The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...
The complementary Bell numbers, also called the Uppuluri-Carpenter numbers, B^~_n=sum_(k=0)^n(-1)^kS(n,k) (1) where S(n,k) is a Stirling number of the second kind, are ...
A pentagonal square triangular number is a number that is simultaneously a pentagonal number P_l, a square number S_m, and a triangular number T_n. This requires a solution ...
...
View search results from all Wolfram sites (51615 matches)

