The "Request" instruction allows to have a dialog for just one input, but if I would like to have two inputs to me it seems impossible.

I'm wondering if there is any solution for this

]]>My program is suvat as in make your choice s,u,v,a,t.

I need three letters from suvat to solve a problem.

nCR(5,3) gives 10 combinations I assign to numbers 1-10.

num=seq(x,x,1,n),n

Request ("what is your number?"),n

if num[n]=n then

goto block

Every time I want to solve a problem I need to look up the block number to use.

My question: is there another way to do this kind of thing?

I'm trying to learn how to use this calculator.

`SetUpEditor ClrList L₂ Prompt A,B For(Y,A,B Y→X {1→L₁ Repeat Ans=1 2:While fPart(X/Ans Ans+1 End Ans→L₁(1+dim(L₁ X/Ans→X End If 2=dim(L₁:Then Disp Y Y→L₂(1+dim(L₂ End End If dim(L₂:L₂`

`PROGRAM:PRIME :Prompt N :{2→ L₁ :For(I,3,N,2 :If min(fpart(I/L₁ :augment(L1,{I→ L₁ :End :L₁`

This program will find all prime numbers from 2 to N. I optimized it using Ti-BASIC's list arithmetic as well as the fact that the only even prime number is two. I then revised this program to fit your specification and take a range (a,b). The result is below:

`PROGRAM:PRIME :Prompt A,B :{2→ L₁ :For(I,3,B,2 :If min(fpart(I/L₁ :augment(L₁ ,{I→ L₁ :End :SortD(L₁ :1→ I :Repeat A>L₁ (I :I+1→ I :End :I-1→ dim(L₁ :SortA(L₁ :L₁`

To make this program work, make sure that A is less than B, that A is greater than two, and that there are prime numbers between A and B. If any of these conditions are not met, the program will not function properly.

I would be happy to write some more programs for you. However, I will not accept pay.

]]>Anyone that can help me write some programs? The first one needs to be a program that shows the prime numbers between two parameter (a,b).

Got 3 more programs to write after.

Can pay (small) if someone wants to do it for me

Here is the HP Prime Code that works

n-Erlang distribution (see also Gamma and exponential)

Code:

EXPORT erlang(k,l,n)

// n-Erlang distribution k shape parameter, l=λ >=0 rate parameter

// from Gamma d.; if k=1 -> erlang(1,l,n) = exponential(l,n)

// erlang(k,λ) = gamma(k,1/λ)

BEGIN

local f;

f:=piecewise(n<0,0, l<0, 0, ((l^k)*(n^(k-1)*e^(-l*n)))/(k-1)! );

END;

EXPORT erlang2(k, m, n)

*k shape parameter, m=μ=1/λ >=0 scale parameter* if μ=2 -> chi2 with 2k degree of freedom

BEGIN

local f;

f:=piecewise(n<0,0, m<0, 0, (n^(k-1)*e^(-n/m))/((m^k)*(k-1)!));

END;

EXPORT erlang_cdf(k, l, n)

// k shape parameter, l=λ >=0 rate parameter (μ=1/λ)

BEGIN

local f;

f:= 1- sum((1/X!)*(e^(-l*n))*(l*n)^X,X,0,k-1);

END;

And this is what I tried to do for one of them for the Nspire but I am getting an Argument Error

Define erlang(k,l,n)=

Prgm

local f

f:=piecewise(n<0,0, l<0, 0, ((l^k)*(n^(k-1)*e^(-l*n)))/(k-1)! )

EndPrgm

It seems to look correct and is able to have a "Stored Success" but I feel like I'm doing something wrong. I would really like some help here.

]]>Looking for someone to help me create programs for newtons law of cooling questions and mixture problems.

Thanks.

]]>`:If d=0 :Exit`

I think you are trying to use that to exit the

Hope you can get it figured out!

]]>Hope this helps

`3/1.*2 --------- Returns --------- 6`

Out of curiosity, what calculator are you trying to do this with?

]]>`1.`

to

`1`

. but both

`round(1.,0)`

and

`int(1.)`

returns

`1.`

, not

`1`

. How I can convert Real number like 1. to an integer like 1? ]]>

`Define LibPub funvarsolv()= Prgm :Local y1,res,i,ab,d,c : :Loop :0→c :1→d :While d =1 :Try :RequestStr "enter function",y1,0,ab :0→d : :Else :© user left input box empty :Text "you entered nothing",0 :ClrErr : :EndTry :If d=0 :Exit :EndWhile :© user pressed cancel : If ab=0 Then : Disp "Press ENTER to end" : subrtine\delay() : DelVar y1,i,k,ab : Return : :EndIf : : : : expr("Define y1(x) ="&y1) : res:=exp▶list(solve(y1(x)=0,x),x) : :Disp "Solution set: "&var&" =",res : :subrtine\dlay() :If k="esc" Then :1→c :ElseIf k="enter" Then :0→c :EndIf :If c=1 :Exit :EndLoop :EndPrgm`

]]>
1)Set the unknowns as the variables.

2)Determine the objective function.

3)Write the constraints.

4)Convert to a system of equations with slack variables.

5)Write the Initial Simplex Tableau

6)Find the pivot column-Most negative entry in the last row-If there is a tie, use the column furthest to the left

7)Find the pivot row-Smallest nonnegative ratio of constants to pivot column entries.-If there is no nonnegative ratio, then there is no maximum.-If there is a tie, use the row closest to the top.

8)Pivot

9)Repeat until all entries in last row are nonnegative.-If there is a 0 in the bottom row of a non-basic variable, then another solution can be found using this column as another pivot column.

10)Read the solution

Does this help?

]]>Also, does this help?

]]>