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

-1
votes
0answers
33 views

How to install REDUCE Computer Algebra System in Mac Os x? [closed]

I am new to mac os x, i am unable to install REDUCE Computer Algebra System in my MacBook Pro, Help me how to download and install in my mac.
0
votes
1answer
24 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
51 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 ...
0
votes
0answers
19 views

Implement using switches the following logic functions

Implement using switches the following logic functions: F(a,b,c,d)= ab + cd F(a,b,c,d)=(a + bc)d' how can i do it ? Digital System
0
votes
0answers
25 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 ...
0
votes
1answer
53 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 ...
2
votes
1answer
20 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 ...
4
votes
2answers
76 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 ...
7
votes
2answers
188 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.
1
vote
1answer
72 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.
0
votes
1answer
39 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
45 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 ...
2
votes
1answer
43 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
0answers
10 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
48 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
32 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
52 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
73 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 & ...
0
votes
1answer
46 views

How to detect carry and overflow?

Let's say that 0011 + 0111 = 1010 How to detect whether the operation generate carry and overflow?
-1
votes
2answers
29 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 ...
0
votes
0answers
50 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
vote
1answer
25 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
42 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 ...
1
vote
0answers
28 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 ...
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
45 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 ...
4
votes
2answers
169 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 ...
5
votes
2answers
53 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?
4
votes
1answer
90 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 ...
1
vote
1answer
49 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 ...
2
votes
0answers
62 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} ...
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 ...
0
votes
1answer
37 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
2answers
63 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
3answers
48 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$$ ...
2
votes
0answers
57 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 ...
0
votes
1answer
24 views

Relationship between the Carmichael function and Euler's totient function

Let $\lambda$ denote the Carmichael function and $\varphi$ Euler's totient function. Furthermore, let $p$ denote any prime number and $k\in\mathbb{N}$. The wikipedia article about $\lambda$ states: ...
0
votes
3answers
87 views

Does MAPLE not simplify correctly or am I goofing?

While attempting to answer this question with help of MAPLE, something very strange happened, at least according to me. We have the following function: $$ \phi(x,y) = ...
0
votes
1answer
54 views

What “meta-dimension” do algebraic numbers have?

actually what I am asking for is "how many ways do there exist to create a real number out of a sequence of coefficients?" there is the solution of polynomials through radicals, some polynomials can ...
3
votes
1answer
316 views

Proving $n^{97}\equiv n\text{ mod }4501770$

How do we show $$n^{97}\equiv n\text{ mod }4501770$$ for all integer $n$? First of all, I thought I could use Fermat's little theorem or Euler's theorem, but I'm not sure if they are applicable here.
0
votes
0answers
16 views

Changing the “Type” of an object in Magma

The computer algebra system Magma can store groups as one of many different types. For example, using AbelianGroup([2,2]) we obtain the Klein $4$-group stored as type GrpAb. However, we can also ...
0
votes
0answers
20 views

Why $face_w(New(f))=New(in_w(f))$?

Is there anyone who can help me with this problem? Any hint to the solution would be appreciated! Let $f\in \Bbb K[x_1,\ldots,x_n], w\in \Bbb R^n$ and $New(f)$ be the Newton polytope of $f$. Why ...
0
votes
2answers
72 views

Evaluating the real and imaginary parts of a nasty complex number

This seems like an elementary question, but I was unable to find an clear answer to it. Generally, the real and imaginary parts of a complex number comprised of radicals are not expressible by ...
1
vote
1answer
94 views

Computing 2d radially symmetric Fourier transforms (with Wolfram Alpha)

Let's assume that I "know" $\mathcal{F}\{\operatorname{circ}(r)\}(\rho)=\frac{J_1(2\pi\rho)}{\rho}$ $\mathcal{F}\{(1-r^2)\operatorname{circ}(r)\}(\rho)=\frac{J_2(2\pi\rho)}{\pi\rho^2}$ because I ...
1
vote
2answers
48 views

Boolean Expression simplification help

Hi I am new to the board. Taking a computer architecture course and I am having trouble understanding further simplification on a question I got on a previous quiz. When I type in the expression ...
1
vote
1answer
67 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
29 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 ...
3
votes
0answers
52 views

Adjoint action of a Lie algebra in MAGMA

Let's say I have a Lie algebra $L$ and an element $x$ in $L$. I need to compute $(\mathrm{ad} \ x)^n(y)$ for several values of $y$ and a particular value of $n$. I thought the best way to do this ...
1
vote
1answer
59 views

In SAGE, what function factors a polynomial whose coefficients are parameters?

In SAGE the function "factor" will factorize elementary polynomials with coefficients in $\Bbb Q$. For example: x,y = var('x,y') poly = x^3-y^2*x factor(poly) SAGE: x*(x-y)*(x+y) ...