A computer algebra system (CAS) is a program which is able to carry out various symbolic manipulations with mathematical expressions. Some well-known computer-algebra systems: Mathematica, Maple, Wolfram Alpha, GAP, SAGE. For questions about Mathematica please see the http://mathematica....

learn more… | top users | synonyms

2
votes
0answers
213 views

What is a good software package for ( assisted ) theorem proving and documenting?

Background: An issue in my math study is that I haven't found a good way of storing the theorems ( mostly abstract algebra ) I studied and want to (re-)use in proofs. At the moment I use a personal ...
1
vote
2answers
140 views

Compute Automorphism Group using Computer Software

Is there a computer software that can compute Automorphism Groups. For instance $Aut(\mathbb{Z}_4\times\mathbb{Z}_2)$. I tried Sage, but could not get it to work. Output: ...
1
vote
2answers
71 views

In maple how do you evaluate combinations?

In Maple how do you have it evaluate combinatorics such as $\binom{5}{2}$ and give you the answer 10? (What is the name of what I want to do anyways, is it evaluate?) Thanks. Seems so easy now that I ...
1
vote
1answer
110 views

How do I determine if two of my software's representation of algebraic numbers are equal?

I have software which stores information about algebraic numbers with absolute precision. If you build it up by creating instances of a Python representation of an integer, float, Decimal, or string, ...
1
vote
2answers
18k views

Wolfram Alpha: How to define constants in a system of equations?

I'd like to use WA to solve a small system of nonlinear equations, that involve both constants and the variables of interest. How do I "tell" WA which variables are the constants, and which are the ...
1
vote
1answer
133 views

Coset Enumeration with GAP

I have downloaded GAP version 4.7.8. for windows, and installed everything (all packages, including"ACE") with the installer. Now I want to do a simple task, enumerating the cosets. To create a group ...
1
vote
2answers
94 views

Real valued eigenvalues in GAP?

I have a matrix in GAP, and I want its real valued eigenvalues. (Or rational approximations of them, of course.) As far as I can tell Eigenvalues(Rationals,A) only gives me the rational eigenvalues. ...
1
vote
2answers
128 views

Representing Elementary Functions in a CAS

I've looked through several books about computer algebra. They are surprisingly scarce about how to actually represent elementary functions. Basically, as far as I understood elementary functions are ...
1
vote
1answer
118 views

An integral evaluation

I tried my luck with Wolfram Alpha, with $p \in \mathbb{R}$ $$\int_{-\infty}^{\infty} \frac{x^p}{1+x^2} dx = \frac{1}{2} \pi ((-1)^p+1) \sec(\frac{\pi p}{2})$$ for $-1<p<1$, and doesn't exist ...
1
vote
4answers
81 views

How would you represent an abstract set on a computer?

I'm trying to come up with a simple language for specifying mathematics. We can't simply define a set as a collection of objects because that's meant for human understanding and that would also lead ...
1
vote
2answers
68 views

How can I plot $y^x$?

How can I plot $y^x$? To keep things simple and to not have another $z$ variable on the other end of the equation, let's assume $y^x=10$. As long as that value is not $0$, the curve we get should look ...
1
vote
1answer
367 views

How to expand quadratic equations in Octave/Matlab?

I have some column vectors, and I put them in a row, so I have $[a \, b \, c]$. Now I want to get a matrix of the form $[a^2 \, b^2 \, c^2 \, ab \, ac \, bc]$. It is like expanding $(a+b+c)^2$, but ...
1
vote
1answer
87 views

Chinese remainder theorem for polynomial evaluation

Let $R$ be a euclidean domain, $m_0,\ldots ,m_{k-1}\in R$ be pairwise coprime and $m:=m_0\cdots m_{k-1}$. The Chinese remainder theorem states: $$\varphi:R\to R/(m_0)\times\cdots \times R/(m_{k-1})\;,...
1
vote
3answers
62 views

If there is an $a\in\mathbb{Z}$ with $a^{n-1}\equiv 1\mod n$ but $a^{\frac{n-1}p}\not\equiv 1$ for all primes $p\mid n-1$, then $n$ is a prime

Let $n\in\mathbb{N}$ with $n\ge 3$ and $a\in\mathbb{Z}$ such that $$a^{n-1}\equiv1\text{ mod } n\;\;\;\wedge\;\;\;a^{\frac{n-1}{p}}\not\equiv1\text{ mod }n\;\;\;\forall p\in\mathbb{P}:p\mid n-1$$ ...
1
vote
2answers
164 views

Printing long lines in MAGMA without line break

In MAGMA, how do I print a long list of items to a file without automatic line breaks? It seems to me that there is an internal length limit and anything longer than it will result in a automatic ...
1
vote
1answer
82 views

Comparing expressions exactly

Suppose I have two expressions; call them $A$ and $B$. The following values of $A$ and $B$ are good examples for my question... $$ A = \pi e^2\\ B = \pi^2 e $$ Is there a method to determine the ...
1
vote
4answers
65 views

I know that the binary and hexadecimal are useful, but what are the point of other bases, for example base 12?

I know about the uses of binary and hexadecimal, but what are the uses of other bases, for example base 12? (or duodecimal)
1
vote
1answer
57 views

Questions that SAGE, MAGMA can answer?

I practice theoretical mathematics and I know (almost) nothing about SAGE, MAGMA. I would like to know (in general) what type of questions can I ask SAGE to do? For example, I know that given an ...
1
vote
1answer
74 views

How to create a matrix in pari/gp [closed]

How does one create a matrix in $\texttt{pari}$? I currently understand how to create a vector: ? vector(6,n,n^2) %1 = [1, 4, 9, 16, 25, 36] I also know how ...
1
vote
1answer
46 views

UFD test - software? [closed]

I have a quotient of a polynomial ring. I would like to check if it is a UFD. Is there software that will allow me to do that?
1
vote
1answer
120 views

how to use hilbert function in gap system with loadpackage singular

how to calculate hilbert function as it do in singular code singular code ...
1
vote
1answer
300 views

Programming PARI/GP to do a sum

I'm trying to compute the following sum in PARI/GP $C=\sum_{n=1}^{\infty} \frac{g(n)}{n^2}$ where $g(n)$ defined as $$g(n)=(-1)^r, \qquad r=\text{number of even indexed prime factors of $n$}$$ By ...
1
vote
1answer
369 views

Implementing a function in PARI/GP

I want to define a function: $$g(n)= \begin{cases} +1 & \text{if $n=1$},\\ +1 & \text{if $n$ is an odd indexed prime}, \\ -1 & \text{if $n$ is an even indexed prime},\\ (-1)^r & \text{...
1
vote
1answer
50 views

How many $\overline{a}\in\left(\mathbb{Z}/91\mathbb{Z}\right)^\times$ pass the Fermat and Miller-Rabin primability tests?

Let $$\text{F}_{91}:=\left\{\overline{a}\in\left(\mathbb{Z}/n\mathbb{Z}\right)^\times:91\text { passes the Fermat primality test to base }a\right\}$$ and $$\text{MF}_{91}:=\left\{\overline{a}\in\left(\...
1
vote
1answer
308 views

Knuth-Bendix completion algorithm: word problem

Can someone explain me how to set up an algorithm to find the 12 normal forms of the group $A_4$ by making use of the Knuth-Bendix completion algorithm? So we have that $RRR=1, SSS=1$ and $RSRS=1$. ...
1
vote
1answer
43 views

Specifying if a function has an elementary integral

In Algorithms for Computer Algebra in the last chapter about Risch algorithm, the Rothstein-Trager method is applied to see if an elementary function has an elementary integral. For this, the ...
1
vote
2answers
206 views

wolfram mathematica, numerical integration, precision of a function/expression

I want to obtain the best numerical approximation (up to 10 decimal place would be ok for me) to an integral: $$ \int^{\infty}_{0} f(r)r^2dr $$ I am using the function $f(r)$, which is related to ...
1
vote
1answer
1k views

Existence of non-trivial solution of Sylvester equation.

I'm trying to solve a special case of Sylvester equation in my case it looks like $$A*X=X*B$$ so it can be written in form $$A*X+X*(-B)=C$$ where C consist of all 0 items. I tried to solve it in ...
1
vote
1answer
1k views

Algorithm for finding limits of compositions of simple functions?

There are two questions: Define the set $S$. Compute the limit of functions $f/g$ for functions $f,g\in S$, where $S$ is defined in the following way. All constant function are in $S$, $f(n) = n\...
1
vote
1answer
41 views

How to print long strings in MAGMA?

I'm trying to print a very long list to a file using magma to make it "callable". The list is called F2, and the code I'm using to print this list to a file is the following ...
1
vote
1answer
18 views

Algorithm for computing the inverse limit of a finite inverse system

Let $k$ be a field (finite if you'd like), let $(I,\le)$ be a finite directed poset with $|I|=n$, and let $(A_i,f_{ij})_{i\le j\in I}$ be an inverse system of finitely generated, graded, commutative $...
1
vote
1answer
38 views

Ideal intersection in Boolean polynomial ring

I'm trying to calculate $ \langle x,y,z\rangle \cap \langle x+1,y+1,z+1\rangle $ in the ring of Boolean polynomials. In CoCoA initially I set the ring as ...
1
vote
1answer
32 views

Computing Extensions of an Ideal in Singular or Macaulay2

Does Macaulay2 or Singular compute extensions of ideals under ring homomorphisms? Specifically, if $\phi:R\rightarrow S$ is a ring homomorphism (say polynomial rings over $\mathbb{Q}$ which can be ...
1
vote
1answer
54 views

Higher Level Group Actions beyond OnSets

Is there a way to produce an orbit of a chain in a poset (whose elements are sets of sets) (that is, the group action is a group acting on the order complex of a poset)? I really want something that ...
1
vote
1answer
74 views

Math software to calculate in different rings.

I was doing computational experiment by using rings of polynomial like this let $f(x)=x^6+x\in\mathbb{Z_n[x]}$ for any given $n$. Is there any software which help me to calculate $f(a)$ where $a\...
1
vote
1answer
50 views

Variance of discrete probability distribution

I was wondering how I should calculate the variance of the following discrete probability distribution: $$P(y = 0|X) = w + (1-w)e^{-\mu}$$ $$P(y = j|X) = (1-w)e^{-\mu}\mu^{y}/y! \qquad j=1,2...$$ ...
1
vote
1answer
44 views

Number conversion in decimal fraction

980.85D convert to hexadecimal number = 3D4 . ?? how to solve the answer after the decimal point? Thank you in advanced.
1
vote
1answer
56 views

If $A\ne 0$ is a square matrix over a commutative ring with $\det A=0$, then its null space contains an element whose components are minors of $A$

Let $R$ denote a commutative ring and $A\ne 0$ a $n\times n$ matrix over $R$ with $\det A=0$. Then there exists a $x\in\ker A\setminus\left\{0\right\}$ such that all components of $x$ are minors of $A$...
1
vote
1answer
102 views

Number of monic irreducible polynomials over a finite field

Let $\mathbb{K}=\mathbb{F}_q$ and $\nu_n$ denote the number of monic irreducible polynomials over $\mathbb{K}$. It holds $$\nu_n=\frac{1}{n}\sum_{d\mid n}\mu\left(\frac{n}{d}\right)q^d$$ What I need ...
1
vote
2answers
214 views

Some questions about similar matrices

Two matrices A and B are similar, if and only if there exists an invertible matrix C with $A=C^{-1}BC$. A necessary condition for the similarity is, that the characteristic polynomials coincide. I ...
1
vote
1answer
157 views

Prevent Maple to evaluate before simplify a function

I have been trying to find a domain of $f(x)=\frac{x}{\frac{(x+2)}{(x-3)}}$ using different kind of software ( its clear the domain of this function is $\mathbb{R}\backslash \{-2,3\}$ ). When I tried ...
1
vote
1answer
58 views

Computational complexity of expanding a MacLaurin/Taylor Series

What methods exist to computationally determine the first $k$ coefficients of a function (possibly polynomial or rational polynomial function)? How do Mathematica/MatLab/Maple/etc. solve this ...
1
vote
1answer
66 views

Checking if a polynomial expression is constant in SAGE

I have a huge fractional-polynomial expression in SAGE that I have good reasons to believe is the constant function. Is there a command in SAGE like "== constant function" that I could use to check ...
1
vote
1answer
248 views

Computing univariate resultant via modified Euclidean algorithm

In an answer to the question Resultant of Two Univariate Polynomials, a PDF of course slides was linked which describes a modification of Euclid's algorithm for computing univariate polynomial ...
1
vote
1answer
274 views

How to calculate resultant of two polynomials without knowing the roots.

So in Rothstein - Trager's Method of evaluating logarithmic part they need resultant of two polynomial as shown in the image. My question is that how do they calculate the resultant without knowing ...
1
vote
1answer
96 views

Help in understanding risch algorithm

This is an excerpt from the paper that explains risch algorithm for symbolic integration. I do not understand how do we get to the residue directly and also how does it help us in the integration. ...
1
vote
1answer
189 views

Resultant of Two Univariate Polynomials

I am trying to implement an algorithm for computing Res(f(x),g(x),x) where f(x) and g(x) uni variate polynomials with integer coefficients. Could any one list the various algorithms for computing Res(...
1
vote
2answers
728 views

Plotting parametric equations in Maple

I have the following problem. Let $\alpha:=\alpha(v)$ and $\beta:=\beta(v)$, where $v\in\mathbb{R}$. Using MAPLE, I would like to plot $\alpha$ and $\beta$ in the $(\alpha,\beta)$ space as $v$ varies ...
1
vote
1answer
151 views

Computing Resultant

The resultant of two polynomials is defined as the determinant of the Sylvester matrix. If the polynomials are of degree $n$ and $m$, than the Sylvester matrix will be of dimension $(m+n)\times (m+n)...
1
vote
1answer
60 views

What are the explicit expression for this interpolation problem

We want to fit $f(x) = a_0 + a_1 *x + a_2 * x^2 + ... + a_n * x^n$ to the data $(x_i,f(x_i))$ for $i = 0 ... n.$ It will give rise to the following system $ A a = b $ Here $ a = [ a_1 a_2 a_3 ......