7/31/2025 2024 AMC 12B student reflection notes from Ay

1) Reviewed the SAT vocabulary words 2) Reviewed the attached problems and solutions 3) Attempted the 2024 AMC 12 B. I attempted 20 questions out of 25 and skipped these: #15, #18( very easy and I could solve it later), #21, #23, #24 Out of the questions attempted, I got #22 wrong but later realized it was a careless mistake and I could solve it. Rest all questions were answered correctly- #1 to #14, #16, #17, #19 , #20 and #25

7/28/2025 2013 AMC 12 B student reflection notes from H

2013 AMC 12B LOG

Incorrect Problems

• Problem 23 – No idea how to start
• Problem 24 – Almost got it through angle chasing
• Problem 25 – Very close, right idea but missed a few cases

Correct Problems

Problems solved correctly: 15, 16, 17, 18, 19, 20, 21, 22

• Problem 17 – Should learn Cauchy-Schwarz
• Problem 20 – Ran out of time

7/25/2025 H 2013 12 A reflection notes

2013 AMC 12A Log

Incorrect Problems

• Problem 20 – Totally confused
• Problem 24 – Right idea but casework had too many cases
• Problem 25 – No idea how to start

Correct Problems

Problems solved correctly: 15, 16, 17, 18, 19, 21, 22, 23

• Problem 16 – Took too long
• Problem 23 – Angle chasing was hard
• Had to look at answer choices

7/18/25 H 2012 AMC 12 B reflection notes

17 wrong confused

20 wrong, time sink

21 wrong 

22 right of hands

23 wrong understood solution

24 wrong time sink casework

25 easy casework, right 

Similar to 2023 Mathcounts chapter sprint #30, but harder (level 2)

This question is similar to, but more difficult than the 2023 Mathcounts Chapter Sprint #30, which is as follows:

Consider the seven points on the circle shown. If George draws line segments connecting pairs of points so that each point is connected to exactly two other points, what is the probability that the resulting figure is a convex heptagon? Express your answer as a common fraction.

Try the question first before you read the solution down below.

Convex Heptagon Probability (7 points on a circle)

Label the points 1 – 7 clockwise around the circle. Each point must be joined to exactly two others, so the drawing is a 2-regular graph (a disjoint union of cycles).

1 . Count all edge–sets (2-regular graphs) on 7 labelled points

• One 7-cycle.
  Fix the cyclic order: the edges of a 7-cycle correspond to a permutation of the 6 points after 1, with direction ignored. Hence
  \( \dfrac{6!}{2}=360 \) distinct 7-cycles.
• One 3-cycle + one 4-cycle.
  
  1. Choose the 3-cycle: \( \binom{7}{3}=35 \).
  2. Orient the 3-cycle: \( (3-1)!/2 = 1 \) way.
  3. Orient the remaining 4-cycle: \( (4-1)!/2 = 3 \) ways.
  Total  \( 35 \times 1 \times 3 = 105 \) edge–sets.

Adding the two cases gives the total number of admissible drawings: \[ N_{\text{total}} = 360 + 105 = 465 . \]

2 . Count the favourable edge–set

Exactly one of those drawings is the perimeter \(1\!-\!2\!-\!3\!-\!4\!-\!5\!-\!6\!-\!7\!-\!1\), which yields a convex heptagon.

3 . Probability

\[ \boxed{\displaystyle \Pr(\text{convex heptagon})=\frac{1}{465}} \]

---

Checks: the same counting method gives \(70\) total for 6 points (hexagon) and \(3507\) total for 8 points (octagon), agreeing with \(1/70\) and \(1/3507\) respectively.