Search Results for ""
1001 - 1010 of 2910 for Integer complexitySearch Results
A number which is simultaneously octagonal and pentagonal. Let O_n denote the nth octagonal number and P_m the mth pentagonal number, then a number which is both octagonal ...
A number which is simultaneously octagonal and square. Let O_n denote the nth octagonal number and S_m the mth square number, then a number which is both octagonal and square ...
A number which is simultaneously octagonal and triangular. Let O_n denote the nth octagonal number and T_m the mth triangular number, then a number which is both octagonal ...
Apply the 196-algorithm, which consists of taking any positive integer of two digits or more, reversing the digits, and adding to the original number. Now sum the two and ...
A Pisot number is a positive algebraic integer greater than 1 all of whose conjugate elements have absolute value less than 1. A real quadratic algebraic integer greater than ...
Let n be a positive integer and r(n) the number of (not necessarily distinct) prime factors of n (with r(1)=0). Let O(m) be the number of positive integers <=m with an odd ...
The highest order power in a univariate polynomial is known as its order (or, more properly, its polynomial degree). For example, the polynomial ...
A Poulet number is a Fermat pseudoprime to base 2, denoted psp(2), i.e., a composite number n such that 2^(n-1)=1 (mod n). The first few Poulet numbers are 341, 561, 645, ...
Define a power difference prime as a number of the form n^n-(n-1)^(n-1) that is prime. The first few power difference primes then have n=2, 3, 4, 7, 11, 17, 106, 120, 1907, ...
An integer N which is a product of distinct primes and which satisfies 1/N+sum_(p|N)1/p=1 (Butske et al. 1999). The first few are 2, 6, 42, 1806, 47058, ... (OEIS A054377). ...
...
View search results from all Wolfram sites (340627 matches)

