Search Results for ""

Given F_1(x,y,z,u,v,w) = 0 (1) F_2(x,y,z,u,v,w) = 0 (2) F_3(x,y,z,u,v,w) = 0, (3) if the determinantof the Jacobian |JF(u,v,w)|=|(partial(F_1,F_2,F_3))/(partial(u,v,w))|!=0, ...

The continued fraction for K is [2; 1, 2, 5, 1, 1, 2, 1, 1, ...] (OEIS A002211). A plot of the first 256 terms of the continued fraction represented as a sequence of binary ...

A modular inverse of an integer b (modulo m) is the integer b^(-1) such that bb^(-1)=1 (mod m). A modular inverse can be computed in the Wolfram Language using PowerMod[b, ...

The set of natural numbers (the positive integers Z-+ 1, 2, 3, ...; OEIS A000027), denoted N, also called the whole numbers. Like whole numbers, there is no general agreement ...

A number which is simultaneously octagonal and hexagonal. Let O_n denote the nth octagonal number and H_m the mth hexagonal number, then a number which is both octagonal and ...

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 ...

Given an integer e>=2, the Payam number E_+/-(e) is the smallest positive odd integer k such that for every positive integer n, the number k·2^n+/-1 is not divisible by any ...

A perfect partition is a partition of a number n whose elements uniquely generate any number 1, 2, ..., n. {1,1,...,1_()_(n)} is always a perfect partition of n, and every ...

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, ...

There are at least two sequences attributed to B. Recamán. One is the sequence a_n formed by taking a_1=1 and letting a_n={a_(n-1)-n if a_(n-1)-n>0 and is new; a_(n-1)+n ...