This is not a computational question at all but an easy exercise.
There is one prime ideal for each prime factor p of n, namely pZ/nZ.
See any book on elementary ring theory!
John Cremona
On Mar 12, 11:41 pm, Avishek Adhikari wrote:
> Hello,
> I shall be glad, if you kindly send the help towa
Am 24.02.2011 19:29, schrieb Dmitri:
>> A chosen set of points is convex if it is equal to its convex hull.
as far as I see this is equivalent to, all points are on a facet of the
polytope.
> I think my problem is actually doing the comparison. So I have this
> chosen set of points which I don't
On Sun, Mar 13, 2011 at 12:08 AM, pong wrote:
> A quick question. How to use sagetex to display a graph (edges and
> vertices) produced by sage without saving it first manually then
> \includegraphics.
>
Plotting graphs works by calling sageplot on the graph's plot:
\sageplot{graphs.PetersenGra
Hello,
I shall be glad, if you kindly send the help towards finding the solution
of the following problem using sage:
In Z_n (the ring of integers modulo n), find all prime ideals.
Waiting for your reply.
Best regards,
Avishek
--
To post to this group, send email to sage-support@googlegrou
