• generalized to sequences with values in any ring where the concept of divisibility is defined. A strong divisibility sequence is an integer sequence ( a n )...
    4 KB (510 words) - 19:20, 11 January 2025
  • In mathematics, an elliptic divisibility sequence (EDS) is a sequence of integers satisfying a nonlinear recursion relation arising from division polynomials...
    11 KB (1,701 words) - 06:32, 28 March 2025
  • preserving divisibility by the divisor of interest. Therefore, unless otherwise noted, the resulting number should be evaluated for divisibility by the same...
    54 KB (6,801 words) - 10:23, 6 August 2025
  • Thumbnail for Fibonacci sequence
    Thus the Fibonacci sequence is an example of a divisibility sequence. In fact, the Fibonacci sequence satisfies the stronger divisibility property gcd ( F...
    85 KB (12,945 words) - 13:05, 5 August 2025
  • 1 {\displaystyle (U_{m}(P,Q))_{m\geq 1}} is a strong divisibility sequence. Other divisibility properties are as follows: If n is an odd multiple of...
    21 KB (4,012 words) - 14:31, 3 July 2025
  • Thumbnail for Divisor
    Divisor (redirect from Divisibility)
    units −1 and 1 and prime numbers have no non-trivial divisors. There are divisibility rules that allow one to recognize certain divisors of a number from the...
    12 KB (1,858 words) - 05:16, 17 July 2025
  • results in a Fibonacci prime). That is to say, the Fibonacci sequence is a divisibility sequence. Fp is prime for 8 of the first 10 primes p; the exceptions...
    16 KB (2,352 words) - 01:49, 25 July 2025
  • 5, 6, 7, 8, 10, 12, 13, 18, 30). Lucas and Lehmer sequences are examples of divisibility sequences. It is also known that if ( W n ) n ≥ 1 {\displaystyle...
    6 KB (937 words) - 09:17, 8 July 2025
  • Repunit (category Base-dependent integer sequences)
    any m and n. That is, the repunits of a fixed base form a strong divisibility sequence. As a consequence, If m and n are relatively prime, Rm(b) and Rn(b)...
    27 KB (3,426 words) - 13:29, 8 June 2025
  • after receiving his doctorate. The sequence of numbers involved is sometimes referred to as the hailstone sequence, hailstone numbers or hailstone numerals...
    57 KB (7,117 words) - 23:34, 19 July 2025
  • Harshad number (category Base-dependent integer sequences)
    that bn − 1 is divisible by all digit sums in the sequence, then the divisibility by those sums is maintained. If our initial sequence is chosen so that...
    18 KB (2,776 words) - 16:34, 20 July 2025
  • strana), a Czech political party Electrodynamic suspension Elliptic divisibility sequence Energy-dispersive X-ray spectroscopy Effluent decontamination system...
    2 KB (281 words) - 19:48, 15 July 2025
  • aliquot sequence is a sequence of positive integers in which each term is the sum of the proper divisors of the previous term. If the sequence reaches...
    10 KB (1,331 words) - 00:15, 13 July 2025
  • Every sequence of digits, in any base, is the sequence of initial digits of some factorial number in that base. Another result on divisibility of factorials...
    70 KB (8,433 words) - 15:01, 21 July 2025
  • Thumbnail for Constant-recursive sequence
    linear recurrence sequence, linear-recursive sequence, linear-recurrent sequence, or a C-finite sequence. For example, the Fibonacci sequence 0 , 1 , 1 , 2...
    38 KB (5,035 words) - 16:31, 7 July 2025
  • The On-Line Encyclopedia of Integer Sequences (OEIS) is an online database of integer sequences. It was created and maintained by Neil Sloane while researching...
    46 KB (5,629 words) - 04:46, 8 July 2025
  • theorem Congruent number Arithmetic of abelian varieties Elliptic divisibility sequences Mordell curve Fermat's Last Theorem Mordell conjecture Euler's sum...
    10 KB (937 words) - 18:05, 24 June 2025
  • repdigit in tredecimal (11113). 183 is the fourth element of a divisibility sequence 1 , 3 , 13 , 183 , … {\displaystyle 1,3,13,183,\dots } in which...
    2 KB (328 words) - 15:03, 28 February 2025
  • ace of divisibility. The more divisible a number is ... the more useful it proves in certain situations. ... Is it because 60 is highly divisible that the...
    7 KB (760 words) - 06:16, 5 June 2025
  • Miniworkshop: Hilbert's Tenth Problem, Mazur's Conjecture and Divisibility Sequences (PDF). MFO Report. Vol. 3. Mathematisches Forschungsinstitut Oberwolfach...
    30 KB (3,369 words) - 19:26, 13 May 2025
  • Thumbnail for Catalan number
    Press, ISBN 978-0-19-533454-8 Koshy, Thomas & Zhenguang Gao (2011) "Some divisibility properties of Catalan numbers", Mathematical Gazette 95:96–102. Larcombe...
    40 KB (6,013 words) - 20:42, 28 July 2025
  • Self-descriptive number (category Base-dependent integer sequences)
    is divisible by the sum of its digits (which is b). No self-descriptive number can be a prime number. This is a direct result of the divisibility property...
    9 KB (1,160 words) - 15:38, 2 August 2025
  • bin packing is that the item sizes form a divisible sequence (also called factored). A special case of divisible item sizes occurs in memory allocation in...
    53 KB (7,098 words) - 23:25, 26 July 2025
  • Thumbnail for Square-free integer
    Square-free integer (category Integer sequences)
    divisors of n {\displaystyle n} becomes a partially ordered set if we use divisibility as the order relation. This partially ordered set is always a distributive...
    24 KB (3,697 words) - 23:22, 4 August 2025
  • is a list of notable integer sequences with links to their entries in the On-Line Encyclopedia of Integer Sequences. OEIS core sequences Index to OEIS...
    28 KB (27 words) - 19:08, 30 July 2025
  • The first 41 highly composite numbers are listed in the table below (sequence A002182 in the OEIS). The number of divisors is given in the column labeled...
    22 KB (1,716 words) - 07:10, 3 July 2025
  • 37\%} . For a three-digit number that is divisible by 37, a rule of divisibility is that another divisible by 37 can be generated by transferring first...
    10 KB (1,322 words) - 21:38, 5 August 2025
  • properties of 1001 are the basis of a divisibility test for 7, 11 and 13. The method is along the same lines as the divisibility rule for 11 using the property...
    6 KB (717 words) - 02:17, 26 February 2025
  • "Sequence A111441 (Numbers k such that the sum of the squares of the first k primes is divisible by k)". The On-Line Encyclopedia of Integer Sequences...
    31 KB (3,811 words) - 17:42, 5 August 2025
  • {Z} [x,A,B]} . The division polynomials form a generic elliptic divisibility sequence over the ring Q [ x , y , A , B ] / ( y 2 − x 3 − A x − B ) {\displaystyle...
    5 KB (1,178 words) - 17:10, 6 May 2025