Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3).
Navigation
Topics Help • Register • News • History • How to • Sequences statistics • Template prototypes

Search results

Jump to: navigation, search
  • ...hich are derived from a lower exponent. The second type is [[aurifeuillian factor]], in which the whole number can be split into two parts directly, for cert ==Algebraic factorizations==
    7 KB (1,150 words) - 23:48, 19 April 2023
  • ...are covered by algebraic factors or a combination of algebraic and trivial factor(s), or make [[Generalized Fermat number]]'s.
    3 KB (503 words) - 02:20, 1 May 2024
  • ...]] known, among those whose complexity depends mainly on the size of the [[factor]] found. where p is the smallest factor.
    19 KB (3,181 words) - 22:27, 6 July 2023
  • ...ucas-Lehmer Test is unnecessary. It often takes much less effort to find a factor than to do the Lucas-Lehmer Test; in fact, over 60% of [[Mersenne number]]s ...n that any factor of the Mersenne number <math>2^p-1</math> must be of the algebraic form <math>2kp+1</math> for some positive integer <math>k</math> and furthe
    6 KB (962 words) - 10:08, 7 March 2019
  • ...umber to be factored. Typically one polynomial is of degree 4, 5 or 6 (the algebraic side) and the other one is linear (the rational side). #Dividing out algebraic factors
    7 KB (1,238 words) - 16:14, 12 February 2019