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

39
votes
14answers
3k views

'Linux' math program with interactive terminal?

Are there any open source math programs out there that have an interactive terminal and that work on linux? So for example you could enter two matrices and specify an operation such as multiply and ...
0
votes
1answer
51 views

Any algorithm or theorem to decide whether two functions are equivalent? [duplicate]

Any algorithm or theorem to decide whether two functions that are polynomials,rationals and analytic over $\mathbb{N}$ or $\mathbb{Q}$ or $\mathbb{R}$ or $\mathbb{C}$ are equivalent ?
2
votes
1answer
21 views

MuPAD - complicated solve() solutions

I am trying to solve an equation for one variable as shown in the picture: Judging from the output of the second command, I should be able to get an expression for $\ddot{\theta}$. I tried ...
1
vote
1answer
21 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
2answers
65 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 ...
0
votes
0answers
16 views

defining an upper bound for n-tuple

Let we have $n-tuple ~~like ~ a=(a_1,...a_n) \in N_0^n ~and ~every ~a_j < (2^{m_j} -1). $ and let suppose we have another n-tuple like $b:=(b_1,...,b_n)$ such that $ b_i \leq (2^{m_j} -1)$. I ...
1
vote
1answer
24 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
0answers
18 views

Improvement of Buchberger's Algorithm (second part)

Suppose $S_j$ is a homogeneous syzygy of multidegree $\gamma_j$ in $S(G)$, where $G=\{g_1,\dots,g_t\}$. Show that $S_j G=\Sigma_{i=1}^{t} c_ix^{\alpha(i)}g_i$ has multidegree $< \gamma_j$. Now, I ...
0
votes
0answers
24 views

Improvement of Buchberger's Algorithm

1) Let $S(F)$ be the subset of $(k[x_1,\dots,x_n])^s$ consisting of all syzygies on the leading terms of $F=\{f_1,\dots,f_s\}$. Then every element of $S(F)$ can be written uniquely as a sum of ...
0
votes
0answers
56 views

using wolfram alpha to solve a system of nonlinear differential equations

Will Wolfram Alpha solve a system of nonlinear differential equations with initial values and graph the solutions? Essentially, I want to hand Wolfram a first-order system with variables x_1, x_2, ...
1
vote
2answers
147 views

Galois group command for Magma online calculator?

I need to test if a family of 7th deg and 13 deg equations are solvable. I'm new to Magma, so my apologies, but what would I type in, http://magma.maths.usyd.edu.au/calc/ to determine the Galois ...
25
votes
23answers
1k views

Can you recommend a decent online or software calculator?

I'm looking for an online or software calculator that can show me the history of items I typed in, much like an expensive Ti calculator. Can you recommend any?
3
votes
2answers
301 views

Learning to use MAGMA

I'm trying to learn to use MAGMA for research in group theory, but it's been slow going. I've been using the MAGMA handbook provided online, but it's rather hard to learn with. I feel like it's hard ...
0
votes
1answer
26 views

Decomposition of a polynomial over generators of an ideal

Let $f$ be a polynomial in six variables, say, over complex numbers, and $l_1$, $l_2$ are some linear forms in the same variables. If I know that polynomial $f$ belong to the ideal generated by $l_1$ ...
2
votes
0answers
55 views

Algorithm to reduce expressions to canonical form

I'm writing a small computer algebra system that only knows rational numbers and all expressions that you can get from them by using basic arithmetic operations and powers. So the expressions are ...
3
votes
1answer
140 views

How do I substitute a value into a polynomial in GAP?

Question: How do I substitute a value into a polynomial in GAP? So, if I start off with the following: x:=Indeterminate(Integers,"x"); f:=x^2+3; I have $f$ ...
4
votes
2answers
187 views

The J programming language: is it useful for mathematics?

I just stumbled upon the J programming language, which has the description: J is particularly strong in the mathematical, statistical, and logical analysis of data. It is a powerful tool in ...
0
votes
1answer
56 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 ...
0
votes
0answers
28 views

Question about multiple solutions to a polynomial

Assume that $f(X,Y,Z,V,W)\in \mathbb{Z}[X,Y,Z,V,W]$ is some polynomial and assume that $f(x,y,z,v,w)=0$. I would like to know if there is some way to figure out if there are non-trivial constants in ...
7
votes
2answers
207 views

What is the closed form of $\sum _{n=1}^{\infty }{\frac { {{\it J}_{0}\left(n\right)} ^2}{{n}^4}}$?

Using Maple I am obtaining the numerical approximation $$0.5902373619$$ Please, let me know what is the closed form. Many thanks.
2
votes
1answer
22 views

Computing intersection of vector spaces spanned by two lists

Assume that I'm given two lists of vectors $l_1$ and $l_2$, where all the vectors have equal dimension. I want to compute a basis for the intersection of their spans. What is the easiest setup for ...
2
votes
1answer
74 views

What is the closed form of $\sum _{n=1}^{\infty }{\frac { {{\rm J_{0}}\left(2\,n\right)} ^{2}}{{n}^{2}}}$?

Using Maple I am obtaining $$\sum _{n=1}^{\infty }{\frac { {{\rm J_0}\left(2\,n\right)} ^{2}}{{n}^{2}}} = 0.09845497463 $$ Please check it. Many thanks.
4
votes
2answers
79 views

There is a closed form for $\sum _{n=1}^{\infty }{\frac {{{\it J}_{0}\left(\,\alpha\,n\right)} {{\it J}_{0}\left(\,\beta\,n\right)}}{{n}^{2}}}$?

Using the method showed here proposed by Olivier Oloa with simplifications proposed by Anastasiya-Romanova, it is possible to prove that $$\sum _{n=1}^{\infty }{\frac {{{\it ...
0
votes
1answer
43 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 ...
2
votes
2answers
222 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
1answer
47 views

Division by factorized polynomials in Macaulay2

I have this problem dividing by factorized polynomials, for example (x_1^4-x_2^4)//(factor(x_1^2-x_2^2)) does not work because the numerator is of "class R" (R is the ring kk[x_1..x_n]) and the ...
0
votes
1answer
49 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 ...
3
votes
1answer
51 views

Square-free factorization of polynomials over finite fields

For any $f\in\mathbb{F}_q[X]$, I want to derive an algorithm which computes a factorization $$f=\prod_{i=1}^kf_i^i\tag{1}$$ with square-free polynomials $f_i$. My Ideas: If $f'=0$, we're done ...
4
votes
1answer
98 views

Computer Algebra Systems for Experimental Mathematics (especially Integer Relations with PSLQ)

I would like to use a computer algebra system to do some experimental mathematics, particularly Integer Relation problems using the PSLQ algorithm. I know that Maple has a PSLQ implementation, but ...
0
votes
0answers
13 views

Gram-Schmidt-procedure with PARI/GP

Can the Gram-Schmidt-procedure to find an orthogonal basis of a vector space spanned by given linear independent vectors be easily done in PARI /GP or do I have to program the procedure ?
1
vote
1answer
52 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 ...
0
votes
1answer
36 views

CAS expression - Solve equations with $\sum$ and $\infty$

Can a TI89 or other CAS calculators solve this? I tried it on my classpad 330 did not work solve for p $$p = \sum_{j=0}^\infty p^j \frac{2^je^{-2}}{j!}$$ solve for p $$p = \lim_{z \to \infty} ...
1
vote
1answer
60 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
87 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
52 views

How to detect carry and overflow?

Let's say that 0011 + 0111 = 1010 How to detect whether the operation generate carry and overflow?
0
votes
0answers
53 views

Can a Computer Algebra System 'experiment' with expressions?

I have recently been reading about software for symbolic manipulation, and I can see its use as a tool for performing large calculations that would be unfeasible otherwise. Given that these systems ...
-1
votes
2answers
33 views

how to solve two's complement question?

i tried 9 D + (-10 D) 9= 0000 1001 10= 0000 1010 Reverse 10 = 1111 0101 and add 1 become 1111 0110 after that add up 9 D + (-10 D) == 0000 1001 + 1111 0110 but the answer is equal to 1111 1111 ...
1
vote
1answer
28 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.
0
votes
1answer
52 views

Marking the roots of a quadratic function in Scilab

I have 2D plotted a simple quadratic function in Scilab and now have to mark the roots with an X. Is there any simple way of doing that? I have written a function that calculates the roots and ...
5
votes
3answers
621 views

What free software can I use to solve a system of linear equations containing an unknown?

Question: What free software can I use to solve a system of linear equations $M\mathbf{x}=\mathbf{y}$ where the entries of $\mathbf{y}$ vary with an unknown quantity $n$? Presumably I could do ...
2
votes
0answers
422 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 ...
1
vote
0answers
30 views

Recent benchmarks of CAS programs? (HNF, Groebner)

I've been trying to find recent benchmarks of CAS systems for computing the Hermite Normal Form as well as Groebner basis over both $\mathbb{Q}$ and $\mathbb{C}$. I've been unable to find anything ...
1
vote
1answer
58 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 ...
0
votes
1answer
257 views

Solving a nonlinear equation for one of variables with the help of a computer algebra system

Are there any solutions out there that can take a wide variety of equations with variables, like the one below, and transpose or isolate variables to other sides of the equation automatically? For ...
0
votes
0answers
38 views

How to reduce a graph via decomposition?

Is there a Java / C# library that can be used to reduce a graph via decomposition? Or could someone point me to a good tutorial where I can learn all these? E.g.
1
vote
1answer
46 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 ...
5
votes
2answers
62 views

Analogue of Fermat's primality test for polynomials and irreducibility

We've got Fermat's primality test to test if a number is probable prime. Is there an analogous test for polynomials in $\mathbb{F}_{p^n}[X]$ and irreducibility?
2
votes
0answers
65 views

How to solve this complicated differential equation?

I need to know how to solve this complicated differential equation in $z$ either analytically or numerically : \begin{eqnarray} \frac{dx_1}{dz} &=& -ib_1x_1 - ikx_2 \\ \frac{dx_2}{dz} ...
0
votes
1answer
43 views

Risch differential equation algorithm by Bronstein

I was implementing the algorithm by Manuel Bronstein for solving the Risch differential equation. My question is: What does Bronstein mean by "Order" in the algorithm poly_DE (exponential case, ...
1
vote
1answer
42 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 ...