Does Maple have a command for return true or false when querying set membership of an element?

I have sets of random integers, Stuff[k], indexed by k, for example

Stuff[9]:={2,5,6}:

I need to be able to test if

7 is a member of Stuff[9]: // I should get false

5 is a member of Stuff[9]: // I should get true

There is no such set membership function listed in the Help menu.

I finally figured out a for loop for sequentially removing one set from another (set-theoretic subtraction).

First of all: I'm so sorry, I posted my question to a wrong place ( into the poll).

So I copy here the question and the answer of jakubi and my reply to jakubi.

**Question**:

I would like to solve the following system

x*(2*sin(x)*y^2+x^3*cos(x)+x*cos(x)*y^2) = y*(2*sin(y)*x^2+y*cos(y)*x^2+y^3*cos(y)),

-x*sin(x) = y*sin(y);

Until I have founded only the solutions

x = k*Pi, y = +/- k*Pi; k is any integer.

**jakubi**'s answer:

more solutions

Hello,

I'm having a bit of difficulty with the function "eval" I would like it to perform a full evaluation of an expression, but it does not appear to be doing this. When I try to explicitly pass it a value for the evaluation level it doesn't appear to take the integer input, the only way I can get it to work is to nest calls to eval ...[ie eval(eval(exp))]. Below is the code giving me the problem, the problem occurs on the last line...any suggestions would be appreciated

Thank you.

__I am trying to write a program that contains multiple subroutine calls. I understand the placement of the single for-do loop to call the "lowest value" subroutine.__

__Here is program.__

Hi,

I am trying to generate a non-singular Matrix.

> KeyMatrix:=Mod(127,RandomMatrix(n),integer);

> if Determinant(127,KeyMatrix)=0 then

> Return(KeyMatrix);

> fi;

Basically, it asks Maple to return to

KeyMatrix:=Mod(127,RandomMatrix(n),integer);

again if the current one if not invertible.

however, i have confused myself with RETURN and return

which is should i use?

thanks

casper

Here is a strange behavior. I can understand that an integer and its float could be considered different, but the behavior should be the same in or out of a list. In addition it should not depend on the number of trailing zeros. In addition it should not depend on whether the integer is zero or not.

Recently I came across a page that was working with ifactor and it seems op now handles the operations a bit different now.

ifactor(3^43+1);

(2) (82064241848634269407)

a:=op(2,%):

ifactor(3^41+1);

(2)(270547105429567)(33703)

b:=op(2,%):

c:=a*b;

(82064241848634269407) (271547105429567)

I have a fairly easy question but I am new to Maple and can't seem to figure it out w/ Maple help or anyone online resources. The problem is list all pairs of integers between 100 and 110 that are relatively prime. (I think) I can make it work by doing:

for k from 100 by 1 to 110 do gcd(k, 100), gcd(k, 101) . . . ; end do

but what if the problem had said pairs of integers from 100 to 1000? I don't understand how to iterate this function for more than one variable. Any help would be appreciated.

AUTHOR: Fereydoon Shekofte
v := ImportMatrix("F:\\xyz.txt", source = delimited, delimiter = " ", format = rectangular, datatype = float[4], transpose = false, skiplines = 0)
c := ImportMatrix("F:\\face.txt", source = delimited, delimiter = " ", format = rectangular, datatype = integer[4], transpose = false, skiplines = 0)
MatrixOptions(mi("format"), 'order = C_order'); mi("format")
f := Array(ArrayTools[Reshape](c[1 .. 3864], 1288, 3), order = C_order)
plots[pointplot3d](v)
p := Array([seq(geom3d[point](p || i, v[i, 1], v[i, 2], v[i, 3]), i = 1 .. 1063)])

I have been working on a problem related to and using the famous Hadamard-Weierstrass Factorization Theorem (HWFT) for representing an entire function, E(z), with pre-defined zeroes, a(n), which go off to infinity. From HWFT one can represent any meromorphic function with pre-defined poles and zeroes as the ratio of two entire functions.

I am not interested in creating an entire function, but a function F(z) analytic on a disk centered at a pre-defined point such that the analytic continuation, A(z), of F(z) equals pre-defined values

Hi,

I was reading the manual for Maple 13 and playing with some commands.

There is an equation: **sin(x)=cos(x)** and you can solve it by the **solve** command.

If you want all solutions, you just put there **AllSolutions** attribute and you get

**(1/4)*Pi+Pi*_Z1~**

I wonder why there is a tilde (~) behind "_Z1", because each integer satisfies

the equation (there is no need for an assumption).

Is it possible to compute possible addition chains for an integer in maple ??

If not, is there ANY software that will do it ??

It looks like, choosing a public key exponent with a smaller addition chain makes RSA decryption more efficient .. but how to know whether or not your exponent has a small addition chain!

Call me stupid but I still wasn't able to run the simple example in the maple help (see http://www.maplesoft.com/support/help/view.aspx?path=Define_external ) regarding calling external, precompiled Code (in my Case: c++).

How can I write a Maple program (using if..else) to find the first positive integer n (between 1 and 355)such that 355 can divide n*m (m is an integer, say 199) ? Thanks for your help.