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
vote
0answers
18 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
44 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
222 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
36 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
41 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 ...
2
votes
1answer
97 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 ...
2
votes
0answers
34 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 ...
5
votes
2answers
43 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
56 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
25 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 ...
1
vote
2answers
48 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
47 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
26 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
19 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
78 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
51 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 ...
6
votes
1answer
547 views

Semidirect Products with GAP

I'm wondering how to specify to GAP which homomorphism to use when constructing a semidirect product. I'm trying to have it construct $\left(\mathbb{Z}_p\times\mathbb{Z}_p\right)\rtimes_\varphi S_3$. ...
3
votes
1answer
164 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.
3
votes
3answers
191 views

Cornacchia's Algorithm

Can any one give the representation for a prime number 9444732965601851473921 as $x^2+15y^2$. I tried cubic cornacchia algorithm in nzmath implemented through python, but in vain. I also tried ...
2
votes
2answers
85 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 ...
0
votes
0answers
10 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
46 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
48 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
1answer
65 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
2answers
33 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 ...
3
votes
0answers
47 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
49 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
28 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 ...
8
votes
1answer
197 views

Modular subgroup lattice in GAP

I want to know if one can ask GAP to decide whether the subgroup lattice of a specific finite group $G$ is modular, via a simple command. Many thanks. Update: relevant questions have been addressed ...
14
votes
9answers
4k views

What are some good iPhone/iPod Touch/iPad Apps for mathematicians?

There are lots of good apps for teaching mathematics to children but I would like to learn about apps for undergraduate/graduate/research levels. Helper questions Any algebra system (like ...
1
vote
1answer
41 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 ...
1
vote
1answer
36 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
0answers
36 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
60 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 ...
0
votes
1answer
46 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
37 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
1answer
94 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
109 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 ...
1
vote
0answers
75 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
1answer
66 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
0answers
57 views

Why are these CAS calculated integrals equal

I let Wolfram evaluate this integral: $$\int\frac{-2\sin(x)\cos(x)}{2\cos^2(x)+\cos(x)-1}dx$$ 1st result from WolframAlpha online was $$\frac43 \log(\cos(\frac{x}2))+\frac{1}{3\log(1-2 \cos(x))}+C$$ ...
0
votes
0answers
31 views

Graded piece of ring in Macaulay2

I apologize for the basic question, but I couldn't figure how to do this. I'm looking at the homogenous ring $R = QQ[w,x,y,z]$, I take $I = ideal(w*z-x*y)$ and $S=R/I$. Then I construct some ideal $J$ ...
0
votes
1answer
52 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
61 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 ...
2
votes
3answers
153 views

Simplifying expressions

I have a polynomial ring $R=k[x,y,z...]$ and a given ideal $I$ (defined by given generators) and several polynomials $f_1,f_2,...$ in the ring. I also have several other elements of $R$ given as ...
0
votes
1answer
61 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
49 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
45 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 ...