help on FFT in Z/mZ

[jasonp]

You cannot.

Akruppa answered your question. For more information, look up software like apfloat, which has a nice documentation web page.

[science_man_88]

Originally Posted by habib106

Thank you.

but how to use mailing list, plating list, OP,... to find all n-th roots of unity.
please if you have any link or website .

n-th root of unity z^n=1

(0*i^x+1)^y where i= and x and y any integers should give 1 and hence give infinitely many solutions good luck finding all of them.

source of definition: http://en.wikipedia.org/wiki/Root_of_unity oh and using 1=i^(4t) = (-1)*(-1) many more solutions with y = 0 regardless of the leading coefficient.

[akruppa]

We're talking about finite fields here, sm88.

[davieddy]

Originally Posted by xilman

Sorry, some erudite wordplay which many non-native speakers would have difficulty decoding.
Paul

Not to mention some of us who were born in West Runton.

[only_human]

Originally Posted by habib106

Thank you.

but how to use mailing list, plating list, OP,... to find all n-th roots of unity.
please if you have any link or website.

OP means Original Poster. That is you in this thread.

Sorry about the joking. The joking sometimes happens after people think the Original Poster's question has been answered.

Looking at the Google search string you posted it shows an interface language of French and a localization of Morocco.

There is a good French Wikipedia entry for Finite Field mathematics: http://fr.wikipedia.org/wiki/Corps_fini

Here is an entry for Root of unity modulo n. I only found this in English.

Number-theoretic transform

Since you are interested in writing a program, there is a lot to know. People say that the book Prime Numbers: A Computational Perspective by Richard Crandall and Carl Pomerance is very good.

[habib106]

Originally Posted by only_human

OP means Original Poster. That is you in this thread.

Sorry about the joking. The joking sometimes happens after people think the Original Poster's question has been answered.

Looking at the Google search string you posted it shows an interface language of French and a localization of Morocco.

There is a good French Wikipedia entry for Finite Field mathematics: http://fr.wikipedia.org/wiki/Corps_fini

Here is an entry for Root of unity modulo n. I only found this in English.

Number-theoretic transform

Since you are interested in writing a program, there is a lot to know. People say that the book Prime Numbers: A Computational Perspective by Richard Crandall and Carl Pomerance is very good.

Merci beaucoup

les sites web http://www.apfloat.org/ntt.html et http://fr.wikipedia.org/wiki/Corps_fini repond bien à ma qestion

I am sorry my english is not well.

[R.D. Silverman]

Originally Posted by habib106

Merci beaucoup

les sites web http://www.apfloat.org/ntt.html et http://fr.wikipedia.org/wiki/Corps_fini repond bien à ma qestion

I am sorry my english is not well.

Parler en francais.... Nous parlons francais.

[Dubslow]

Originally Posted by R.D. Silverman

Parler en francais.... Nous parlons francais.

Mais apparemment il ne peut pas faire les accents. (Je le trouve un peu ironique que cette phrase-là n'a pas des accents, mais bien sûr celle-ci en a un. )