Search Results for ""
811 - 820 of 4181 for Add/subtract whole numbers and integersSearch Results
Let a!=b, A, and B denote positive integers satisfying (a,b)=1 (A,B)=1, (i.e., both pairs are relatively prime), and suppose every prime p=B (mod A) with (p,2ab)=1 is ...
A katadrome is a number whose hexadecimal digits are in strict descending order. The first few are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 32, 33, 48, 49, ... ...
N_phi(m) is the number of integers n for which the totient function phi(n)=m, also called the multiplicity of m (Guy 1994). Erdős (1958) proved that if a multiplicity occurs ...
The Narayana triangle is the number triangle obtained from the Narayana numbers N(n,k), namely 1 ; 1 1 ; 1 3 1 ; 1 6 6 1 ; 1 10 20 10 1 ; 1 15 50 50 15 1 (OEIS A001263).
The cubefree part is that part of a positive integer left after all cubic factors are divided out. For example, the cubefree part of 24=2^3·3 is 3. For n=1, 2, ..., the first ...
The numbers 2^npq and 2^nr are an amicable pair if the three integers p = 2^m(2^(n-m)+1)-1 (1) q = 2^n(2^(n-m)+1)-1 (2) r = 2^(n+m)(2^(n-m)+1)^2-1 (3) are all prime numbers ...
A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" (Skiena ...
An addition-multiplication square is a square of integers that is simultaneously a magic square and multiplication magic square. In 1955, Horner found a square of order eight ...
If a and b are integers not both equal to 0, then there exist integers u and v such that GCD(a,b)=au+bv, where GCD(a,b) is the greatest common divisor of a and b.
Let (K,|·|) be a non-Archimedean field. Its valuation ring R is defined to be R={x in K:|x|<=1}. The valuation ring has maximal ideal M={x in K:|x|<1}, and the field R/M is ...
...
View search results from all Wolfram sites (106377 matches)

