What Khan-specific js functions exist?

Non-exhaustive overview of useful functions that can be used anywhere in JavaScript:

Random functions:

• rand(n): Random integer >= 0 and < n
• randRange(min,max): Random integer between min and max inclusive
• randRangeExclude(min,max,excludes): Like randRange, but not the numbers in excludes
• randRangeNonZero(min,max): Like randRange, but not zero
• randRangeUnique(min,max,n): Like randRange, but n different numbers
• randRangeUniqueNonZero(min,max,n): Like randRangeUnique but not zero
• randFromArray(array): Random selection from array
• randFromArrayExclude(array,excludes): Like randFromArray, but not the numbers in excludes
• getPrime(): Random prime number between 2 and 97
• shuffle(array,n): Shuffle array and pull n entries

Math functions

Return values are numbers or arrays of numbers:

• digits(n): Digits of a non-negative integer as an array (low digits first)
• integerToDigits(n): Like digits(n), but reverse order
• decimalDigits(x): Digits of a decimal number (low digits first)
• decimalPlaces(x): Number of decimal places after the decimal
• digitsToInteger(digits): Creates whole numbers from digits (high digits first)
• roundTowardsZero(x): Rounds towards zero
• roundToNearest(increment,x): Round to nearest multiple of increment
• roundTo(n,x): Round to n digits
• floorTo(n,x): Same as roundTo, but with rounding down
• ceilTo(n,x): Same as roundTo, but with rounding up
• factorial(n): Factorial
• SplitRadical(n): Factors out as much as possible from a square root, prefactor and radicand are returned as an array
• splitCube(n): Like splitRadical, but with cubic root
• getGCD(a,b): Largest common divisor
• LCM(a,b): Least common multiple
• reduce(denominator,numerator): Returns the truncated fraction as an array
• getPrimeFactorization(n): Prime factorization as array
• toFraction(x,tolerance): Convert decimal number to array of numerator and denominator, given tolerance
• sortNumbers(array): Sort numbers

Test functions

Return values are bools:

• isPrime(n): Test whether n is prime
• isInt(x): Test whether x is an integer
• isOdd(n): Test whether n is odd
• isEven(n): Test whether n is even

Print functions

Return values are strings or arrays of strings:

• negParens(x): Put x in brackets if negative
• roundToApprox(x,n): Round to n digits exactly, convert to string and write \approx in front of it, if rounded
• fractionReduce(denominator,numerator,small=false,parens=false): Fraction to LaTeX fraction; optional parameters small and parens determine whether the fraction should be written small or with brackets (if negative)
• fraction(denominator,numerator,defraction,reduce,small,parens): Fraction to LaTeX fraction; small and parens as above, reduce controls whether to shorten, defraction controls whether special cases such as n/0, n/1 and 0/d are output in a specially simplified form
• polarForm(r,theta,eulerForm): Formats complex number in polar form (as exponential if eulerForm is true, otherwise with cis)
• complexNumber(re,im): Write complex number
• complexFraction(re,reDenominator,im,imDenominator): Write complex fraction
• scientific(precision,x): Scientific notation