Search Results for ""
1781 - 1790 of 8520 for 1Search Results
A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...
A monotonic matrix of order n is an n×n matrix in which every element is either 0 or contains a number from the set {1,...,n} subject to the conditions 1. The filled-in ...
A square-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...
A polygonal number of the form N_n=n(7n-5)/2, also called an enneagonal number. The first few are 1, 9, 24, 46, 75, 111, 154, 204, ... (OEIS A001106). The generating function ...
The orthographic projection is a projection from infinity that preserves neither area nor angle. It is given by x = cosphisin(lambda-lambda_0) (1) y = ...
A simple unlabeled graph on n vertices is called pancyclic if it contains cycles of all lengths, 3, 4, ..., n. Since a pancyclic graph must contain a cycle of length n, ...
The metabigyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating two of the pentagonal cupolas of a small rhombicosidodecahedron located in the ...
A number which is simultaneously a pentagonal number P_n and a square number S_m. Such numbers exist when 1/2n(3n-1)=m^2. (1) Completing the square gives ...
A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...
A number n is said to be refactorable, sometimes also called a tau number (Kennedy and Cooper 1990), if it is divisible by the number of its divisors sigma_0(n), where ...
...
View search results from all Wolfram sites (501144 matches)

