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. For questions about Mathematica please see the ...

learn more… | top users | synonyms

2
votes
0answers
68 views

Are there high performance computing applications for symbolic integration?

Currently there are a number of applications for numerical integration in applied mathematics and physics. Many of these are integral transforms (often Fourier or Laplace), or solving definite ...
2
votes
0answers
37 views

Muirhead's Inequality (software?)

I just started learning about inequalities: Schur's, Karamata's, Muirhead's, etc... They are beautiful but it seems that in the case of more than two variables, some of the computations become a ...
2
votes
0answers
86 views

Todd-Coxeter algorithm: coincidences

I'm trying to understand the Todd-Coxeter algorithm with the help of a multiplication and relator table, but there is one thing about coincidences that is not really clear. For some small groups (for ...
2
votes
0answers
161 views

How does one solve equations over finite fields in SAGE?

Sage has the method solve (or function, I'm not sure what's the correct terminology) that finds solutions to 'symbolic expressions'. In particular, if one wants to find solutions for a given set of ...
2
votes
0answers
48 views

Is there a known algorithm for approximating all the real and imaginary zeros of any well behaved equation of a single variable?

Does there currently exist a general algorithm (or set of algorithms used together) that will approximate all the zeros of any well behaved non-differential equation of a single variable which has a ...
2
votes
0answers
459 views

Solving large, sparse system of linear equations

I have a system of linear equations as follows: $$(A+I)x=B$$ where $I$ is the $n\times n$ identity matrix, $A$ is a $n\times n$ matrix such that the first and last rows are blank, and, for every ...
2
votes
0answers
61 views

Minimal set of algebraically independent numbers

Suppose we have a set of polynomials $f_1, f_2, \ldots, f_n \in \mathbb{Q}[x]$. Consider the set $$S := \{\alpha \in \mathbb{C} \; | \; f_i(\alpha) = 0 \text{ for some } i \}$$ of complex roots of ...
2
votes
2answers
231 views

Simple generators with a complex Gröbner basis

It's known that finding a Gröbner basis of a polynomial ideal has a worst-case space complexity of $O(2^{2^{c\cdot n}})$, where c is constant and n is the number of variables $k[x_1,\ldots,x_n]$. ...
2
votes
0answers
78 views

Free software for expresing a resolvent as function of coefficients

This relates to question "Expressing a symmetric polynomial in terms of elementary symmetric polynomials using computer?" I would like to try absolute resolvent for group $C_5$ in $S_5$. For example ...
2
votes
1answer
191 views

Introduction to Elementary Functions

I'm looking for an introductory text on algebraic treatment of elementary functions. Really short and easy-going. Video lectures are even better. I want to learn basic ideas (i.e. definitions) behind ...
2
votes
0answers
158 views

How do mathematicians handle functions of functions that may change?

E.g. let $f(x) = $ some function. Now define $h(x) = f(g(x))$. Now suppose the definition of $g(x)$ changes around in a discussion. Do we still refer to $h(x)$ as the original $h(x)$ or only when ...
2
votes
0answers
171 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
64 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
2answers
214 views

CAS for algebraic geometry, which one?

I use Maple to compute Groebner bases and find it very efficient/fast for my current needs. However, several introductory textbooks on algebraic geometry refer to Singular, which I never used before. ...
1
vote
1answer
91 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
10k 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
2answers
121 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
115 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
2answers
66 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
58 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 ...
1
vote
3answers
54 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
1answer
77 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
1answer
387 views

Complex equation in maxima

I rested on this tutorial. After issuing the command with "solve" function: %i2 solve((a-b-sqrt(-c^2+2*c*y-y^2+r^2))^2+(d-y)^2=2*r^2*(1-cos(e)),y); The output ...
1
vote
2answers
418 views

Nspire cx CAS - Laplace inverse fails

I'm trying to calculate that easy integral but I get undef. When I replaced $\infty$ with $1000$, I got the right answer. ($e^{-1000}$ is zero roughly). Although this calculator knows that ...
1
vote
1answer
96 views

MuPAD - rearrange an equation

I have a huge expression, say $f(x_1,x_2,x_3) = 0,$ and I want MuPAD to try to express $x_1 $ in terms of $x_2$ and $x_3$ Is this possible?
1
vote
1answer
80 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
110 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
136 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 & ...
1
vote
1answer
44 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 ...
1
vote
1answer
167 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
42 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
175 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
921 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
722 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) = ...
1
vote
1answer
62 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 ...
1
vote
1answer
30 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
38 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
48 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 ...
1
vote
1answer
67 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
97 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
94 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
36 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
48 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
90 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
110 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 ...
1
vote
2answers
482 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
123 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 ...
1
vote
1answer
57 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 ...
1
vote
1answer
84 views

How to test a formula online?

I have an equation I have devised, it is: $$\frac{H+O}{25}+\frac{D}{12970}+\frac{E}{363}+110 = X$$ The equation doesn't matter, I just posted it as an example. I need to be able to plug in values ...
1
vote
1answer
277 views

How to effectively compute a periodic function?

I'm writing a program to compute a value of periodic function for any arbitrary large argument: $f(k) = (\sum_{n=1}^{2^k} n)\mod\ (10^9 + 7)$, where $n,k \in \mathbb{N} $ I know that $ f(k + P) = ...