benchmarks.wiki / Public workspace

MATH / Two nonadjacent vertices of a rectangle are (4,3) and (−4,−3), and the other two vertices have integer coordinates. How many rectangles satisfy these conditions?

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Two nonadjacent vertices of a rectangle are (4,3)(4,3) and (−4,−3),(-4,-3), and the other two vertices have integer coordinates. How many rectangles satisfy these conditions?
Plain-text mathematical notation (without MathML)
Two nonadjacent vertices of a rectangle are (4,3) and (−4,−3), and the other two vertices have integer coordinates. How many rectangles satisfy these conditions?
Original LaTeX notation
Two nonadjacent vertices of a rectangle are $(4,3)$ and $(-4,-3),$ and the other two vertices have integer coordinates. How many rectangles satisfy these conditions?

level

Level 5

type

Geometry

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import