User talk:D.Lazard

Reducible polynomials

Is the definition of a polynomial be reducible over the integers the only one. For instance in Stewart's Galois Theory, Third Edition (Definition 3.10) he writes

"A polynomial over a subring R of C is reducible if it is a product of two polynomials over R of smaller degree. Otherwise it is irreducible."

He then goes on to give an example of a polynomial that is irreducible over Z(t) of 6t+3=3(2t+1). This was the basis for the change that I made on the irreducible polynomial page that you reverted back. If different books use different definitions then shouldn't this be included in the article. — Preceding unsigned comment added by Uwhoff (talk • contribs) 20:18, 17 November 2013 (UTC)

I have answered in Talk:Irreducible polynomial#Irreducibility aver the integers. However, I did not answered about this particular example. Are you sure that he wrote "the polynomial 6t+3=3(2t+1) is irreducible over Z[t]" (which is incorrect) and not "the polynomial 6t+3=3(2t+1) (defined) over Z[t] is irreducible over Q[t]" or "the polynomial 6t+3=3(2t+1) (defined) over Z[t] is irreducible" (which are both correct, if one considers only the irreducibility over a field). The place of "over" is essential. D.Lazard (talk) 14:30, 18 November 2013 (UTC)

Modular arithmetic

"(Reverted good faith edits by Jtle515 (talk): Translating the latin ablatif as "by" is not sourced and WP:OR. (TW))"

Knowing another language counts as original research now? Huh? --Jtle515 (talk) 06:25, 23 November 2013 (UTC)

It is not the knowledge of Latin which is original research, but the choice of translating ablatif, in this particular case, by "by". This choice is controversial. D.Lazard (talk) 10:18, 23 November 2013 (UTC)

What else could it be, in context? --Jtle515 (talk) 11:02, 23 November 2013 (UTC)

For a mathematician, "modulo" means "up to modulus". However I do not know if this translation is linguistically correct. D.Lazard (talk) 11:12, 23 November 2013 (UTC)

Javascript Exetended Euclidean Algorithm

Hello!

I think the pseudocode is not so clear on the page Extended Euclidean algorithm, so I put a implementation in Javascript.

But you revert my edits.

I see that on the talk page there are more people talking it, so I think that it could bee good put some "real" code there. I am not saying that we need put the Javascript code, but, some code.

What do you think about?

Tks

Lp.vitor (talk) 12:53, 1 December 2013 (UTC)

The pseudo-code is be very close to Pascal or Maple code. Therefore Javascript of other codes seem not useful for the article. In fact, the difference with Pascal code lies only in the absence of "end" keywords and in multiple assignations. Maybe, it would be clearer if they would be split in pairs of simple assignations, which is complicated by the need an auxiliary temporary variable. D.Lazard (talk) 16:41, 1 December 2013 (UTC)

Or maybe someone could explain how the multiple assignations works... Lp.vitor (talk) 21:51, 1 December 2013 (UTC)