Subject

Mathematics

Programs for compulsory and university mathematics.

155 programs
Filter by topic

Topics and programs

  1. 001

    Rounding to a Given Place

    Round a number to any place: decimal places, significant figures or the nearest whole number.

    • Approximation and bounds
    • 19 bytes
    • COMP mode
    • Free
  2. 002

    Checking Several Approximation Claims for One Number

    Checks options that approximate one number to decimal places or significant figures, including trailing zeros.

    • Approximation and bounds
    • 212 bytes
    • COMP mode
    • Free
  3. 003

    Range of the True Value after Rounding

    From a value rounded to the nearest unit, find the lower and upper bounds of the true value.

    • Approximation and bounds
    • 59 bytes
    • COMP mode
    • Free
  4. 004

    Range of a Value Rounded Down

    From a value rounded down to a unit, find the lower and upper bounds of the actual value.

    • Approximation and bounds
    • 53 bytes
    • COMP mode
    • Free
  5. 005

    Bounds of the True Value from a Recorded Value

    Bounds of a true value for rounding, significant figures at a power of ten, or values cut down.

    • Approximation and bounds
    • 33 bytes
    • COMP mode
    • Free
  6. 006

    Rectangle Area Bounds

    Rectangle Area Bounds

    • Approximation and bounds
    • 87 bytes
    • COMP mode
    • Free
  7. 007

    Right-angle pentagon area bounds

    Right-angle pentagon area bounds · L,U

    • Approximation and bounds
    • 151 bytes
    • COMP mode
    • Paid
  8. 008

    Rectangle with a notch area bounds

    Rectangle with a notch area bounds · L,U

    • Approximation and bounds
    • 140 bytes
    • COMP mode
    • Free
  9. 009

    Perimeter bounds and percentage error

    Perimeter bounds and percentage error

    • Approximation and bounds
    • 98 bytes
    • COMP mode
    • Free
  10. 010

    Maximum integer under a strict bound

    Maximum integer under a strict bound · n

    • Approximation and bounds
    • 21 bytes
    • COMP mode
    • Free
  11. 011

    Maximum count from measurement bounds

    Maximum count from measurement bounds · n

    • Approximation and bounds
    • 151 bytes
    • COMP mode
    • Paid
  12. 012

    Splitting a Measured Amount: Possible Numbers of Parts

    From a measured total and a measured part size, find the least and greatest possible number of parts.

    • Approximation and bounds
    • 74 bytes
    • COMP mode
    • Paid
  13. 013

    Mixture Ratios and Unknown Unit Price

    Mixture Ratios and Unknown Unit Price

    • Rates and ratios
    • 158 bytes
    • COMP mode
    • Free
  14. 014

    Successive Percentage Changes and the Original Value

    Combine up to three successive percentage changes, then find the final value or the original value.

    • Applications of percentages
    • 88 bytes
    • COMP mode
    • Free
  15. 015

    Mark-up, Discount, Profit and Cost

    From a mark-up and a discount, find the actual profit percentage, the cost and the selling price.

    • Applications of percentages
    • 74 bytes
    • COMP mode
    • Free
  16. 016

    Profit and Loss over Two Sales

    From two selling prices and their profit or loss percentages, find the overall profit or loss and its percentage.

    • Applications of percentages
    • 45 bytes
    • COMP mode
    • Free
  17. 017

    Group Percentages and Weighted Means

    Combine two groups’ percentages or means, find an unknown group’s value, or the ratio of the groups.

    • Applications of percentages
    • 152 bytes
    • COMP mode
    • Free
  18. 018

    Compound Interest: Amount and Interest

    From the principal, annual rate, compounding per year and years, find the amount and the interest.

    • Applications of percentages
    • 38 bytes
    • COMP mode
    • Free
  19. 019

    Annuity Future Value and Periodic Payment

    Annuity Future Value and Periodic Payment

    • Applications of percentages
    • 189 bytes
    • COMP mode
    • Paid
  20. 020

    Converting a Number in Another Base to Decimal

    Convert a short binary, hexadecimal or other-base number to decimal, one digit at a time.

    • Number bases
    • 30 bytes
    • COMP mode
    • Free
  21. 021

    Long Whole Numbers in Another Base, Digit by Digit

    Convert a whole number to base 2–16, one digit per screen, from the highest place down.

    • Number bases
    • 58 bytes
    • BASE mode
    • Free
  22. 022

    Power term base conversion

    Power term base conversion · p₁,d₁,p₂,d₂,…

    • Number bases
    • 104 bytes
    • COMP mode
    • Free
  23. 023

    Carrying and Borrowing Column by Column

    Turn column coefficients into proper digits in any base by carrying and borrowing; it also converts a decimal whole number.

    • Number bases
    • 92 bytes
    • COMP mode
    • Free
  24. 024

    Unknown Coefficients in a Quadratic Identity

    From the coefficient conditions of an identity, find two unknown constants and check the remaining condition.

    • Algebra
    • 119 bytes
    • COMP mode
    • Free
  25. 025

    Monomial HCF and LCM

    Monomial HCF and LCM

    • Algebra
    • 197 bytes
    • COMP mode
    • Free
  26. 026

    Find the third monomial from HCF and LCM

    Find the third monomial from HCF and LCM · A:0/1,B:0/1,C:0/1,D:0/1

    • Algebra
    • 372 bytes
    • REG Lin mode
    • Paid
  27. 027

    Roots and Discriminant of a Quadratic Equation

    Roots of ax² + bx + c = 0 with the discriminant, a status code and a warning for nearly repeated roots.

    • Algebra
    • 204 bytes
    • COMP mode
    • Free
  28. 028

    Finding the Parameter for a Repeated Root

    Finds every real k for which x² + kx + pk + q = 0 has a repeated root, with the root for each k.

    • Algebra
    • 162 bytes
    • COMP mode
    • Paid
  29. 029

    Symmetric Expressions in the Roots of a Quadratic

    Sum, product, sum of squares and a shifted product of the roots of a quadratic, without finding the roots.

    • Algebra
    • 55 bytes
    • COMP mode
    • Free
  30. 030

    Reducing an Expression in a Root of a Quadratic

    Use aβ² + bβ + c = 0 to rewrite uβ² + vβ + w as Lβ + M without finding β.

    • Algebra
    • 56 bytes
    • COMP mode
    • Paid
  31. 031

    Powers of i and Sums of Powers of i

    Real and imaginary parts of powers of i and of sums of consecutive or weighted powers of i.

    • Algebra
    • 181 bytes
    • COMP mode
    • Free
  32. 032

    Linear Parameters from Complex Conditions

    Linear Parameters from Complex Conditions

    • Algebra
    • 199 bytes
    • COMP mode
    • Paid
  33. 033

    Graph Features of a Quadratic Function

    Opening, vertex, axis of symmetry, extreme value, y-intercept and real roots of y = ax² + bx + c.

    • Algebra
    • 138 bytes
    • COMP mode
    • Free
  34. 034

    Quadratic Coefficients from Two Points of Equal Height

    Finds b, c and the axis of a quadratic from a and two points of equal height.

    • Algebra
    • 53 bytes
    • COMP mode
    • Free
  35. 035

    Greatest and Least Values of a Quadratic on a Closed Interval

    Maximum and minimum of ax² + bx + c on L ≤ x ≤ U, with every x where each is reached.

    • Algebra
    • 136 bytes
    • COMP mode
    • Paid
  36. 036

    Comparing Huge Powers

    Find the largest or smallest of several huge powers with logarithms, handling signs and near ties.

    • Indices and logarithms
    • 200 bytes
    • COMP mode
    • Free
  37. 037

    Polynomial remainder for a linear divisor

    Polynomial remainder for a linear divisor · x₀,R

    • Polynomials
    • 56 bytes
    • COMP mode
    • Free
  38. 038

    Coefficient from a Factor and the Remainder

    Coefficient from a Factor and the Remainder

    • Polynomials
    • 126 bytes
    • COMP mode
    • Paid
  39. 039

    Cubic Divided by a Monic Quadratic

    Quotient and remainder when a cubic is divided by a monic quadratic x² + ux + v.

    • Polynomials
    • 52 bytes
    • COMP mode
    • Free
  40. 040

    Value at the Opposite Point: Odd-Part Elimination

    From a known f(r), find f(−r) or the remainder at the opposite point without solving for the even-degree coefficients.

    • Polynomials
    • 19 bytes
    • COMP mode
    • Free
  41. 041

    Two-variable linear systems

    Two-variable linear systems · status,x,y

    • More about equations
    • 198 bytes
    • COMP mode
    • Free
  42. 042

    Equations with the Unknown in the Denominators

    Valid real solutions of a/(x − r) + b/(x − s) = c, with the excluded values x = r and x = s rejected.

    • More about equations
    • 265 bytes
    • COMP mode
    • Paid
  43. 043

    Percentage Change in Joint Variation

    Percentage change of z when x and y change, for z = k × x^p × y^q, from the powers and the signed percentage changes.

    • Variations
    • 43 bytes
    • COMP mode
    • Free
  44. 044

    Line Slope and Intercepts

    Enter a, b, c in ax+by+c=0 to find slope and axis intercepts; special lines end with a status code.

    • Coordinate geometry
    • 125 bytes
    • COMP mode
    • Free
  45. 045

    Line through Two Points

    Enter two distinct points to obtain the coefficients of ax+by+c=0, including vertical and horizontal lines.

    • Coordinate geometry
    • 62 bytes
    • COMP mode
    • Free
  46. 046

    Intersections of Two Lines

    Enter coefficients of ax+by=c and dx+ey=f to find the intersection or classify parallel, coincident and invalid lines.

    • Coordinate geometry
    • 117 bytes
    • COMP mode
    • Free
  47. 047

    Parallel and perpendicular line parameters

    Parallel and perpendicular line parameters · k / status

    • Coordinate geometry
    • 282 bytes
    • COMP mode
    • Free
  48. 048

    Perpendicular Foot and Distance

    Enter a point and ax+by+c=0 to find the perpendicular foot and shortest distance to the infinite line.

    • Coordinate geometry
    • 59 bytes
    • COMP mode
    • Free
  49. 049

    Point reflection in a line

    Reflect a point in any valid real line; display the image’s x-coordinate, then its y-coordinate.

    • Coordinate geometry
    • 50 bytes
    • COMP mode
    • Free
  50. 050

    Smaller angle between two lines

    Find the smaller angle from four normal coefficients, including horizontal and vertical lines.

    • Coordinate geometry
    • 32 bytes
    • COMP mode
    • Free
  51. 051

    Three-point area and orientation

    Find unsigned and signed area from three Cartesian points; the sign describes their order.

    • Coordinate geometry
    • 88 bytes
    • COMP mode
    • Free
  52. 052

    Triangle formed by three lines

    Enter three general-form lines; read the area followed by all three Cartesian vertices.

    • Coordinate geometry
    • 244 bytes
    • COMP mode
    • Paid
  53. 053

    Area enclosed by four ordered lines

    Area enclosed by four ordered lines · S

    • Coordinate geometry
    • 308 bytes
    • CMPLX mode
    • Paid
  54. 054

    Quadrilateral area and perimeter

    Quadrilateral area and perimeter · S,P

    • Coordinate geometry
    • 123 bytes
    • CMPLX mode
    • Free
  55. 055

    Perpendicular bisector locus

    Perpendicular bisector locus · a,b,c

    • Coordinate geometry
    • 45 bytes
    • COMP mode
    • Free
  56. 056

    Equidistant point on a line

    Equidistant point on a line · x,y / status

    • Coordinate geometry
    • 146 bytes
    • COMP mode
    • Paid
  57. 057

    Circle centre radius and point position

    Circle centre radius and point position

    • Coordinate geometry
    • 89 bytes
    • COMP mode
    • Free
  58. 058

    Circle from its centre and a point

    Circle from its centre and a point · r,r²,D,E,F

    • Coordinate geometry
    • 44 bytes
    • COMP mode
    • Free
  59. 059

    Circle from diameter endpoints

    Circle from diameter endpoints · h,k,r,r²

    • Coordinate geometry
    • 58 bytes
    • COMP mode
    • Free
  60. 060

    Circle through three points

    Circle through three points · h,k,r²,r

    • Coordinate geometry
    • 175 bytes
    • COMP mode
    • Paid
  61. 061

    Circle and line intersections

    Circle and line intersections · count,x₁,y₁,[x₂],[y₂]

    • Coordinate geometry
    • 213 bytes
    • COMP mode
    • Paid
  62. 062

    Parameter range for circle-line intersections

    Parameter range for circle-line intersections · k_min,k_max

    • Coordinate geometry
    • 121 bytes
    • COMP mode
    • Paid
  63. 063

    Tangent at a point on a circle

    Tangent at a point on a circle · status,[a],[b],[c]

    • Coordinate geometry
    • 90 bytes
    • COMP mode
    • Free
  64. 064

    Two circles and their intersections

    Two circles and their intersections · status,x₁,y₁,[x₂],[y₂]

    • Coordinate geometry
    • 276 bytes
    • COMP mode
    • Paid
  65. 065

    Shortest and longest distances to a circle

    Shortest and longest distances to a circle · d_min,d_max

    • Coordinate geometry
    • 55 bytes
    • COMP mode
    • Free
  66. 066

    Sequential coordinate transformations

    Sequential coordinate transformations · (x,y) after each step; final (x,y)

    • Coordinate geometry
    • 149 bytes
    • COMP mode
    • Paid
  67. 067

    Rectangular and polar coordinates

    Rectangular and polar coordinates · M=1: r,θ; M=2: x,y

    • Coordinate geometry
    • 81 bytes
    • COMP mode
    • Free
  68. 068

    Triangle in polar coordinates

    Triangle in polar coordinates · AB,BC,CA,P,S

    • Coordinate geometry
    • 145 bytes
    • COMP mode
    • Paid
  69. 069

    Transformations of a Quadratic Function

    Expands g(x) = P f(Qx + R) + S for a quadratic f into Ax² + Bx + C and gives its vertex.

    • Transformations of graphs
    • 155 bytes
    • COMP mode
    • Paid
  70. 070

    Similarity ratios and measurements

    Similarity ratios and measurements · L₁,L₂,S₁,S₂,V₁,V₂,[Y]

    • Mensuration and similarity
    • 192 bytes
    • COMP mode
    • Free
  71. 071

    Triangle area and altitudes from three sides

    Triangle area and altitudes from three sides · S,hₐ,hᵦ,h꜀

    • Mensuration and similarity
    • 162 bytes
    • COMP mode
    • Free
  72. 072

    Cylinder measurements and inverse problems

    Cylinder measurements and inverse problems · r,h,V,C,S

    • Mensuration and similarity
    • 142 bytes
    • COMP mode
    • Free
  73. 073

    Hemisphere measurements and ratios

    Hemisphere measurements and ratios · M=1: V/π,C/π,S/π; M=2: r₁,r₂,ΔV/π; M=3: S_hemi/S_cyl

    • Mensuration and similarity
    • 172 bytes
    • COMP mode
    • Free
  74. 074

    Cylinder and cone volume conversion

    Cylinder and cone volume conversion · unknown length / ratio / volume multiplier

    • Mensuration and similarity
    • 201 bytes
    • COMP mode
    • Free
  75. 075

    Right-triangle sides and trigonometric ratios

    Right-triangle sides and trigonometric ratios · opposite,adjacent,hypotenuse,[θ],90°−θ,sinθ,cosθ,tanθ

    • Plane trigonometry
    • 171 bytes
    • COMP mode
    • Free
  76. 076

    Sine rule for AAS and ASA

    Sine rule for AAS and ASA · C,unknown sides / b/c

    • Plane trigonometry
    • 165 bytes
    • COMP mode
    • Free
  77. 077

    Cosine rule for SAS and SSS

    Cosine rule for SAS and SSS · M=2: c,cos(max angle),max angle,S; M=3: cos(max angle),max angle,S

    • Plane trigonometry
    • 256 bytes
    • COMP mode
    • Free
  78. 078

    Two tangents from an external point

    Two tangents from an external point · PA,∠APB,AB

    • Plane trigonometry
    • 92 bytes
    • COMP mode
    • Free
  79. 079

    Nearest point along a ray

    Nearest point along a ray · d_min,t,Rₓ,Rᵧ

    • Plane trigonometry
    • 95 bytes
    • COMP mode
    • Free
  80. 080

    Triangle in three-dimensional space

    Triangle in three-dimensional space · AB,AC,BC,∠BAC,S

    • Spatial trigonometry
    • 128 bytes
    • COMP mode
    • Free
  81. 081

    Angle between a line and a plane

    Angle between a line and a plane · θ,sinθ,cosθ

    • Spatial trigonometry
    • 207 bytes
    • COMP mode
    • Paid
  82. 082

    Regular tetrahedron measurements and angles

    Regular tetrahedron measurements and angles · M=1: V,h,S; M=2: V,a,S; M=3: α,β

    • Spatial trigonometry
    • 133 bytes
    • COMP mode
    • Paid
  83. 083

    Group selection with count bounds

    Group selection with count bounds · W

    • Counting and probability
    • 107 bytes
    • COMP mode
    • Free
  84. 084

    Probability of a bounded draw count

    Probability of a bounded draw count · W,T,p

    • Counting and probability
    • 122 bytes
    • COMP mode
    • Paid
  85. 085

    Quartiles of six unsorted values

    Quartiles of six unsorted values · IQR,Q₁,Q₂,Q₃

    • Statistics
    • 262 bytes
    • COMP mode
    • Free
  86. 086

    Quartiles and the Inter-quartile Range

    Q₁, the median, Q₃ and the IQR from a frequency table or bar chart.

    • Statistics
    • 228 bytes
    • COMP mode
    • Free
  87. 087

    Missing boxplot endpoint

    Missing boxplot endpoint · unknown endpoint,IQR,range

    • Statistics
    • 198 bytes
    • COMP mode
    • Paid
  88. 088

    Combined population variance

    Combined population variance · μ,v,σ

    • Statistics
    • 102 bytes
    • COMP mode
    • Paid
  89. 089

    Mean and median with repeated unknowns

    Mean and median with repeated unknowns · x₁,y₁,x₂,y₂,…,count

    • Statistics
    • 196 bytes
    • COMP mode
    • Paid
  90. 090

    Statistics after a linear transformation

    Statistics after a linear transformation · M=0: μ′,median′,range′,IQR′,v′,σ′; M=1 centre′; M=2 spread′; M=3 v′,σ′

    • Statistics
    • 193 bytes
    • COMP mode
    • Free
  91. 091

    Standard score and raw score

    Standard score and raw score · requested x/μ/σ/z

    • Statistics
    • 201 bytes
    • COMP mode
    • Free
  92. 095

    General fixed-point iteration

    University mathematics: Use fixed-point iteration for an exponential equilibrium, Newton iteration for a square root, and a cosine equation in radians. Enter each equation’s map in EDIT, then supply its numerical starting value when running.

    • University mathematics · Numerical methods
    • 92 bytes
    • COMP mode
    • Free
  93. 096

    Four Centres of a Triangle

    Enter three vertices as complex numbers to obtain the centroid G, circumcentre O, orthocentre H and incentre I, in that order.

    • Coordinate geometry
    • 80 bytes
    • CMPLX mode
    • Paid
  94. 100

    Four Triangle Centres: Cartesian Components

    Enter three vertices as complex numbers. From the x and y components of two edges and Cramer's rule, the program gives the centroid G, circumcentre O, orthocentre H and incentre I, in that order.

    • Coordinate geometry
    • 200 bytes
    • CMPLX mode
    • Free
  95. 101

    Four Triangle Centres: Similarity Transform

    Enter three vertices as complex numbers. The program maps the triangle to the standard triangle 0, 1, t, finds the centres there and maps them back, giving G, O, H and I in that order.

    • Coordinate geometry
    • 105 bytes
    • CMPLX mode
    • Free
  96. 102

    Four Triangle Centres: Side-Length Weights

    Enter three vertices as complex numbers. The program weights the original vertices by their opposite side lengths, giving the centroid G, circumcentre O, orthocentre H and incentre I in that order.

    • Coordinate geometry
    • 177 bytes
    • CMPLX mode
    • Free
  97. 103

    Four Triangle Centres: Angles and Rotation

    Enter three vertices as complex numbers. The program finds O from the perpendicular through a chord midpoint and I from a rotated half-angle and the sine rule, giving G, O, H and I in that order.

    • Coordinate geometry
    • 140 bytes
    • CMPLX mode
    • Free
  98. 104

    Line Through Two Points: Equation, Slope, Intercepts, Length, Midpoint

    Enter the four coordinates of two distinct points. The program shows nine values in a fixed order: P, Q, R of the line Px+Qy=R, the slope, the x- and y-intercepts, the length AB and the two midpoint coordinates.

    • Coordinate geometry
    • 130 bytes
    • COMP mode
    • Free
  99. 112

    Shortest Path: 15 Edges

    Find one minimum-cost route through an undirected network of up to ten nodes and 15 edges; display its nodes in order, then its total cost.

    • University mathematics · Graph theory
    • 547 bytes
    • CMPLX mode
    • Free
  100. 113

    Shortest Path: 20 Edges

    Find one minimum-cost route through an undirected network of up to ten nodes and 20 edges; display its nodes in order, then its total cost.

    • University mathematics · Graph theory
    • 637 bytes
    • CMPLX mode
    • Free
  101. 114

    Compound Linear Inequalities

    Find the intersection or union boundaries of two linear inequalities. Decide strict endpoint inclusion from the original inequalities.

    • More about equations
    • 199 bytes
    • COMP mode
    • Free
  102. 115

    Small-Integer Quadratic Roots

    Find the real roots of a quadratic equation with small integer coefficients. A double root is shown twice, and inequality regions are interpreted separately.

    • More about equations
    • 98 bytes
    • COMP mode
    • Free
  103. 116

    Root-Type Parameter Ranges

    Find parameter boundaries for two distinct real roots, a double root or no real roots. Exclude parameter values that make the equation cease to be quadratic.

    • More about equations
    • 226 bytes
    • COMP mode
    • Paid
  104. 117

    Cubic Coefficients and Quotient Discriminant

    Recover the two unknown middle coefficients of a cubic from a remainder and a known linear factor, then classify the roots of its quadratic quotient.

    • Polynomials
    • 101 bytes
    • COMP mode
    • Free
  105. 118

    Signed Rational Sums

    Combine two fractions with constant signed numerators and linear denominators. Read the combined coefficients and retain the original excluded values when simplifying further.

    • Algebra
    • 126 bytes
    • COMP mode
    • Free
  106. 119

    Unit-Coefficient Indices

    Simplify a quotient of powers in two variables when both numerical coefficients are one. Read the resulting exponents and preserve the original domain.

    • Indices and logarithms
    • 46 bytes
    • COMP mode
    • Free
  107. 120

    Quadratic Substitution and Valid Roots

    Solve equations reduced to a quadratic by square, exponential or logarithmic substitution. Restore the original variable, reject invalid substitution roots and count distinct solutions.

    • More about equations
    • 307 bytes
    • COMP mode
    • Paid
  108. 121

    Same-Base Logarithm Equations

    Solve sums or differences of two logarithms with the same base and linear arguments. Check both positive-argument conditions and keep only valid real solutions.

    • Indices and logarithms
    • 324 bytes
    • COMP mode
    • Free
  109. 122

    Parabola–Line Intersections and Chord

    Find the intersections of a parabola and a line, distinguish tangency from other single intersections and calculate the chord length when two points exist.

    • Coordinate geometry
    • 330 bytes
    • COMP mode
    • Paid
  110. 123

    Measured Total Bounds

    Find the possible total of nonnegative items whose individual measurements are rounded to a given unit. Keep the lower endpoint and exclude the upper endpoint.

    • Approximation and bounds
    • 40 bytes
    • COMP mode
    • Free
  111. 124

    Claimed Total and Rounding Intervals

    Compare the possible physical total with a claimed rounded total. Read both rounding intervals and decide whether their overlap makes the claim possible.

    • Approximation and bounds
    • 60 bytes
    • COMP mode
    • Free
  112. 125

    Restore Transformed Axes

    Restore exponential or power relations from a straight line on transformed axes, or evaluate the original variable after undoing a root or cube transformation.

    • Transformations of graphs
    • 304 bytes
    • COMP mode
    • Paid
  113. 126

    Partial Variation: Two Coefficients

    Determine two coefficients of y=k₁xᵖ+k₂xᑫ from two data pairs, then calculate the value at a specified nonzero argument.

    • Variations
    • 106 bytes
    • COMP mode
    • Free
  114. 127

    Meeting a Stationary Vehicle

    Calculate when a uniformly moving vehicle reaches another vehicle’s stopping position, together with the corresponding positions and journey speeds.

    • Rates and ratios
    • 48 bytes
    • COMP mode
    • Free
  115. 128

    Two-Stage Journey Times

    Calculate the two stage durations from two different speeds, the total distance and the total journey time.

    • Rates and ratios
    • 39 bytes
    • COMP mode
    • Free
  116. 129

    Time-Weighted Average Speed

    Find the time-weighted average speed of two journey stages, including stationary time.

    • Rates and ratios
    • 32 bytes
    • COMP mode
    • Free
  117. 130

    Arithmetic Sum: All Integer Indices

    Find all positive integer term counts satisfying an arithmetic partial-sum inequality, including two separated solution intervals.

    • Sequences and Series
    • 590 bytes
    • COMP mode
    • Paid
  118. 131

    Geometric Term and Sum Thresholds

    Find the integer index range for a geometric term or sum threshold, distinguishing finite attainment from a limiting value.

    • Sequences and Series
    • 496 bytes
    • COMP mode
    • Paid
  119. 132

    Small-Integer Geometric Parameters

    Find the parameter and common ratio when three linear expressions with small original integer coefficients form a geometric sequence.

    • Sequences and Series
    • 197 bytes
    • COMP mode
    • Free
  120. 133

    Affine Recurrence and First Threshold

    Calculate a term and cumulative sum of an affine recurrence, or find its first threshold crossing from index zero.

    • Sequences and Series
    • 187 bytes
    • COMP mode
    • Free
  121. 134

    Compare Sequences with Different Starting Years

    Align two arithmetic or geometric sequences with different starting years and compare their annual values or cumulative combined totals.

    • Sequences and Series
    • 646 bytes
    • COMP mode
    • Paid
  122. 135

    Unknown Number Base or Digit

    Find legal integer bases from 2 to 16 or one missing digit in a two- or three-digit positional numeral.

    • Number bases
    • 279 bytes
    • COMP mode
    • Free
  123. 137

    Merged and remaining weighted means

    For disjoint groups use m=1 to merge them. For m=−1 the first group is the whole and the second is a subgroup removed from it. Given the two weights and means below, find the new mean and total.

    • Statistics
    • 83 bytes
    • COMP mode
    • Free
  124. 138

    First success without replacement

    N objects include K targets. Draw uniformly without replacement until the first target. For the given t, find both P(T=t) and P(T≤t), where T is the first successful draw.

    • Counting and probability
    • 119 bytes
    • COMP mode
    • Free
  125. 139

    Binomial interval probability

    There are n independent trials, each with the same success probability p. Let X count successes. Find P(L≤X≤U), including both endpoints.

    • Counting and probability
    • 158 bytes
    • COMP mode
    • Free
  126. 140

    Success counts in three independent events

    Three mutually independent trials have the probabilities p₁,p₂,p₃ below, which need not be equal. If K counts successes, find P(L≤K≤U), including both endpoints.

    • Counting and probability
    • 249 bytes
    • COMP mode
    • Free
  127. 141

    Choose a bag, then draw: total probability

    First choose bag I with probability p, otherwise bag II. Then draw one object uniformly from that bag. Each bag has the target and other counts shown below. Find the overall probability of drawing a target.

    • Counting and probability
    • 101 bytes
    • COMP mode
    • Free
  128. 142

    Alternating retries and terminating outcomes

    Player I starts; the two players alternate independent trials with unchanged rules. At each turn q is the probability of continuing and r is the probability of the designated immediate stopping outcome; all other outcomes also stop play. Find the final designated-outcome probabilities for I and II.

    • Counting and probability
    • 131 bytes
    • COMP mode
    • Free
  129. 143

    Two-card sum probability with repeated values

    Choose two different physical cards uniformly without replacement, ignoring order. Repeated numerical values still belong to distinct cards. For the listed real card values, find the probability that their sum equals S.

    • Counting and probability
    • 353 bytes
    • CMPLX mode
    • Free
  130. 144

    Linear inequalities throughout a convex region

    The listed points are all vertices of a nonempty, bounded, closed convex triangle or quadrilateral. For f(x,y)=ax+by, decide whether f≤c and f≥c each hold throughout the region, then find both extrema and the first listed vertex attaining each.

    • Coordinate geometry
    • 178 bytes
    • CMPLX mode
    • Free
  131. 145

    Recover an additive constant from a vertex optimum

    All vertices of a nonempty, bounded, closed convex polygon are listed. Let F(x,y)=ax+by+k. In two separate cases, find k if its minimum is T and if its maximum is T. The constant k is additive and is not a coefficient of x or y.

    • Coordinate geometry
    • 91 bytes
    • COMP mode
    • Free
  132. 146

    Coefficient range for a prescribed maximum

    All vertices of a nonempty, bounded, closed convex triangle or quadrilateral are given. At least one vertex has x=0 and by=T, so the value T is always attained. Find every β for which the maximum of βx+by throughout the region is exactly T.

    • Coordinate geometry
    • 165 bytes
    • COMP mode
    • Free
  133. 147

    Six-Coefficient Linear System

    Solve two linear equations from their six signed coefficients. Read the unique solution, or distinguish inconsistent equations from an infinite solution set.

    • More about equations
    • 118 bytes
    • COMP mode
    • Free
  134. 148

    Arithmetic and Geometric Terms and Sums

    Choose arithmetic (M=1) or geometric (M=2), and find the indicated term and partial sum.

    • Sequences and Series
    • 187 bytes
    • COMP mode
    • Free
  135. 149

    Recover a Sequence from Two Terms

    From two known terms recover the first term and common difference or positive ratio, then find the requested term and sum.

    • Sequences and Series
    • 287 bytes
    • COMP mode
    • Free
  136. 151

    Bisection Root Bracketing

    University numerical methods. Bisection Root Bracketing. Use a continuous real function on [a,b], with a<b and opposite endpoint signs, or an endpoint root. Enter a,b,f(a),f(b),N; N is an integer from 1 to 50, not a tolerance. Each round displays X=(a+b)/2; press EXE, then enter the current f(X) at Y?. The function is not stored automatically. All three exercises use Rad, essential for cos(x)−x.

    • University mathematics · Numerical methods
    • 235 bytes
    • COMP mode
    • Free
  137. 153

    Circle and Line: General Form

    Circle and Line: General Form · Find the number of intersections and all intersection coordinates. When they exist, find the chord midpoint H and half-length ρ.

    • Coordinate geometry
    • 199 bytes
    • COMP mode
    • Free
  138. 154

    Sequence Sum Threshold

    Find the smallest or largest positive integer n for which the partial sum is strictly greater than K. Check the adjacent sum.

    • Sequences and Series
    • 416 bytes
    • COMP mode
    • Free
  139. 155

    Circle and Line: Centre and Radius

    Circle and Line: Centre and Radius · Find the number of intersections and all intersection coordinates. When they exist, find the chord midpoint H and half-length ρ.

    • Coordinate geometry
    • 181 bytes
    • COMP mode
    • Free
  140. 156

    Circle and Line: Scaled Coefficients

    Circle and Line: Scaled Coefficients · Find the number of intersections and all intersection coordinates. When they exist, find the chord midpoint H and half-length ρ.

    • Coordinate geometry
    • 213 bytes
    • COMP mode
    • Free
  141. 157

    Circle and Line: Two Input Forms

    Circle and Line: Two Input Forms · Find the number of intersections and all intersection coordinates. When they exist, find the chord midpoint H and half-length ρ.

    • Coordinate geometry
    • 234 bytes
    • COMP mode
    • Free
  142. 158

    Circle and Line: Parameter Range

    Find the parameter interval for the requested number of intersections. Endpoints are tangent lines; the open interval gives two intersections.

    • Coordinate geometry
    • 77 bytes
    • COMP mode
    • Free
  143. 159

    Two-Term Recovery and Sum Threshold

    From two known terms recover the first term and common difference or positive ratio, then find the requested term and sum. Find the smallest or largest positive integer n for which the partial sum is strictly greater than K. Check the adjacent sum.

    • Sequences and Series
    • 639 bytes
    • COMP mode
    • Paid
  144. 167

    Linear Programming: Vertex Extremes

    Linear Programming: Vertex Extremes. Linear Programming: Vertex Extremes. Use CMPLX/Deg. Enter p+qi for F=px+qy+r, then four pairs (a+bi,c) for ax+by≤c, and finally r: ten inputs. Convert ≥ by reversing every sign. For three constraints, repeat the third. Require nonzero normals and (p,q)≠(0,0). The region must already be known nonempty with a vertex. Empty regions, parallel strips and the whole plane are outside the contract. General memory is cleared.

    • Linear programming
    • 242 bytes
    • CMPLX mode
    • Free
  145. 169

    Variation: constant plus one term

    Determine the two coefficients from two values of a model that becomes y=a+bu, then evaluate the requested expression.

    • Variations
    • 100 bytes
    • COMP mode
    • Free
  146. 172

    Variation: two arbitrary terms

    Determine coefficients in y=aF(x)+bG(x) from two observations, then evaluate the model.

    • Variations
    • 154 bytes
    • COMP mode
    • Free
  147. 173

    Variation: two integer powers

    Determine a,b in y=axᵖ+bxᑫ from two observations and selected integer powers, then evaluate the requested value.

    • Variations
    • 289 bytes
    • COMP mode
    • Paid
  148. 176

    Two Sources: Total Probability and Bayes

    Use two mutually exclusive, exhaustive sources to find an event probability and the reverse conditional probability.

    • Counting and probability
    • 112 bytes
    • COMP mode
    • Free
  149. 177

    First Success: Exact and Cumulative Probabilities

    Enter the marked-token count S and unmarked-token count F separately. For uniform draws without replacement, find the probability of first success exactly at draw k and by draw k.

    • Counting and probability
    • 181 bytes
    • COMP mode
    • Free
  150. 178

    Signed Geometric Area Blocks

    Signed Geometric Area Blocks. Output order: area S

    • Mensuration and similarity
    • 242 bytes
    • COMP mode
    • Free
  151. 181

    Composite Area Measurement Bounds

    Composite Area Measurement Bounds. Output order: lower bound L, upper bound U

    • Approximation and bounds
    • 162 bytes
    • COMP mode
    • Free
  152. 186

    Sector: Any Two Known Quantities

    Sector: Any Two Known Quantities. Output order: radius r, angle θ, arc length L, area S, perimeter P

    • Mensuration and similarity
    • 251 bytes
    • COMP mode
    • Paid
  153. 187

    Circular Segments and Annular Sectors

    Circular Segments and Annular Sectors. Output order: angle α / θ, area G₁ / S, area G₂ / perimeter P

    • Mensuration and similarity
    • 321 bytes
    • COMP mode
    • Free
  154. 188

    Quadratic Inequality Solution Sets

    Quadratic Inequality Solution Sets. Output order: solution type code D, r₁ / r, r₂

    • More about equations
    • 336 bytes
    • COMP mode
    • Paid
  155. 189

    Annular Sector: Angle or Area

    Annular Sector: Angle or Area. Output order: θ / S, area Sᵢ, perimeter Pₒ

    • Mensuration and similarity
    • 230 bytes
    • COMP mode
    • Free