Perplex
Content
  • Exponents & Logarithms
  • Approximations & Error
  • Sequences & Series
  • Financial Mathematics
  • Cartesian plane & lines
  • Function Theory
  • Modelling
  • 2D & 3D Geometry
  • Voronoi Diagrams
  • Probability
  • Descriptive Statistics
  • Bivariate Statistics
  • Distributions & Random Variables
  • Inference & Hypotheses
  • Differentiation
  • Integration
Other
  • Review Videos
  • Blog
  • Landing Page
  • Sign Up
  • Login
  • Perplex
    IB Math AISL
    /
    Cartesian plane & lines
    /

    Problems

    Edit

    Problem Bank - Cartesian plane & lines

    Access custom-built, exam-style problems for cartesian plane & lines. Each problem has a full solution and mark-scheme, as well as AI grading and support.

    Select a Difficulty:

    12 / 35 problems visible - Upgrade to view all problems

    IB: 7
    23

    !

    0 / 14

    Four villages are located at A(2,2), B(8,2), C(8,6), D(2,9). The perpendicular bisectors of every pair of villages have been drawn on a map. A toxic waste dump is to be constructed between the villages. Two candidate dump sites are the vertices P(5, 4) and Q(4, 5.5).

    Powered by Desmos

    1. Write down the equation of the perpendicular bisector [BC].

      [3]

    For each site P and Q:

    1. Calculate the distance between the site and the closest village.

      [9]
    2. Hence decide which site is safer for the toxic-waste dump and justify your decision.

      [2]
    24

    !

    Plus

    0 / 13

    Upgrade to Plus to solve this problem
    25

    !

    Plus

    0 / 6

    Upgrade to Plus to solve this problem
    26

    !

    Plus

    0 / 9

    Upgrade to Plus to solve this problem
    27

    !

    Plus

    0 / 15

    Upgrade to Plus to solve this problem
    28

    !

    Plus

    0 / 7

    Upgrade to Plus to solve this problem
    29

    !

    Plus

    0 / 9

    Upgrade to Plus to solve this problem
    30

    !

    Plus

    0 / 7

    Upgrade to Plus to solve this problem
    31

    !

    Plus

    0 / 10

    Upgrade to Plus to solve this problem

    Ask Plex AI about problem 23

    Get hints, ask questions, and work through this problem step by step