Rewrite the code that counts the number of primes less than using an if-then statement.  Implement    your code where j goes from 2 to 15.

j:=1;
                               1
for i from 2 to 10
while ithprime(j)<2^i do
j:=j+1
end:
print(2^i,primes=j-1):
                        2048, primes = 9

I need to edit this code to satisfy a IF then Statement. can any one help me out?

\

regards "Geordi"

I have a rational function

R(s)=(s+21.2618806754099918582959684287)*(s+11.5825785765671047665686926962)*(s+2.32652929385663964079968631791)*(s+1.59184930187007023058678840475)*(s+.810126597053864402120805704729)*(s+.767936478999246633196341750975)*(s+.389728032793176474756405528288)*(s+.389709386740696868210134112440)*(s+.384534001672741409749016411776)*(s+.211738661184088496193941380283)*(s+.211735400886327624028116769728)*(s+0.123260440562617421046327062708e-1)*(s+0.749282759458414677904525855939e-2)*(s+0.129947118285955895103018704133e-2)*(s+0.128454333534479589397814117349e-2)*(s+0.342482256507583139104896521750e-3)*(s+0.342471571076865824849860353286e-3)/(s+21.2618806754099918582960530179)*(s+21.1471825573992794470615428324)*(s+2.32652929385663964079964525218)*(s+2.28350165975702233286000082419)*(s+.810126597053864402120855775248)*(s+.804997206582678244211665005890)*(s+.389728032793176474755312749208)*(s+.389718248252695846631246554139)*(s+.384534001672741409750430258543)*(s+.243633167007009257956784127718)*(s+.211735400886327624028133231990)*(s+.211726934369736929202050835884)*(s+0.749282759458414677904914554540e-2)*(s+0.555247691543530827690454070563e-2)*(s+0.128454333534479589395816020810e-2)*(s+0.126961222591792792857168643430e-2)*(s+0.342471571076865824866184397991e-3)*(s+0.342461825593204099734633561207e-3)

I want to cancell the roots which are equal up to 7 digits?

How to write a maple code for this problem?

In doing multiple linear regression with Statistics:-LinearFit, how do I get or compute the values commonly called R^2 and R^2[adjusted], also known as the coefficient of determination? I know that residualsumofsquares is part of it. I also need the "total sum of squares" to compute R^2. And how do I modify that to get R^2[adjusted]? These things do not seem to be among the numerous output options to LinearFit. These values (R^2 and R^2[adjusted]) are typically part of the output of other statistics software when doing multiple regression.

I'd also like the p - values for the significance of the individual parameters and the p - value for the global utility---also things that are standardly reported by statistics software.

Hi Mapleprimes community,

I am a maple novice and was trying to write a procedure but cannot tell what my syntax error is.  I would greatly appreciate if anyone can point out what I did wrong or any improvement in the code that I can make.  Thanks

SLRrepeatedsample_pr.mw

Henry

I am trying to create a procedure that can solve integrals using the Composite Simpson's 3/8 rule. However when I test my procedure against maple's ApproximateInt I am getting the wrong results.

Here is my attempt:

restart;

f:= x -> exp(x)*sin(4*x); # function I am using

simp := proc(a, b, n)
  local h, sum, i, single:
  h := (b-a)/n:
  sum := 0:
  single := (3*h/8) * (f(a) + f(b)): # this is the end points
    for i from a+h by h to b-h do
       sum := sum + (3*h/8) * (3*f(i)):
    end do:
print(evalf(sum + single));
end proc:

simp(0,1,12);
                                                                                0.6224486445
evalf(Student:-Calculus1:-ApproximateInt(f(x), 0..1, method = simpson[3/8], partition=12));

                                                                                0.5323516717

As you can see my answer is not very close to the answer given by Maple. I am not sure why my procedure simp is wrong.

Hi all,

I tried to solve the equation f(s) and got the unknow error:

 The related file is attached.

Error.mw

I'd appreciate any help on this topic. Thank a lot.

If i use expression with function add() it runs normaly, but if I use expression with Threads:-Add (parallel implementation) it causes error "Error, continuation task already created for the current task" or "Kernel connection has been lost"

Expression:

Array(1 .. N,1 .. 1/2*N-NR-1,(i, m) -> evalf(Add(cosArr2[modp(k*i,N)]/kl[k],k = 1 .. NR+m-1)+Add(cosArr2[modp(k*i,N)]*alpha[k],k = NR+m .. 1/2*N)))

What am I doing wrong? Can I use two Add in one evalf?

Birthday_LP.mw

I am attempting to solve the following using C.Loves Logicproblem package. But i do not know how to tell it either/or constaints. being a circular arrangement might also throw a spanner in the works.

Alans Birthday Logic Problem

It is Alan’s birthday and he is having a party. Seven other people will attend: Amy, Brad, Beth, Charles, Debbie, Emily and Frances.

Everyone will sit around the circular dining table. The seating arrangement must meet the following conditions:

• Amy and Alan sit together

• Brad and Beth sit together

• Charles sits next to either Debbie or Emily

• Frances sits next to Debbie

• Amy and Alan do not sit next to either Brad or Beth

• Brad does not sit next to Charles or Frances

• Debbie and Emily do not sit next to each other

• Alan does not sit next to either Debbie or Emily

• Amy does not sit next to Charles

Arrange the guests around the table to meet all of the conditions listed above.

restart:

Vars:= [Name,PN]:

Name:= [Alan,Amy, Brad, Beth, Charles, Debbie, Emily,Frances]:

PN:=[$1..8]:

Cons:= [NextTo(Amy,Alan,PN),NextTo(Brad,Beth,PN),NextTo(Charles,Debbie,PN),NextTo(Charl es,Emily,PN),NextTo(Frances,Debbie,PN),Rel(NotNextTo,Amy,Brad,PN),Rel(NotNextTo, Amy,Beth,PN),Rel(NotNextTo,Alan,Brad,PN),Rel(NotNextTo,Alan,Beth,PN),Rel(NotNext To,Brad,Charles,PN),Rel(NotNextTo,Brad,Frances,PN),

Rel(NotNextTo,Debbie,Emily,PN),Rel(NotNextTo,Alan,Debbie,PN),Rel(NotNextTo,Alan,Emily,PN),

Rel(NotNextTo,Amy,Charles,PN)]:

read "LogicProblem.mpl";

Birthday:= LogicProblem(Vars):

with(Birthday):

Hello,

I would like to solve the differential equation in the following link:

http://www.utdallas.edu/~frensley/technical/nanomes91/node2.html

Without using any explicit discretization. Is it possible to solve this equation with a Maple dsolve comand and some boundary condition option?

I am continuing work with buttons and I wanted to be able to clear graphs with a button.  I understand how to communicate with the button because of other posts by members that have been very helpful.    I want the button to be able to delete the graphs that I have drawn in Plot0.

Is there a way this can happen? Or do my students just need to type a new equation in to the mathematical expression box to plot new functions?

Any help is appeciated. I could not find anything online that I could get to work. I have included the document

Nick

I'm trying to create and populate the Array `A` with a sequence of lower triangular matrices based on the following relation:

A[k+1][i,j] = a (1+k) A[k][i,j] + b ((1+j) A[k][i-1,j] - j A[k][i-1,j-1])

The rows and columns of each matrix are given by i and j; a and b are scalars. The structure of A is not important provided a matrix can be accessed for a given k. The highest k value will not be more than about 100.

The starting matrix for k=1 is

[-1  0]
[ 1 -1]

Any guidance on where to start with setting up the appropriate procedure would be greatly appreciated.

Thanks.

I have a procedure that takes an object, i.e. a module, as an argument. On grounds of the properties of that object, the procedure should return a certain map. But I hit a snag, the gist of which is along the following lines (just an example):

M := module()
   export dim;
   dim := 2;
end module:

F := proc(m::`module`)
   (x::Vector(m:-dim)) -> something
end proc:

My problem is that F(M) produces

rather than

How can I force m:-dim within F to be evaluated?

i want to solve this pde,but i do know how to write my boundary or initial conditons,actually my dependent variables were x and y, i changed x to t,since i faced an error that pde solver needs time=varname , but i could not solve my problem,do anyone know how to insert my boundary conditions ?! please help,thnx
maple.mw

I need a procedure to simplify rational functions r(x,y) = p(x,y)/q(x,y)  where p(x,y) and q(x,y) are polynomials in Z/(2)[x,y].

For example suppose r(x,y) = (1+x+y)/(x^2+x*y+y+1) then mod 2 this reduces to 1/(1+x) since 

            Factor(x^2+x*y+y+1) mod 2 = (1 + x + y) (1 + x)

I wrote a procedure to do this using Factors mod 2, but I wonder if there is a builtin procedure to make such simplifications that might be more efficient.  For now 2 variable is fine, but later I may want more than 2 variables.

Edwin