HP Prime Graphing Wireless Calculator Instrukcja Użytkownika Pobierz pdf (Strona 427)

100

101

prevprime(Integer)

Example:

prevprime(11) returns 7

Euler

Compute’s Euler's totient for an integer.

euler(Integer)

Example:

euler(6) returns 2

Integer – Division

Quotient

Returns the integer quotient of the Euclidean division of two integers.

iquo(Intgr1, Intgr2)

Example:

iquo(63, 23) returns 2

Remainder

Returns the integer remainder from the Euclidean division of two integers.

irem(Intgr1, Intgr2)

Example:

irem(63, 23) returns 17

MOD p

For the three integers a, n, and p, returns an modulo p in [0, p−1].

powmod(a, n, p,[Expr],[Var])

Example:

powmod(5,2,13) returns 12

Chinese Remainder

Integer Chinese Remainder Theorem for two equations. Takes two vectors of integers, [a p] and [b q], and

returns a vector of two integers, [r n] such that x ≡ r mod n. In this case, x is such that x ≡ a mod p and x ≡ b

mod q; also n=p*q.

ichinrem([a,p],[b,q])

Example:

ichinrem([2, 7], [3, 5]) returns [23, 35]

CAS menu 379

1 2 ... 422 423 424 425 426 427 428 429 430 431 432 ... 700 701

Komentarze do niniejszej Instrukcji

Brak uwag

HP Prime Graphing Wireless Calculator Instrukcja Użytkownika Strona 427

Komentarze do niniejszej Instrukcji

Powiązane produkty i podręczniki dla Oprogramowanie HP Prime Graphing Wireless Calculator