Find link

language:

Find link is a tool written by Edward Betts.

searching for Least common multiple 26 found (131 total)

Outline of arithmetic (402 words) [view diff] exact match in snippet view article find links to article

Multiplication – Repeated addition Multiple – Product of multiplication Least common multiple Multiplicative inverse Division – Repeated subtraction Modulo –

693 (number) (311 words) [view diff] exact match in snippet view article

six: 1/693 = 0.001443. 693 is a triangular matchstick number. "Least common multiple of 1,3,5,...,2n-1". OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence

Artinian ideal (387 words) [view diff] exact match in snippet view article find links to article

can take the Artinian closure of it as follows. First, take the least common multiple of the generators of the ideal. Second, add to the generating set

New Fire ceremony (1,443 words) [view diff] exact match in snippet view article find links to article

calendars. Arithmetically, the duration of the Calendar Round is the least common multiple of 260 and 365; 18,980 is 73 × 260 Tzolkʼin days and 52 × 365 Haabʼ

Converse nonimplication (716 words) [view diff] exact match in snippet view article find links to article

complement operator, ∨ {\displaystyle \scriptstyle {_{\vee }}\!} (least common multiple) as join operator and ∧ {\displaystyle \scriptstyle {_{\wedge }}\

Löschian number (302 words) [view diff] exact match in snippet view article find links to article

only if x and y are both even. The greatest common divisor and the least common multiple of any two or more Löschian numbers are also Löschian numbers. The

210 (number) (424 words) [view diff] exact match in snippet view article

numbers (2, 3, 5, and 7), and thus a primorial, where it is the least common multiple of these four prime numbers. 210 is the first primorial number greater

Li Chunfeng (894 words) [view diff] exact match in snippet view article find links to article

Chapters on the Mathematical Art by Liu Hui. He demonstrated that the least common multiple of the numbers {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} was 27720—the

Vigenère cipher (5,929 words) [view diff] exact match in snippet view article find links to article

repeated. If multiple keys are used, the effective key length is the least common multiple of the lengths of the individual keys. For example, using the two

1,000,000,000 (3,545 words) [view diff] exact match in snippet view article find links to article

1,661,392,258 : n such that n divides (3n + 5) 1,673,196,525 : Least common multiple of the odd integers from 1 to 25 1,677,922,740 : number of series-reduced

5040 (number) (563 words) [view diff] exact match in snippet view article

181 + 191 + 193 + 197 + 199 + 211 + 223 + 227 + 229). 5040 is the least common multiple of the first 10 multiples of 2 (2, 4, 6, 8, 10, 12, 14, 16, 18 and

Gröbner basis (9,883 words) [view diff] exact match in snippet view article find links to article

whose exponent vector is the componentwise minimum of A and B. The least common multiple lcm(M, N) is defined similarly with max instead of min. One has

Gregorian calendar (8,286 words) [view diff] exact match in snippet view article find links to article

cycle, the thirty different possible values of the epact, and the least common multiple (10,000) of the 400-year and 2,500-year solar and lunar correction

TI-36 (1,401 words) [view diff] exact match in snippet view article find links to article

calculation. Other new functions over TI-36X II include: Math: Least common multiple, Greatest common divisor, Prime factors (from TI-Collège Plus),

List of mathematical abbreviations (1,983 words) [view diff] exact match in snippet view article find links to article

(log2). (Also written as ld.) lcm – lowest common multiple (a.k.a. least common multiple) of two numbers. LCHS – locally compact Hausdorff second countable

Binomial coefficient (10,493 words) [view diff] exact match in snippet view article find links to article

pp. 4−5 Farhi, Bakir (2007). "Nontrivial lower bounds for the least common multiple of some finite sequence of integers". Journal of Number Theory.

1000 (number) (25,340 words) [view diff] exact match in snippet view article

finite connected sets of positive integers greater than one with least common multiple 72 1689 = 9 ! ! ∑ k = 0 4 1 2 k + 1 {\displaystyle 9!!\sum _{k=0}^{4}{\frac

Artin–Tits group (2,995 words) [view diff] exact match in snippet view article find links to article

greatest common divisors and conditional least common multiples (a least common multiple exists whenever a common multiple does). If A + {\displaystyle A^{+}}

Boolean algebras canonically defined (8,235 words) [view diff] exact match in snippet view article find links to article

of two periodic sequences is periodic, with period at most the least common multiple of the periods of the two arguments (the period can be as small

Lindemann–Weierstrass theorem (4,823 words) [view diff] exact match in snippet view article find links to article

{\displaystyle j=1,\ldots ,k,} let d j {\displaystyle d_{j}} be the least common multiple of all the d m , j {\displaystyle d_{m,j}} for m = 1 , … , M {\displaystyle

GCD matrix (1,376 words) [view diff] exact match in snippet view article find links to article

1016/0024-3795(92)90042-9. Hong, S. (1999). "On the Bourque–Ligh conjecture of least common multiple matrices". Journal of Algebra. 218: 216–228. doi:10.1006/jabr.1998

Heronian triangle (5,845 words) [view diff] exact match in snippet view article find links to article

non-integer altitudes can be scaled up by a factor equalling the least common multiple of the altitudes' denominators in order to obtain a similar Heronian

Crystal oscillator frequencies (714 words) [view diff] exact match in snippet view article find links to article

200(×8×125). Also used as a 3G reference clock, due to being a least common multiple of W-CDMA chip rate 3.84 MHz (5x) and 200 kHz channel raster (96x)

Anatoly Karatsuba (9,409 words) [view diff] exact match in snippet view article find links to article

derived by G.I. Arkhipov). Denoting by Q 0 {\displaystyle Q_{0}} the least common multiple of the numbers q ( t 1 , … , t r ) {\displaystyle q(t_{1},\dots

Burst error-correcting code (9,228 words) [view diff] exact match in snippet view article find links to article

We can calculate the block-length of the code by evaluating the least common multiple of p {\displaystyle p} and 2 ℓ − 1 {\displaystyle 2\ell -1} . In

Random permutation statistics (11,987 words) [view diff] exact match in snippet view article find links to article

{\displaystyle P^{n}} is the identity permutation. This is the least common multiple of the lengths of the cycles of P. A theorem of Goh and Schmutz