HP Prime Graphing Wireless Calculator Manual de usuario Pagina 426

  • Descarga
  • Añadir a mis manuales
  • Imprimir
  • Pagina
    / 701
  • Tabla de contenidos
  • SOLUCIÓN DE PROBLEMAS
  • MARCADORES
  • Valorado. / 5. Basado en revisión del cliente
Vista de pagina 425
or
ifactors({Intgr1, Intgr2,…})
Example:
ifactors(150) returns [2, 1, 3, 1, 5, 2]
GCD
Returns the greatest common divisor of two or more integers.
gcd(Intgr1, Intgr2,…)
Example:
gcd(32,120,636) returns 4
LCM
Returns the least common multiple of two or more integers.
lcm(Intgr1, Intgr2,…)
Example:
lcm(6,4) returns 12
Integer – Prime
Test if Prime
Tests whether or not a given integer is a prime number.
isPrime(Integer)
Example:
isPrime(19999) returns false
Nth Prime
Returns the nth prime number.
ithprime(Intg(n)) where n is between 1 and 200,000
Example:
ithprime(5) returns 11
Next Prime
Returns the next prime or pseudo-prime after an integer.
nextprime(Integer)
Example:
nextprime(11) returns 13
Previous Prime
Returns the prime or pseudo-prime number closest to but smaller than an integer.
378 Chapter 22 Functions and commands
Vista de pagina 425
1 2 ... 421 422 423 424 425 426 427 428 429 430 431 ... 700 701

Comentarios a estos manuales

Sin comentarios