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

0
votes
1answer
33 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
215 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
39 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
27 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
38 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
55 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
9 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
46 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
28 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
40 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
64 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
41 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
48 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
27 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
24 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
30 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
534 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 ...
1
vote
0answers
358 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
25 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
47 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
233 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
44 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
111 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
47 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
60 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
31 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
55 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
53 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
23 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
81 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
53 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
574 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
314 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
202 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
88 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
14 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
57 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
66 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
72 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
39 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
48 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
58 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
199 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
48 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 ...