2021-09-03 09:26:12 +0100 | asked a question | Why are there two different options for Sage in Jupyter's "New" menu? Who offers the dropdown menu of Jupyter two different Sage options? When I open a Jupyter Session and klick on >>N |

2021-07-02 00:01:13 +0100 | received badge | ● Nice Question (source) |

2021-07-01 08:12:48 +0100 | asked a question | why can't I compute the zeros of an integer polynomial using solve()? why can't I compute the zeros of an integer polynomial using solve()? This works fine, producing complex roots: x=var(' |

2021-06-24 11:47:55 +0100 | received badge | ● Popular Question (source) |

2021-05-18 01:56:04 +0100 | received badge | ● Notable Question (source) |

2021-05-18 01:56:04 +0100 | received badge | ● Popular Question (source) |

2021-02-09 16:30:52 +0100 | commented answer | limit of fourier series Yes, but it does not answer my question ;-) I want to compute the limit function f(x), restricted to x from 0 to 2*\pi |

2021-02-06 10:02:56 +0100 | received badge | ● Organizer (source) |

2021-02-06 10:00:40 +0100 | asked a question | limit of fourier series I'd like to compute the limit of $$\sum_{k=1}^{n}\frac{1}{k^2+1}\sin(kx)$$ I did the following already: I already tried computing it by hand, looked in Bronstein, searched the internet, but didn't find any solution. But I'm no specialist in Analysis, so perhaps somebody can help? Clearly the series converges for every x in [0,2*pi] ... |

2020-09-08 17:57:25 +0100 | received badge | ● Supporter (source) |

2020-09-03 19:30:14 +0100 | answered a question | Can sagetex generate tex files? Since you didn't provide an example I'm not 100% sure what you want to do. Anyway you should have a look at jinja: |

2020-09-03 07:26:14 +0100 | received badge | ● Editor (source) |

2020-09-03 07:23:29 +0100 | asked a question | How to handle very large numbers I want to play around with factorials. I found that Then I searched for a SageMath Stirling Formula, which I didn't find (only some related stuff), so I tried it myself: This gave me an error after some minutes: Then I tried s(10**9), there I got another error: So what can I do? Is there a special library for very large reals or int or some special commands for getting an approximation of how many decimals a factorial will have? Could I use the The reason why I'm asking is that I am rewriting a text which is 20 years old and there's a statement that And last but not least I would like to know if there is an upper bound for numbers that sage can handle. I thought not, but now I know otherwise ;-) Also hints to good literature on these topics would be appreciated. |

2020-08-20 18:22:48 +0100 | commented answer | sagetex linebreak I really need long number output, because I work with cryptography and number theory stuff and people want to copy and paste. |

2020-08-20 18:20:59 +0100 | answered a question | sagetex linebreak I found a solution myself (and already posted it on tex.stackexchange). Here it is: |

2020-08-16 14:11:31 +0100 | asked a question | sagetex linebreak When using the environment sagecommandline of sagetex with long number output, how can I get automatic line breaks? I already tried to change sagetex.sty (putting breaklines=true at several places), but nothing changed. Here is my minimal example: (p.s. I asked the same question also on tex.stackexchange) |

2020-04-05 14:52:37 +0100 | received badge | ● Student (source) |

2020-04-05 14:07:20 +0100 | asked a question | How to find out the difference between M.determinant(), M.det() and det(M)? I am quite new to sagemath, but an experienced mathematician ... so I tried computing determinants for a given Matrix M and found different solutions. I found that M.det() is short for M.determinant() after searching the index and going further from there. But I did not find something for the syntax det(M). Inspire of being not a programmer, I am interested in a) where could I search to find the difference? b) what is the difference, if any? Many thank! Doris |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.