Items tagged with integer

Since it is not possible for me to reply directly in that new Maple Primes:
I branched. Feel free to re-join for a reasonable structure. What a mess.


I am rusty on such (may be it is 'obvious' via Lie theory). Your group is just the
group of invertible matrices over the integers (this follows from algebra). And as

   Let GL(2,Z) be the  group of all the matrices of dimension 2 over the integers with the determinant equal to +/-1.
   A matrix M in GL(2,Z) is called primitive if M is not equal to K^n for any K in GL(2,Z) and any positive integer n >= 2.
   Is the matrix M:= Matrix([[27,5],[11,2]]) primitive? How to determine it in Maple?

Edit. GL(2,Z) instead of UL(2,Z).

Dear friends,

I am reporting with a brief comment concerning the integral int(1/(1+x^a), x=0..infinity) with a>=2 a real number. This was evaluated here.

Now Maple 15 (X86 64 LINUX) will quite happily compute this in its most simple form involving the sine when a is not a positive integer or a rational number. If it is, however, a beta function term results,...

Dear friends,

this is to share with you what a joy it was to work with Maple on the problem of enumerating non-isomorphic graphs. This problem goes back to Polya and Harary and it is a beautiful example of Polya counting, while also being of notable simplicity, so that a high school student or an undergraduate can follow it easily.

I have worked on this problem over the years, adapting my solutions in Cocoa and Lisp as I gained insights. My first attempt used...

I want to find a triangle with the vertices A(x1, y1, z1), B(x2, y2, z2), C(x3, y3, z3) knowing that the point G(1,1,1) is centroid of the triagle ABC and x1, y1, z1, x2, y2, z2, x3, y3, z3 are integer numbers, but I can not find. How do I tell Maple to do that? 

Fine a_{n} of sequence

Hello, I have a set of equations, and I want to solve it over the integers (mod 13). But msolve command fails. Here is my code:

eq:={a4*a1-11, a4*a2-12, a4*a3-6, a5*a1-3, a5*a2-8, a5*a3-4, a6*a1-2, a6*a2-1, a6*a3-7};

It fails, but I can solve it manually. Here is a solution:

a4*a1 = 11 => a4:=1 and a1:=11

a4*a2 = 12 => a2:=12

a4*a3 = 6 => a3:=6

a5*a1 = 3 => a5:=3/11 mod 13 = 5

a5*a2 = 8 => a2:=8/5 mod 13 = 12

Fine $a_{n}$ of sequence  2 , 3 , 6 , 7 , 10 , 11 , 14 , 15,...

Hi All, I have the following procedure to compute the gcd between two integers:

Egcd := proc(a, b)
while b != 0 do
temp := b;
b := a mod b;
a := temp;
return a;  
end proc;

Why does it simply return the value of a when the function was called? (i.e my statements inside the procedure do nothing

I created a triangle whose length of the medians are integral numbers. Please comment to me about my code.

> resrart:




for x1 from -N to N do

for y1 from x1 to N do

for z1 from y1 to N do

for x2 from -N to N do

for y2 from -N to N do

In geom3d, how can i make a triangle which coordinates of the center circle circumscribed triangle are integer numbers? Please help me. Thank you.

What is the next two terms for this pattern...

1, -2, 2, -4, 0, ...

Suppose I have a matrix M, with rational entries. I need to go row by row and scale each individually by the smallest possible integer such that the entries in each row are integer-valued - anyone have an easy way to do this? It's a large matrix.

We have 1^2 + 2^2 +2^2 = 3^2; 2^2 + 3^2 + 6^2 = 7^2; 2^2 + 10^2 +11^2 = 15^2. Please write for me a command solve the equation a^2 + b^2 + c^2 = d^2, where, a, b, c, d are integer numbers, and d <=100. Thank you very much.

Dear friends, I encounter the following problem. Let k and i be two given positive integers such that k>=2i>=4. How to find all nonnegative integers tuples (x_1, x_2, ..., x_i) such that k-2i<=x_1+2x_2+...+ix_i<=k-i? The buildin command "isolve" seems not work. Thanks.

1 2 3 4 5 6 7 Last Page 3 of 23