Search results

  • == Problem == ''This problem also appeared on the 2007 [[TST]] for Korea.''
    4 KB (641 words) - 10:09, 30 March 2008
  • ...n '''extension''' of <math>G</math> by <math>F</math> is a solution to the problem of finding a group <math>E</math> that contains a [[normal subgroup]] <math ...<math>E'</math>. In other words, every extension morphism is an extension isomorphism.
    5 KB (901 words) - 19:53, 27 May 2008
  • ...matical problems resist exact solution. Examples include the [[isomorphism problem]] and various [[dynamical systems]]. In order to increase the value of math
    2 KB (322 words) - 20:03, 11 February 2009
  • !Problem <!-- TEMPLATE, COPY-PASTE-FILL-IN: date, author, problem, solver; n = problem number, then click the red link and copypaste the solution, save. There. If
    22 KB (3,358 words) - 14:17, 18 July 2017
  • ==Problem== - in this specific problem this logic is incorrect, as the coefficients of the polynomial can be compl
    14 KB (2,463 words) - 15:43, 19 September 2024
  • == Problem 8 == ...math>\varphi^{-1}</math> is linear in its arguments (by virtue of being an isomorphism), <cmath>\varphi^{-1}(0,1)=15\varphi^{-1}(1,0)+\varphi^{-1}(1,1)=15\times 6
    14 KB (2,209 words) - 19:01, 16 August 2024
  • ==Problem== ...ath> so the remainder is <math>6</math> on each factor on the right of the isomorphism. Hence, by the Chinese remainder theorem, the remainder modulo <math>g</mat
    3 KB (579 words) - 10:56, 21 April 2024