TOPICS
Search

Search Results for ""


2831 - 2840 of 13135 for binary numberSearch Results
For a form Q, the generic character chi_i(Q) of Q is defined as the values of chi_i(m) where (m,2d)=1 and Q represents m: chi_1(Q), chi_2(Q), ..., chi_r(Q) (Cohn 1980, p. ...
Grimm conjectured that if n+1, n+2, ..., n+k are all composite numbers, then there are distinct primes p_(i_j) such that p_(i_j)|(n+j) for 1<=j<=k.
Let F be a finite field with q elements, and let F_s be a field containing F such that [F_s:F]=s. Let chi be a nontrivial multiplicative character of F and chi^'=chi ...
A sequence of positive integers {a_n} such that sum1/(a_nb_n) is irrational for all integer sequences {b_n}. Erdős showed that {2^(2^n)}={1,2,4,16,256,...} (OEIS A001146) is ...
A positive value of n for which x-phi(x)=n has no solution, where phi(x) is the totient function. The first few are 10, 26, 34, 50, 52, ... (OEIS A005278).
A positive even value of n for which phi(x)=n, where phi(x) is the totient function, has no solution. The first few are 14, 26, 34, 38, 50, ... (OEIS A005277).
Given an amicable pair (m,n), the quantity sigma(m) = sigma(n) (1) = =s(m)+s(n) (2) = m+n (3) is called the pair sum, where sigma(n) is the divisor function and s(n) is the ...
R^- denotes the real negative numbers.
R^+ denotes the real positive numbers.
A modification of the Eberhart's conjecture proposed by Wagstaff (1983) which proposes that if q_n is the nth prime such that M_(q_n) is a Mersenne prime, then ...
1 ... 281|282|283|284|285|286|287 ... 1314 Previous Next

...