Search Results for ""

Let alpha be a nonzero rational number alpha=+/-p_1^(alpha_1)p_2^(alpha_2)...p_L^(alpha_L), where p_1, ..., p_L are distinct primes, alpha_l in Z and alpha_l!=0. Then ...

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube I=[0,1)^s, the star discrepancy is defined as D_N^*(P)=sup_(J in Upsilon^*)D(J,P), (1) where the local ...

A tetractys, also called a tetraktys or decad, is an arrangement of 10 points in the form of a triangle with 1 point in the first row, two in the second, three in the third, ...

The base-20 notational system for representing real numbers. The digits used to represent numbers using vigesimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F, ...

Given an expression involving known constants, integration in finite terms, computation of limits, etc., the constant problem is the determination of if the expression is ...

A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...

A Smarandache-like function which is defined where S_k(n) is defined as the smallest integer for which n|S_k(n)^k. The Smarandache S_k(n) function can therefore be obtained ...

The Taniyama-Shimura conjecture, since its proof now sometimes known as the modularity theorem, is very general and important conjecture (and now theorem) connecting topology ...

A zerofree number n is called right truncatable if n and all numbers obtained by successively removing the rightmost digits are prime. There are exactly 83 right truncatable ...

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...