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 ...

learn more… | top users | synonyms

3
votes
1answer
94 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 ...
1
vote
1answer
82 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
60 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
272 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
348 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
109 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
71 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
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.
0
votes
1answer
350 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
51 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
44 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
55 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
3answers
571 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
101 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?
5
votes
1answer
253 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
97 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
161 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
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 ...
0
votes
1answer
91 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
191 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
61 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
92 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
103 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
121 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
59 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
336 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
2answers
272 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 ...
2
votes
1answer
468 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
138 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
154 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
57 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
85 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
322 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) ...
2
votes
1answer
65 views

Symbolic computations in finite fields of unspecified order

The general setting is that I want to multiply some matrices (to many to do it by hands) over a finite field. The problem is that these matrices depend on certain parameters taken from the field and ...
2
votes
0answers
39 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
2answers
102 views

Simple algebra in a differential equation.

I have the differential equation: $$\frac{dy}{dx}=\sin (x-y).$$ Substituting $v=x-y$ and $dy=dx-dv$, I got down to the equation:$$\frac{dv}{1-\sin(v)}=dx.$$ Multiplying the LHS by $\dfrac{1+\sin ...
1
vote
1answer
60 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 ...
5
votes
2answers
367 views

How do you compute group cohomology in practice?

If you have a finite group $G$ and a finite $G$-module $K$, and you need to know $H^1(G,K)$ or $H^2(G,K)$, how do you do it? Do you use a computer algebra system? (If so, which one?) Do you use a ...
0
votes
2answers
123 views

Simplify basic expression

Please, does anyone know which tool can simplify expressions like: $$a^4 - 4a^3b + 6a^2b^2 - 4ab^3 - a + b^4$$ into: $$(a - b)^4 - a$$ I tried SymPy, Maxima and W|A without success. PS: I'm ...
2
votes
0answers
337 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 ...
3
votes
1answer
140 views

Elementary “bugs” in computer algebra systems?

There's a discussion of bugs in CAS's here, but these are technical errors of interest mainly to the professional mathematician. I am more interested in simple errors which might arise in the use of ...
0
votes
1answer
146 views

Solving an equation in charcateristic 2 in sage OR finding 3-torsion points of an elliptic curve over field with char 2

Problem: show that an elliptic curve over a field of char 2 has nontrivial 3-torsion points Method: I used SAGE to unwind the duplication formula for an elliptic curve given in short Weierstrass form ...
1
vote
1answer
140 views

Silverman exercise 3.1 proving that two polynomials are relatively prime iff the discriminant is non-zero

Silverman, p. 104: Show that the polynomials $$f=x^4−b_4x^2−2b_6x−b8 \qquad \text{and}\qquad g=4x^3+b_2x^2+2b_4x+b_6$$ appearing in the duplication formula (III.2.3d) are relatively prime if ...
1
vote
1answer
226 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 ...
0
votes
1answer
76 views

How to get 2 percentages to a 100%

First of im new to this site and I've never been the sharpest at math, im a web developer by trade. My question is math related but ill just give you a quick background about my website so that you ...
2
votes
1answer
83 views

What are elementary field extensions?

While reading about symbolic integration I encountered some concepts of Differential Algebra. I do not know much of D.A and Fields in general also I have encountered as an extension of Rings. I ...
1
vote
1answer
243 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
289 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
92 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. ...
0
votes
2answers
146 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 ...