🔬 Model Lab

New run Stored runs ⚖️ Judge verdicts 🧮 Math 📊 Math runs 📄 Benchmark paper 📄 3-model paper 📄 Meta: Will Muse Cause a Spark?

🧮 Math benchmark — 12 questions × 16 models

2026-05-31T14:15:38 · difficulty: stretch · AMC 8 / AJHSME · 📨 all-at-once (1 call/model) · all sessions →

💸 Spent on this benchmark: 27.19¢ across 192 answers (12 questions × 16 models)

Leaderboard (accuracy on graded answers)

#ModelCorrectAccuracyAvg/QTotal timeCost$/M outOut tok~Impl tokErrors
🥇 openrouter:deepseek/deepseek-v4-pro 12/12 100% 17.6s 211.3s 0.58¢ $0.70 6144 8397 0
🥈 openrouter:qwen/qwen3.7-max 12/12 100% 12.7s 152.0s 3.44¢ $4.42 8748 7772 0
🥉 openrouter:moonshotai/kimi-k2.6 12/12 100% 15.5s 185.8s 3.09¢ $4.00 8796 7719 0
4 openrouter:z-ai/glm-5.1 12/12 100% 19.7s 236.0s 1.78¢ $3.03 5424 5878 0
5 openrouter:stepfun/step-3.7-flash 12/12 100% 6.7s 80.9s 2.09¢ $1.15 18012 18209 0
6 anthropic:claude-opus-4-8 12/12 100% 1.8s 21.0s 4.95¢ $25.00~ 1680 1979 0
7 anthropic:claude-haiku-4-5-20251001 11/12 92% 2.0s 23.5s 1.85¢ $5.00~ 3444 3691 0
8 openrouter:openai/gpt-5.4-nano 11/12 92% 3.3s 39.6s 0.82¢ $1.25 6348 6538 0
9 openrouter:google/gemini-3.1-flash-lite 11/12 92% 0.8s 9.1s 0.40¢ $1.50 2460 2664 0
10 anthropic:claude-sonnet-4-6 11/12 92% 2.7s 32.2s 2.85¢ $15.00~ 1656 1902 0
11 openrouter:openai/gpt-5.4-mini 9/12 75% 2.1s 25.1s 2.05¢ $4.50 4368 4555 0
12 openrouter:x-ai/grok-4.3 9/12 75% 1.7s 20.8s 0.93¢ $2.50 3096 3725 0
13 openrouter:meta-llama/llama-4-maverick 8/12 67% 14.7s 176.8s 0.32¢ $0.65 5004 4855 0
14 openrouter:baidu/ernie-4.5-vl-424b-a47b 7/12 58% 26.6s 319.0s 2.04¢ $1.25 15900 16330 0
15 openrouter:minimax/minimax-m2.7 0/0 – 75.0s 900.2s 0.00¢ $0.84 – – 12
16 openrouter:bytedance-seed/seed-2.0-lite 0/0 – 4.7s 55.9s 0.00¢ $2.00 – – 12
Accuracy by difficulty (all models): stretch 89%  
Out tok = actual output tokens (summed from each call's usage). ~Impl tok = cost ÷ output-price (what the spend implies if it were all output) — runs a touch above Out tok because input tokens fold in; tracks closely here since prompts are short.

Question × model matrix — each cell is the model's pick · 🟩 correct · 🟥 wrong

Model ↓ / Q →Q1
ans A
Q2
ans C
Q3
ans D
Q4
ans E
Q5
ans D
Q6
ans E
Q7
ans D
Q8
ans A
Q9
ans B
Q10
ans B
Q11
ans D
Q12
ans A
anthropic:claude-haiku-4-5-20251001 B ✗C ✓D ✓E ✓D ✓E ✓D ✓A ✓B ✓B ✓D ✓A ✓
openrouter:openai/gpt-5.4-mini A ✓C ✓D ✓E ✓D ✓E ✓C ✗D ✗B ✓B ✓D ✓B ✗
openrouter:openai/gpt-5.4-nano E ✗C ✓D ✓E ✓D ✓E ✓D ✓A ✓B ✓B ✓D ✓A ✓
openrouter:google/gemini-3.1-flash-lite A ✓E ✗D ✓E ✓D ✓E ✓D ✓A ✓B ✓B ✓D ✓A ✓
openrouter:x-ai/grok-4.3 A ✓C ✓D ✓E ✓D ✓E ✓C ✗D ✗B ✓B ✓D ✓B ✗
openrouter:meta-llama/llama-4-maverick B ✗C ✓D ✓E ✓D ✓E ✓C ✗D ✗B ✓B ✓D ✓B ✗
openrouter:deepseek/deepseek-v4-pro A ✓C ✓D ✓E ✓D ✓E ✓D ✓A ✓B ✓B ✓D ✓A ✓
openrouter:qwen/qwen3.7-max A ✓C ✓D ✓E ✓D ✓E ✓D ✓A ✓B ✓B ✓D ✓A ✓
openrouter:moonshotai/kimi-k2.6 A ✓C ✓D ✓E ✓D ✓E ✓D ✓A ✓B ✓B ✓D ✓A ✓
openrouter:z-ai/glm-5.1 A ✓C ✓D ✓E ✓D ✓E ✓D ✓A ✓B ✓B ✓D ✓A ✓
openrouter:minimax/minimax-m2.7 ⚠⚠⚠⚠⚠⚠⚠⚠⚠⚠⚠⚠
openrouter:baidu/ernie-4.5-vl-424b-a47b A ✓C ✓D ✓E ✓D ✓E ✓D ✓? ✗? ✗? ✗? ✗? ✗
openrouter:bytedance-seed/seed-2.0-lite ⚠⚠⚠⚠⚠⚠⚠⚠⚠⚠⚠⚠
openrouter:stepfun/step-3.7-flash A ✓C ✓D ✓E ✓D ✓E ✓D ✓A ✓B ✓B ✓D ✓A ✓
anthropic:claude-opus-4-8 A ✓C ✓D ✓E ✓D ✓E ✓D ✓A ✓B ✓B ✓D ✓A ✓
anthropic:claude-sonnet-4-6 A ✓C ✓D ✓E ✓D ✓E ✓A ✗A ✓B ✓B ✓D ✓A ✓
solved (models ✓)11/1413/1414/1414/1414/1414/1410/1410/1413/1413/1413/1410/14
Cell = the letter the model chose; 🟩 matches the correct answer, 🟥 wrong · ⏳ running · ⚠ error. Bottom row = how many models solved each question (🟩 all got it … 🟥 most missed it), so you can spot the questions the models struggled with.

Questions & model reasoning

Q1 · stretch · AMC 8 2000 #20 — correct: A (1 dime.) · solved by 11/14 models

You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type. How many dimes must you have?

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
Official approach: pay one of each first, then let the units digit fix the pennies
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 B ✗
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini A ✓
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano E ✗
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite A ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 A ✓
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick B ✗
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro A ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max A ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 A ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 A ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b A ✓
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash A ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 A ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 A ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q2 · stretch · AJHSME 1997 #23 — correct: C (36.) · solved by 13/14 models

Some positive integers have both properties: (I) the sum of the squares of their digits is 50, and (II) each digit is larger than the one to its left. The product of the digits of the largest such integer is

  1. 7
  2. 25
  3. 36
  4. 48
  5. 60
Official approach: bound the digit count, then settle the largest digit
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 C ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini C ✓
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano C ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite E ✗
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 C ✓
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick C ✓
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro C ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max C ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 C ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 C ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b C ✓
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash C ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 C ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 C ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q3 · stretch · AJHSME 1988 #23 — correct: D (240.) · solved by 14/14 models

Maria buys computer disks at a price of 4 for $5 and sells them at a price of 3 for $5. How many computer disks must she sell in order to make a profit of $100?

  1. 100
  2. 120
  3. 200
  4. 240
  5. 1200
Official approach: profit per disk, then scale to $100
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 D ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini D ✓
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano D ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite D ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 D ✓
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick D ✓
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro D ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max D ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 D ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 D ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b D ✓
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash D ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 D ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 D ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q4 · stretch · AJHSME 1997 #22 — correct: E ($675.) · solved by 14/14 models

A two-inch cube (2 × 2 × 2) of silver weighs 3 pounds and is worth $200. How much is a three-inch cube of silver worth?

  1. $300
  2. $375
  3. $450
  4. $560
  5. $675
Official approach: value is proportional to volume
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 E ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini E ✓
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano E ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite E ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 E ✓
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick E ✓
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro E ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max E ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 E ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 E ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b E ✓
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash E ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 E ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 E ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q5 · stretch · AJHSME 1989 #21 — correct: D (71.) · solved by 14/14 models

Jack had a bag of 128 apples. He sold 25% of them to Jill. Next he sold 25% of those remaining to June. Of those apples still in his bag, he gave the shiniest one to his teacher. How many apples did Jack have then?

  1. 7
  2. 63
  3. 65
  4. 71
  5. 111
Official approach: keep 3⁄4 each time, then subtract 1
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 D ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini D ✓
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano D ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite D ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 D ✓
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick D ✓
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro D ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max D ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 D ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 D ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b D ✓
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash D ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 D ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 D ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q6 · stretch · AMC 8 2002 #21 — correct: E (11/16.) · solved by 14/14 models

Harold tosses a nickel four times. The probability that he gets at least as many heads as tails is

  1. 516
  2. 38
  3. 12
  4. 58
  5. 1116
Official approach: use heads–tails symmetry
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 E ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini E ✓
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano E ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite E ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 E ✓
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick E ✓
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro E ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max E ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 E ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 E ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b E ✓
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash E ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 E ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 E ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q7 · stretch · AJHSME 1998 #25 — correct: D ($252.) · solved by 10/14 models

Three generous friends redistribute their money as follows: Amy gives Jan and Toy enough to double each of their amounts; then Jan gives Amy and Toy enough to double theirs; finally Toy gives Amy and Jan enough to double theirs. Toy had $36 at the beginning and $36 at the end. What is the total amount the three friends have?

  1. $108
  2. $180
  3. $216
  4. $252
  5. $288
Official approach: use the unchanging total; track Toy through his two doublings
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 D ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini C ✗
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano D ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite D ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 C ✗
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick C ✗
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro D ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max D ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 D ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 D ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b D ✓
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash D ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 D ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 A ✗
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q8 · stretch · AMC 8 2017 #21 — correct: A (0.) · solved by 10/14 models

Suppose a, b, and c are nonzero real numbers, and a + b + c = 0. What are the possible value(s) for

a|a| + b|b| + c|c| + abc|abc| ?
  1. 0
  2. 1 and −1
  3. 2 and −2
  4. 0, 2, and −2
  5. 0, 1, and −1
Official approach: read everything as signs (+1/&minus;1)
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 A ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini D ✗
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano A ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite A ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 D ✗
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick D ✗
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro A ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max A ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 A ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 A ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b – ✗
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash A ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 A ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 A ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q9 · stretch · AMC 8 2000 #23 — correct: B (6.) · solved by 13/14 models

There is a list of seven numbers. The average of the first four numbers is 5, and the average of the last four numbers is 8. If the average of all seven numbers is 647, then the number common to both sets of four numbers is

  1. 537
  2. 6
  3. 647
  4. 7
  5. 737
Official approach: the shared number is the only thing counted twice
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 B ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini B ✓
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano B ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite B ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 B ✓
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick B ✓
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro B ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max B ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 B ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 B ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b – ✗
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash B ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 B ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 B ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q10 · stretch · AMC 8 2020 #23 — correct: B (150 ways.) · solved by 13/14 models

Five different awards are to be given to three students. Each student will receive at least one award. In how many different ways can the awards be distributed?

  1. 120
  2. 150
  3. 180
  4. 210
  5. 240
Official approach: inclusion&ndash;exclusion on &lsquo;someone is empty-handed&rsquo;
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 B ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini B ✓
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano B ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite B ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 B ✓
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick B ✓
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro B ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max B ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 B ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 B ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b – ✗
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash B ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 B ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 B ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q11 · stretch · AMC 8 2003 #20 — correct: D (10&deg;.) · solved by 13/14 models

What is the measure of the acute angle formed by the hands of the clock at 4:20 PM?

  1. 0°
  2. 5°
  3. 8°
  4. 10°
  5. 12°
Official approach: pin each hand's exact position, then take the gap
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 D ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini D ✓
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano D ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite D ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 D ✓
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick D ✓
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro D ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max D ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 D ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 D ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b – ✗
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash D ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 D ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 D ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A
Q12 · stretch · AJHSME 1994 #25 — correct: A (846.) · solved by 10/14 models

Find the sum of the digits in the answer to

9999…9994 nines×4444…4494 fours

where a string of 94 nines is multiplied by a string of 94 fours.

  1. 846
  2. 855
  3. 945
  4. 954
  5. 1072
Official approach: spot the pattern from small cases, then leap to 94
ModelPick✓/✗Reasoning
anthropic:claude-haiku-4-5-20251001 A ✓
show
I'll solve each problem step-by-step.

---

**Problem 1:**

**What we need:** Find how many dimes are needed when 9 coins total $1.02, with at least one of each type (penny, nickel, dime, quarter).

**Setup:** Let p, n, d, q be the number of pennies, nickels, dimes, and quarters.
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102 (in cents)
- p, n, d, q ≥ 1

**Constraint with minimums:** At least one of each means we need 4 coins minimum.
- Minimum value with one of each: 1 + 5 + 10 + 25 = 41 cents
- Remaining: 9 - 4 = 5 coins worth 102 - 41 = 61 cents

**Finding the combination:** With 5 extra coins to distribute worth 61 cents:
- If we add 5 more quarters: 5(25) = 125 cents (too much)
- If we add 2 more quarters and 3 more dimes: 2(25) + 3(10) = 80 cents (too much)
- If we add 2 more quarters and 1 dime and 2 nickels: 50 + 10 + 10 = 70 cents (too much)
- If we add 2 quarters, 1 dime, 1 nickel, 1 penny: 50 + 10 + 5 + 1 = 66 cents (too much)
- If we add 1 quarter and 4 dimes: 25 + 40 = 65 cents (too much)
- If we add 1 quarter, 3 dimes, and 1 nickel: 25 + 30 + 5 = 60 cents (need 1 more cent = 1 penny)
  Total: 1p + 2n + 4d + 2q = 1 + 10 + 40 + 50 = 101 cents (not quite)

Let me try: 1q, 3d, 1n, 4p = 25 + 30 + 5 + 4 = 64 cents (not enough)

Systematically: 2q, 1d, 1n, 5p = 50 + 10 + 5 + 5 = 70 (too much)
Try: 2q, 0d, 2n, 5p: only 8 coins
Try: 3q, 0d, 1n, 4p = 75 + 5 + 4 = 84 (not enough, need 6 more)
Try: 3q, 0d, 0n, 4p + need dimes: doesn't work with constraints
Try: 2q, 1d, 2n, 3p = 50 + 10 + 10 + 3 = 73 (need 29 more from 1 coin - impossible)

After systematic checking: **2q, 5d, 1n, 1p** = 50 + 50 + 5 + 1 = 106 (too much)
**2q, 4d, 2n, 1p** = 50 + 40 + 10 + 1 = 101 (need 1 more)
**2q, 4d, 1n, 2p** = 50 + 40 + 5 + 2 = 97 (not enough)
**3q, 2d, 1n, 3p** = 75 + 20 + 5 + 3 = 103 (too much)
**3q, 2d, 0n, 4p** = 75 + 20 + 4 = 99 (not enough, need 1n minimum)
**3q, 1d, 3n, 2p** = 75 + 10 + 15 + 2 = 102 ✓

Verification: 3 + 1 + 3 + 2 = 9 coins ✓

ANSWER 1: **B**

---

**Problem 2:**

**What we need:** Find positive integers where (I) sum of squares of digits = 50, and (II) digits strictly increase left to right. Find the product of digits of the largest such integer.

**Finding digits:** We need a² + b² + c² + ... = 50 with strictly increasing digits.

Maximum single digit: 7² = 49 (need 1 more)
- 7, 1: 49 + 1 = 50 ✓ (but 1 < 7, violates increasing)
- 6, 5, 3: 36 + 25 + 9 = 70 (too much)
- 6, 4, 2: 36 + 16 + 4 = 56 (too much)
- 5, 5, anything: can't have repeated digits if strictly increasing
- 6, 4, 1: 36 + 16 + 1 = 53 (too much)
- 5, 4, 3: 25 + 16 + 9 = 50 ✓ (strictly increasing: 3 < 4 < 5, so 345)
- 6, 3, 2, 1: 36 + 9 + 4 + 1 = 50 ✓ (strictly increasing: 1236)
- 5, 4, 2, 1: 25 + 16 + 4 + 1 = 46 (not enough)

Largest number with valid digits: 1236 is smaller than 345? No, 1236 > 345.
But we want digits to increase left to right: 1236 has 1 < 2 < 3 < 6 ✓

Between 1236 and 345, the largest is 1236.

Product of digits: 1 × 2 × 3 × 6 = 36

ANSWER 2: **C**

---

**Problem 3:**

**What we need:** Maria buys at 4 for $5, sells at 3 for $5. How many disks to profit $100?

**Setup:**
- Cost per disk: $5/4 = $1.25
- Revenue per disk: $5/3 ≈ $1.667
- Profit per disk: $5/3 - $5/4 = $20/12 - $15/12 = $5/12

**Calculation:**
Number of disks = $100 ÷ ($5/12) = $100 × (12/5) = 1200/5 = 240

ANSWER 3: **D**

---

**Problem 4:**

**What we need:** A 2×2×2 inch cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.

**Setup:**
- Volume ratio: (3/2)³ = 27/8
- Weight of 3×3×3 cube: 3 × (27/8) = 81/8 lbs
- Value scales with weight: $200 × (27/8) = $200 × 27/8 = $5400/8 = $675

ANSWER 4: **E**

---

**Problem 5:**

**What we need:** Jack starts with 128 apples, sells 25% to Jill, then 25% of remainder to June, then gives 1 to teacher.

**Calculation:**
- After Jill: 128 × 0.75 = 96 apples
- After June: 96 × 0.75 = 72 apples
- After teacher: 72 - 1 = 71 apples

ANSWER 5: **D**

---

**Problem 6:**

**What we need:** Probability of at least as many heads as tails in 4 tosses.

**Outcomes:** "At least as many heads as tails" means 2, 3, or 4 heads (since 4 tosses).

- Exactly 2 heads: C(4,2) = 6
- Exactly 3 heads: C(4,3) = 4
- Exactly 4 heads: C(4,4) = 1
- Total: 6 + 4 + 1 = 11

Probability: 11/16

ANSWER 6: **E**

---

**Problem 7:**

**What we need:** Track money through three redistribution rounds. Toy starts and ends with $36.

**Work backwards:** Let initial amounts be A₀, J₀, T₀ = $36.

After Amy gives: A₁ = A₀ - J₀ - T₀; J₁ = 2J₀; T₁ = 2T₀ = 72

After Jan gives: A₂ = 2A₁; J₂ = J₁ - A₁ - T₁; T₂ = 2T₁ = 144

After Toy gives: A₃ = 2A₂; J₃ = 2J₂; T₃ = T₂ - A₂ - J₂ = 36

From T₃ = 36: T₂ - A₂ - J₂ = 36, so 144 - A₂ - J₂ = 36, thus A₂ + J₂ = 108

Since A₃ + J₃ + T₃ = total and A₃ = 2A₂, J₃ = 2J₂:
Total = 2A₂ + 2J₂ + 36 = 2(108) + 36 = 216 + 36 = 252

ANSWER 7: **D**

---

**Problem 8:**

**What we need:** Find possible values of a/|a| + b/|b| + c/|c| + abc/|abc| given a + b + c = 0 and all nonzero.

**Analysis:** Each term x/|x| equals ±1 (sign of x).

If a, b, c > 0: impossible since sum = 0
If a, b, c < 0: impossible since sum = 0
Must have mixed signs.

**Case 1:** Two positive, one negative (say a, b > 0, c < 0)
- a/|a| + b/|b| + c/|c| = 1 + 1 - 1 = 1
- abc < 0, so abc/|abc| = -1
- Total: 1 - 1 = 0

**Case 2:** One positive, two negative (say a > 0, b, c < 0)
- a/|a| + b/|b| + c/|c| = 1 - 1 - 1 = -1
- abc > 0, so abc/|abc| = 1
- Total: -1 + 1 = 0

In both cases the answer is **0**.

ANSWER 8: **A**

---

**Problem 9:**

**What we need:** Find the common number in two sets of four numbers with given averages.

**Setup:**
- First four average to 5: sum = 20
- Last four average to 8: sum = 32
- All seven average to 6 4/7 = 46/7: sum = 7 × 46/7 = 46

**Finding the common number:**
Let x be the common number.
- Sum of first four + sum of last four = 20 + 32 = 52
- But sum of all seven + x = 46 + x (since x is counted twice)

So: 52 = 46 + x, thus x = 6

ANSWER 9: **B**

---

**Problem 10:**

**What we need:** Distribu
openrouter:openai/gpt-5.4-mini B ✗
show
Problem 1:

Let the numbers of pennies, nickels, dimes, and quarters be \(p,n,d,q\), respectively.

We know:
- There are 9 coins total:
\[
p+n+d+q=9
\]
- Their total value is \(\$1.02\), or 102 cents:
\[
p+5n+10d+25q=102
\]
- At least one of each type, so \(p,n,d,q\ge 1\).

We want the number of dimes, \(d\).

Since all 9 coins are at least pennies, if we start with 9 pennies the value is 9 cents. Replacing a penny by:
- a nickel adds 4 cents,
- a dime adds 9 cents,
- a quarter adds 24 cents.

So compared with 9 pennies, we need an extra:
\[
102-9=93
\]
cents.

Because there must be at least one of each coin, start with:
- 1 penny, 1 nickel, 1 dime, 1 quarter = 4 coins.

That leaves 5 more coins to distribute, and the value is:
\[
1+5+10+25=41
\]
cents, so we still need:
\[
102-41=61
\]
more cents from 5 extra coins.

Now each extra coin can increase the value from a penny by:
- nickel: +4
- dime: +9
- quarter: +24

Let us search for a valid combination with 9 total coins. Since quarters are very valuable, try small numbers of quarters.

If \(q=2\), then the value of the remaining 7 coins is:
\[
102-50=52
\]
with \(p+n+d=7\) and \(p,n,d\ge1\).

Subtract 1 penny, 1 nickel, 1 dime from those 7 coins:
\[
1+5+10=16
\]
leaving 4 extra coins and needing:
\[
52-16=36
\]
more cents.

The only way to make 36 cents with 4 coins of pennies/nickels/dimes is:
- three dimes and one penny? Let's check using counts.

Let the extra 4 coins beyond one of each among \(p,n,d\) be arranged. The total extra value above 4 pennies is:
\[
36-(4\times 1)=32
\]
But more directly, solving
\[
p+n+d=7,\quad p+5n+10d=52
\]
Subtract gives
\[
4n+9d=45
\]
Try \(d=1,2,3,4\).  
- \(d=1\): \(4n=36\Rightarrow n=9\), impossible.  
- \(d=2\): \(4n=27\), impossible.  
- \(d=3\): \(4n=18\), impossible.  
- \(d=4\): \(4n=9\), impossible.

So \(q=2\) doesn’t work.

Try \(q=3\). Then remaining 6 coins have value:
\[
102-75=27
\]
with \(p+n+d=6\), \(p,n,d\ge1\).

Subtract one of each:
\[
1+5+10=16
\]
leaving 3 coins and 11 cents to distribute. Since pennies/nickels/dimes can add 0, 4, or 9 cents above a penny, we check:
\[
p+5n+10d=27,\quad p+n+d=6
\]
Subtract:
\[
4n+9d=21
\]
The only positive solution is \(d=1\), giving \(4n=12\), so \(n=3\), and then \(p=2\).

Thus the coin counts are:
\[
p=2,\quad n=3,\quad d=1,\quad q=3
\]
which totals 9 coins and 102 cents:
\[
2+15+10+75=102.
\]

So the number of dimes is \(1\).

ANSWER 1: A

---

Problem 2:

We need the largest positive integer whose digits:
1. have squares summing to 50, and
2. increase from left to right.

Since the digits are strictly increasing, to make the integer as large as possible, we want:
- as many digits as possible, and
- the largest possible final digits.

We need digits with square sum 50.

Try to represent 50 as a sum of squares of distinct digits in increasing order.

Useful squares:
\[
1^2=1,\ 2^2=4,\ 3^2=9,\ 4^2=16,\ 5^2=25,\ 6^2=36,\ 7^2=49
\]

Since digits must be increasing, repeated digits are not allowed.

Now test combinations.

A large digit like 7 uses up 49, leaving 1, so one possibility is \(1,7\), but then the product is \(7\). Yet we should check whether there is a larger integer with more digits.

Try 4 digits, since more digits usually gives a larger integer. We want four distinct increasing digits whose squares sum to 50.

A promising set is:
\[
1^2+2^2+4^2+5^2=1+4+16+25=46
\]
not enough.

Try:
\[
1^2+2^2+3^2+6^2=1+4+9+36=50
\]
This works, giving digits \(1,2,3,6\).

Could there be another 4-digit set with a larger integer? We need increasing digits summing in squares to 50. Check other combinations:
- \(1,2,4,5\) gives 46.
- \(1,3,4,5\) gives \(1+9+16+25=51\), too high.
- \(2,3,4,5\) gives \(4+9+16+25=54\), too high.

So the only 4-digit solution is \(1236\), and any 2-digit solution like \(17\) is smaller than a 4-digit number.

Thus the largest integer is \(1236\), and the product of its digits is:
\[
1\cdot 2\cdot 3\cdot 6=36.
\]

ANSWER 2: C

---

Problem 3:

Maria buys disks at 4 for \$5, so her cost per disk is:
\[
\frac{5}{4}\text{ dollars}
\]
She sells them at 3 for \$5, so her selling price per disk is:
\[
\frac{5}{3}\text{ dollars}
\]

Profit per disk:
\[
\frac{5}{3}-\frac{5}{4}
= \frac{20-15}{12}
= \frac{5}{12}
\]

To make \$100 profit, the number of disks needed is:
\[
100 \div \frac{5}{12}
=100\cdot \frac{12}{5}
=240
\]

So she must sell 240 disks.

ANSWER 3: D

---

Problem 4:

A 2-inch cube has volume:
\[
2^3=8
\]
cubic inches, and it is worth \$200.

So the value per cubic inch is:
\[
\frac{200}{8}=25
\]
dollars per cubic inch.

A 3-inch cube has volume:
\[
3^3=27
\]
cubic inches.

So its value is:
\[
27\cdot 25=675
\]

Therefore the 3-inch cube is worth \$675.

ANSWER 4: E

---

Problem 5:

Jack starts with 128 apples.

He sells 25% of them:
\[
\frac14 \cdot 128=32
\]
So 96 remain.

Then he sells 25% of the 96 remaining:
\[
\frac14 \cdot 96=24
\]
So 72 remain.

Then he gives away one apple to his teacher:
\[
72-1=71
\]

So Jack has 71 apples left.

ANSWER 5: D

---

Problem 6:

Harold tosses a nickel 4 times. We want the probability of getting at least as many heads as tails.

Since there are 4 tosses, “at least as many heads as tails” means:
\[
H\ge T
\]
and because \(H+T=4\), this means \(H=2,3,\) or \(4\).

Count outcomes:
- 2 heads: \(\binom42=6\)
- 3 heads: \(\binom43=4\)
- 4 heads: \(\binom44=1\)

Total favorable outcomes:
\[
6+4+1=11
\]
Total possible outcomes:
\[
2^4=16
\]

So the probability is:
\[
\frac{11}{16}
\]

ANSWER 6: E

---

Problem 7:

Let Amy, Jan, and Toy begin with amounts \(A,J,T\).

Toy started with \$36 and ended with \$36.

Each time one friend gives enough money to double the other two, the giver loses an amount equal to the sum of the recipients’ original amounts, and each recipient doubles.

Let’s track the total money.

When Amy gives Jan and Toy enough to double each of their amounts:
- Jan increases by \(J\)
- Toy increases by \(T\)
So Amy loses \(J+T\).

Thus after Amy’s turn, total money stay
openrouter:openai/gpt-5.4-nano A ✓
show
Problem 1:  
We have 9 coins total: pennies, nickels, dimes, quarters.  
Total value is $1.02, and we have **at least one of each type**. Let the numbers be:
- \(p\) pennies, \(n\) nickels, \(d\) dimes, \(q\) quarters

Then:
1) \(p+n+d+q=9\)  
2) \(1p+5n+10d+25q=102\) (in cents)  
3) \(p,n,d,q \ge 1\)

Since each is at least 1, subtract 1 from each:
Let \(p'=p-1,\; n'=n-1,\; d'=d-1,\; q'=q-1\), all \(\ge 0\).  
Then:
\[
(p'+1)+(n'+1)+(d'+1)+(q'+1)=9 \Rightarrow p'+n'+d'+q'=5
\]
Value equation:
\[
p+5n+10d+25q = (p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102
\]
Compute the constant part:
\[
(p'+1)+5n'+5+10d'+10+25q'+25 = p'+5n'+10d'+25q' + (1+5+10+25)
\]
\[
p'+5n'+10d'+25q' + 41 = 102 \Rightarrow p'+5n'+10d'+25q' = 61
\]

Now use \(p'+n'+d'+q'=5\). Replace \(p' = 5-(n'+d'+q')\):
\[
5-(n'+d'+q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + (-n' - d' - q') + 5n' + 10d' + 25q' = 61
\]
\[
5 + 4n' + 9d' + 24q' = 61
\]
\[
4n' + 9d' + 24q' = 56
\]

Try possible \(q'\) (since \(q'\ge 0\) and \(n'+d'+q'\le 5\), so \(q'\le 5\)):

- If \(q'=0\): \(4n'+9d'=56\).  
  \(d'\) can be 0..5:
  - \(d'=1 \Rightarrow 4n'=47\) no
  - \(d'=2 \Rightarrow 4n'=38\) no
  - \(d'=3 \Rightarrow 4n'=29\) no
  - \(d'=4 \Rightarrow 4n'=20 \Rightarrow n'=5\) works.
  
So \(q'=0,\; d'=4,\; n'=5\). Then
\[
d = d'+1 = 4+1 = 5
\]

- If \(q'=1\): then \(24 + 4n' + 9d' =56 \Rightarrow 4n'+9d'=32\).  
  Test \(d'=0..3\):  
  \(d'=1 \Rightarrow 4n'=23\) no; \(d'=2 \Rightarrow 4n'=14\) no; \(d'=3 \Rightarrow 4n'=5\) no.

Other \(q'\) only make the left side too large.  
Thus \(d=5\).

ANSWER 1: E


Problem 2:  
We want positive integers whose digits satisfy:

(I) Sum of squares of digits is 50.  
(II) Digits are strictly increasing left to right.

Let digits be \(d_1<d_2<\cdots\).

Try to express 50 as a sum of squares of distinct digits (since strictly increasing implies distinct).

Squares of digits:
\[
0,1,4,9,16,25,36,49,64 \text{ for digits } 0\text{ to }9
\]
We need sum 50. Since digits are positive integers, leading digit cannot be 0, but 0 may appear later.

Consider options:

- \(25 + 16 = 41\) remaining 9, so add digit with square 9 i.e. digit 3.  
  Then set of digits could be \(\{2,4,3\}\) but must be increasing: digits would be 2,3,4.  
  Check squares: \(2^2+3^2+4^2=4+9+16=29\) not 50.  
  Wait: we used squares 25 and 16; that corresponds to digits 5 and 4, plus digit 3:
  \[
  25(=5^2)+16(=4^2)+9(=3^2)=25+16+9=50
  \]
  So digits are \(\{3,4,5\}\). This is increasing (3<4<5). Great.

- Any other combination?  
  \(49\) would leave 1, giving digits 7 and 1: \(49+1=50\). Digits would be 1,7 (increasing). Possible.  
  Also \(36\) leaves 14 which can be \(9+4+1\) (digits 3,2,1) but that set would be \{1,2,3,6\} squares \(1+4+9+36=50\), increasing possible (1<2<3<6).

But we must find the **largest such integer**, then take the product of its digits.

Let’s list all valid digit sets (distinct):
1) \(\{3,4,5\}\) gives number 345.  
2) \(\{1,7\}\) gives number 17.  
3) \(\{1,2,3,6\}\) gives number 1236.

Are there more?  
Try \(25+9=34\) remaining 16, so digits \(\{2? no\}\) would be squares 25 (digit 5), 9 (digit 3), 16 (digit 4): that’s actually \(\{3,4,5\}\) already.  
Try \(16+9+1=26\) remaining 24 impossible as squares.  
Try \(36+16=52\) too big.  
So the largest number should be the one with most digits: 1236 has 4 digits, so it’s largest among candidates.

Now product of digits of 1236:
\[
1\cdot 2\cdot 3\cdot 6 = 36
\]
So answer is 36.

ANSWER 2: C


Problem 3:  
Maria buys 4 for $5, so cost per disk:
\[
\frac{5}{4}=1.25
\]
She sells 3 for $5, so selling price per disk:
\[
\frac{5}{3}
\]
Profit per disk:
\[
\frac{5}{3}-\frac{5}{4} = 5\left(\frac{1}{3}-\frac{1}{4}\right)=5\left(\frac{4-3}{12}\right)=5\cdot\frac{1}{12}=\frac{5}{12}
\]
To make profit $100:
\[
n\cdot \frac{5}{12} = 100 \Rightarrow n = 100\cdot \frac{12}{5} = 20\cdot 12 = 240
\]

ANSWER 3: D


Problem 4:  
A 2-inch cube \(2\times2\times2\) has volume proportional to \(2^3\).  
Three-inch cube has volume proportional to \(3^3\).  
Silver density and value per volume are constant, so value scales by the cube of side length.

So multiplier:
\[
\left(\frac{3}{2}\right)^3=\frac{27}{8}
\]
Value of 2-inch cube is $200, so value of 3-inch cube:
\[
200\cdot \frac{27}{8}=25\cdot 27 = 675
\]

ANSWER 4: E


Problem 5:  
Start with 128 apples.

Sell 25% to Jill: remaining is 75%:
\[
128 \cdot \frac{3}{4} = 96
\]
Then sell 25% of those remaining to June: remaining is again 75% of 96:
\[
96 \cdot \frac{3}{4} = 72
\]
He gives the shiniest one to his teacher: subtract 1:
\[
72-1=71
\]

ANSWER 5: D


Problem 6:  
Harold tosses a nickel 4 times. Each toss has probability \(1/2\) heads and \(1/2\) tails.  
“At least as many heads as tails” means:
- Heads = 2,3,4 (since tails = 4,3,2 respectively)

So probability:
\[
P(H\ge 2)=P(2H)+P(3H)+P(4H)
\]
Using binomial coefficients \( \binom{4}{k}\left(\frac12\right)^4\):

\[
P(2H)=\binom{4}{2}\frac{1}{16} = 6\cdot\frac{1}{16}=\frac{6}{16}
\]
\[
P(3H)=\binom{4}{3}\frac{1}{16} = 4\cdot\frac{1}{16}=\frac{4}{16}
\]
\[
P(4H)=\binom{4}{4}\frac{1}{16} = 1\cdot\frac{1}{16}=\frac{1}{16}
\]
Sum:
\[
\frac{6+4+1}{16}=\frac{11}{16}
\]

ANSWER 6: E


Problem 7:  
Let Amy, Jan, Toy initially be \(A, J, T\). Given:
\[
T=36
\]
Each step: one person gives the others enough to **double their amounts**.

Step 1: Amy gives Jan and Toy enough to double theirs.  
So after step 1:
\[
J \to 2J,\quad T \to 2T
\]
Thus Amy gives:
- to Jan: \(2J-J=J\)
- to Toy: \(2T-T=T\)
Total Amy’s giving: \(J+T\)

Step 2: Jan gives Amy and Toy enough to double theirs.  
After step 1, Jan has \(2J\).  
Doubling:
- Amy \(A' \to 2A'\)
- Toy \(2T \to 4T\)

Step 3: Toy gives Amy and Jan enough to double theirs.

We care only about total sum consistency and use the fact Toy starts and ends with 36.

Toy starts \(36\). After step 1 Toy doubles to \(72\).  
After step 2, Toy doubles again to \(144\).  
After step 3, Toy doubles again to \(288\) **unless Toy’s giving changes Toy’s own amount**—but 
openrouter:google/gemini-3.1-flash-lite A ✓
show
Problem 1:
Let $p, n, d, q$ be the number of pennies, nickels, dimes, and quarters.
We have:
1) $p + n + d + q = 9$
2) $1p + 5n + 10d + 25q = 102$
Since $p, n, d, q \ge 1$, let $p' = p-1, n' = n-1, d' = d-1, q' = q-1$.
$p'+n'+d'+q' = 9 - 4 = 5$.
$1(p'+1) + 5(n'+1) + 10(d'+1) + 25(q'+1) = 102 \implies p'+5n'+10d'+25q' = 102 - 41 = 61$.
Since $q' \le 5$, try $q'=2$: $p'+5n'+10d' = 61 - 50 = 11$. $q=3$.
If $d'=1$, $p'+5n'=1$. $n'=0, p'=1$. Total coins: $p=2, n=1, d=2, q=3$. Sum: $2+5+20+75 = 102$. Coins: $2+1+2+3 = 8 \neq 9$.
If $q'=1$: $p'+5n'+10d' = 36$. If $d'=3$, $p'+5n'=6$. $n'=1, p'=1$. Total: $p=2, n=2, d=4, q=2$. Sum: $2+10+40+50 = 102$. Coins: $2+2+4+2 = 10 \neq 9$.
If $q'=2$: $p'+5n'+10d' = 11$. If $d'=0$, $p'+5n'=11$. $n'=2, p'=1$. Total: $p=2, n=3, d=1, q=3$. Sum: $2+15+10+75 = 102$. Coins: $2+3+1+3 = 9$. Correct.
ANSWER 1: A

Problem 2:
Digits $d_1 < d_2 < \dots < d_k$ such that $\sum d_i^2 = 50$.
Possible squares: 1, 4, 9, 16, 25, 36, 49.
If 3 digits: $d_1^2 + d_2^2 + d_3^2 = 50$. Try $d_3=6$ ($36$): $d_1^2+d_2^2=14$ (No). Try $d_3=5$ ($25$): $d_1^2+d_2^2=25$. $3^2+4^2=25$. Digits 3, 4, 5. Product $3 \times 4 \times 5 = 60$.
Check 4 digits: $1^2+2^2+3^2+6^2 = 1+4+9+36 = 50$. Product $1 \times 2 \times 3 \times 6 = 36$.
60 is larger.
ANSWER 2: E

Problem 3:
Cost per disk = $5/4 = 1.25$. Sale price = $5/3 \approx 1.66$.
Profit per disk = $5/3 - 5/4 = (20-15)/12 = 5/12$.
To make $100 profit: $100 / (5/12) = 100 \times 12 / 5 = 20 \times 12 = 240$.
ANSWER 3: D

Problem 4:
The weight and value of a cube are proportional to its volume.
Volume of 2-inch cube = $2^3 = 8$ cubic inches.
Volume of 3-inch cube = $3^3 = 27$ cubic inches.
Value = $(27/8) \times 200 = 27 \times 25 = 675$.
ANSWER 4: E

Problem 5:
Start: 128. Sold to Jill: $0.25 \times 128 = 32$. Remaining: $128 - 32 = 96$.
Sold to June: $0.25 \times 96 = 24$. Remaining: $96 - 24 = 72$.
Gave one away: $72 - 1 = 71$.
ANSWER 5: D

Problem 6:
Total outcomes = $2^4 = 16$.
At least as many heads as tails:
4H, 0T: $\binom{4}{4} = 1$.
3H, 1T: $\binom{4}{3} = 4$.
2H, 2T: $\binom{4}{2} = 6$.
Total = $1+4+6 = 11$. Probability = $11/16$.
ANSWER 6: E

Problem 7:
Let $A, J, T$ be amounts.
1) Amy doubles J, T: $A_1 = A - J - T, J_1 = 2J, T_1 = 2T$.
2) Jan doubles A, T: $A_2 = 2A_1, J_2 = J_1 - A_1 - T_1, T_2 = 2T_1$.
3) Toy doubles A, J: $A_3 = 2A_2, J_3 = 2J_2, T_3 = T_2 - A_2 - J_2$.
Given $T_3 = 36$. Total sum $S = A+J+T$ is constant.
$T_3 = 2T_1 - (2A_1 + J_1 - A_1 - T_1) = 3T_1 - A_1 - J_1 = 3(2T) - (A-J-T) - 2J = 6T - A + J + T = 7T - A + J = 36$.
Since $A+J+T = S$, $A+J = S-T$.
$7T - (S-T) + 2J = 36 \implies 8T - S + 2J = 36$. This is complex.
Actually, $S = A+J+T$. After each step, the total sum $S$ remains constant.
$T_{final} = 36$. In step 3, $T_3 = T_2 - A_2 - J_2 = T_2 - (S - T_2) = 2T_2 - S = 36$.
$T_2 = 2T_1 = 4T$. So $8T - S = 36$.
Since $A, J, T$ must be positive, and $A_1 = A-J-T > 0 \implies A > J+T$.
Testing options: $S=252$. $8T - 252 = 36 \implies 8T = 288 \implies T=36$.
ANSWER 7: D

Problem 8:
$a, b, c$ nonzero, $a+b+c=0$.
$a/|a| + b/|b| + c/|c| + abc/|abc|$.
Possible signs for $(a, b, c)$:
1) $(+, +, -)$: $1 + 1 - 1 - 1 = 0$.
2) $(+, -, -)$: $1 - 1 - 1 + 1 = 0$.
ANSWER 8: A

Problem 9:
Sum of 7 numbers $S = 7 \times (46/7) = 46$.
Let numbers be $x_1, \dots, x_7$.
Sum of first 4: $x_1+x_2+x_3+x_4 = 20$.
Sum of last 4: $x_4+x_5+x_6+x_7 = 32$.
Sum of all: $(x_1+x_2+x_3+x_4) + (x_4+x_5+x_6+x_7) - x_4 = 46$.
$20 + 32 - x_4 = 46 \implies 52 - x_4 = 46 \implies x_4 = 6$.
ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students (each gets $\ge 1$).
Use inclusion-exclusion: $3^5 - \binom{3}{1} 2^5 + \binom{3}{2} 1^5 = 243 - 3(32) + 3(1) = 243 - 96 + 3 = 150$.
ANSWER 10: B

Problem 11:
At 4:20, hour hand is at $4 + 20/60 = 4.333$ hours.
Degrees from 12: $4.333 \times 30^\circ = 130^\circ$.
Minute hand at 20 mins: $20 \times 6^\circ = 120^\circ$.
Angle = $|130 - 120| = 10^\circ$.
ANSWER 11: D

Problem 12:
$N = (10^{94}-1) \times (4/9)(10^{94}-1) = (4/9)(10^{94}-1)^2 = (4/9)(10^{188} - 2 \cdot 10^{94} + 1)$.
$= 4/9 \times (99\dots9800\dots01)$ (93 nines, 93 zeros).
$= 44\dots4355\dots56$ (93 fours, 93 fives).
Sum of digits: $93 \times 4 + 3 + 93 \times 5 + 6 = 372 + 3 + 465 + 6 = 846$.
ANSWER 12: A
openrouter:x-ai/grok-4.3 B ✗
show
Problem 1:
We have nine coins consisting of pennies (\(p\)), nickels (\(n\)), dimes (\(d\)), and quarters (\(q\)), with \(p + n + d + q = 9\) and total value \(p + 5n + 10d + 25q = 102\) (in cents). Each variable is a positive integer. Subtracting the first equation from the second yields the Diophantine equation \(4n + 9d + 24q = 93\).
Since \(q \geq 1\) and \(5 \times 25 = 125 > 102\), the only feasible values are \(q = 1, 2, 3\).
- For \(q = 1\): \(4n + 9d = 69\). Solutions require \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 6\), but then \(n + d + q = 12 > 9\), which is impossible.
- For \(q = 2\): \(4n + 9d = 45\). Again \(d \equiv 1 \pmod{4}\). The candidate \(d = 5\) forces \(n = 0\), violating \(n \geq 1\).
- For \(q = 3\): \(4n + 9d = 21\). The only feasible solution is \(d = 1\), \(n = 3\), which gives \(p = 2 \geq 1\). All other candidates exceed the coin limit or violate positivity.
Thus exactly one value of \(d\) is possible.
ANSWER 1: A
Problem 2:
We seek the largest positive integer whose digits are strictly increasing and whose digits square-sum to 50. The possible digits are the distinct integers from 1 to 9 whose squares sum to 50; the maximal such number is formed by taking the largest possible digits in descending order that satisfy the sum-of-squares condition. The only combination that works is the digits 1, 4, 5, 6, 7 (since \(1 + 16 + 25 + 36 + 49 = 127\) is too large, but the subset 1-4-5-6-7 squares to exactly 50). Their product is \(1 \times 4 \times 5 \times 6 \times 7 = 840\), but the required product of the digits of the number itself is asked, which reduces to the product of those five digits: 840 is extraneous; the direct product is \(4 \times 5 \times 6 \times 7 = 840\) wait, actually the problem asks product of its digits, which is 840, but choices are small, wait correction: the digits are 1,4,5,6,7 product 840? No: choices up to 60, so digits 4,5,6,7? 4+16+25+36=81>50 wait. Actual maximal: digits 1,2,4,7,8? Squares:1+4+16+49+64=134 too big. Correct maximal set whose squares sum exactly 50 with strictly increasing: 1,3,4,6,8? Verify squares sum 1+9+16+36+64=126. The set is 2,4,5,7 (4+16+25+49=94>50). Proper enumeration yields digits 1,5,7,8? 1+25+49+64=139. The unique maximal number is 1789? No. Standard solution: the digits 1,4,5,7 squares 1+16+25+49=91>50. Actual: 2,3,4,5,6 squares 4+9+16+25+36=90. Reduce: omit 6, add nothing. The set 1,2,4,7 squares 1+4+16+49=70. 1,3,5,7:1+9+25+49=84. 2,3,5,6:4+9+25+36=74. 1,4,6,7:1+16+36+49=102. 3,4,5,6:9+16+25+36=86. The only set that sums exactly to 50 is 1,3,4,8?1+9+16+64=90. Wait, smaller: 1,2,3,6,8? Too many. Four digits: 1,4,5,6?1+16+25+36=78. Three: 1,7,8?1+49+64=114. 3,5,6:9+25+36=70. 4,5,7:16+25+49=90. 2,5,7:4+25+49=78. 1,5,8:1+25+64=90. 2,4,8:4+16+64=84. 3,4,7:9+16+49=74. 1,6,7:1+36+49=86. 2,6,7:4+36+49=89. 3,5,8:9+25+64=98. None 50. Two digits: max 1+49=50 yes! 1 and 7? Squares 1+49=50. Digits 1,7 product 7. But is there larger number? Three digits whose squares sum 50: possible squares <50: 1,4,9,16,25,36,49. 49+1=50, needs third 0 invalid. 36+9+4+1=50 yes four. 36+9+4=49 close. 25+16+9=50 yes: digits 3,4,5. Strictly increasing 3<4<5, number 345. Product 3*4*5=60. Larger number? 1,5,7?1+25+49=75>50. 2,3,7:4+9+49=62. 2,5,6:4+25+36=65. No three-digit larger than 345 with sum 50. Four digits: smallest squares 1+4+9+16=30, +25=55>50, can we get exactly 50? 1+4+9+36=50 yes: digits 1,2,3,6. Number 1236, larger than 345, product 1*2*3*6=36. Even larger: 1,2,4,5?1+4+16+25=46<50. 1,3,4,6=1+9+16+36=62>50. So 1236 is candidate. Five? 1+4+9+16+25=55>50, impossible. Thus maximal number is 1236, product of digits 36.
ANSWER 2: C
Problem 3:
Cost: 4 disks for $5, so each costs \(5/4 = 1.25\). Selling: 3 for $5, so each sells for \(5/3 \approx 1.666\). Profit per disk: \(5/3 - 5/4 = (20-15)/12 = 5/12\). To realize $100 profit need \(100 \div (5/12) = 100 \times 12/5 = 240\) disks.
ANSWER 3: D
Problem 4:
Volume scales with cube of linear dimension. Side ratio \(3/2\), volume ratio \((3/2)^3 = 27/8\). Value ratio same: \(200 \times 27/8 = 675\).
ANSWER 4: E
Problem 5:
Sold 25% of 128: remaining \(128 \times 0.75 = 96\). Sold another 25% of 96: remaining \(96 \times 0.75 = 72\). Gave away 1: 71 left.
ANSWER 5: D
Problem 6:
Four tosses, 16 equally likely outcomes. At least as many heads as tails means heads \(\geq 2\). Number of ways: \(\binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 6+4+1=11\). Probability \(11/16\).
ANSWER 6: E
Problem 7:
Work backwards from Toy’s final $36. After Toy doubles Amy and Jan, Toy has half his pre-gift amount plus the final 36, but the invariant that total money is constant yields total \(3 \times 36 = 108\) only if symmetric, but detailed forward simulation with variables shows the only consistent total satisfying all doublings and Toy ending at 36 is 108? Wait, actually standard solution yields 216.
ANSWER 7: C
Problem 8:
Since \(a+b+c=0\), \(c=-(a+b)\). The expression simplifies by cases on signs. When all positive or all negative impossible by sum 0. Two positive one negative: the absolute-value sum equals twice the negative one’s magnitude, and the \(abc/|abc|\) term is \(\pm 1\), producing overall values \(\pm 2\) or 0 when balanced zeros but nonzero. Exhaustive sign patterns give possible values 0, 2, −2.
ANSWER 8: D
Problem 9:
Let the common number be \(x\). Then \(4 \times 5 + x = 20 + x\) wait: sum of first four =20, last four sum=32, total seven numbers sum \(6 + 4/7 \times 7 = 46\). Overcount of x twice: 20+32 −x =52 −x =46 ⇒x=6.
ANSWER 9: B
Problem 10:
Each award can go to any of 3 students, total \(3^5=243\). Subtract cases missing at least one student: \(\binom{3}{1}2^5 - \binom{3}{2}1^5=3\cdot32-3\cdot1=96-3=93\). 243−93=150.
ANSWER 10: B
Problem 11:
At 4:20 the minute hand is at 20×6=120°. Hour hand at 4×30 +20×0.5=120+10=130°. Difference 10°, the acute angle.
ANSWER 11: D
Problem 12:
Let \(N=10^{94}-1\) (94 nines). Then \(N \times 4 \times (10^{94}-1)/9 = (4/9) 
openrouter:meta-llama/llama-4-maverick B ✗
show
## Step 1: Problem 1 - Understand the given problem and constraints.
We have nine coins consisting of pennies, nickels, dimes, and quarters, totaling $1.02, with at least one coin of each type. We need to determine the number of dimes.

## Step 2: Problem 1 - Calculate the total value of the coins with at least one of each type.
Let's start by assigning one coin of each type: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 1 quarter ($0.25). The total value is $0.01 + $0.05 + $0.10 + $0.25 = $0.41. We have 9 - 4 = 5 coins left to make up $1.02 - $0.41 = $0.61.

## Step 3: Problem 1 - Determine the remaining coins to make $0.61 with 5 coins.
To make $0.61 with 5 coins, we should maximize the value. Using quarters is the most efficient way. 2 quarters = $0.50, leaving $0.11 to be made up by 3 coins. We can have 1 dime ($0.10) and 1 penny ($0.01), which totals $0.11. So, we have 2 additional quarters, 1 additional dime, and 2 pennies (but we only need 1 penny to make $0.11 with 1 dime). Thus, a possible distribution is 1 penny, 1 nickel, 2 dimes, and 5 quarters.

## Step 4: Problem 1 - Verify if the distribution satisfies the given conditions.
1 penny + 1 nickel + 2 dimes + 5 quarters = 9 coins. The total value is $0.01 + $0.05 + 2*$0.10 + 5*$0.25 = $0.01 + $0.05 + $0.20 + $1.25 = $1.51, which exceeds $1.02. Let's reconsider: We need to make $0.61 with 5 coins. Using 2 quarters ($0.50) and 1 dime ($0.10) gives $0.60, and we need $0.01 more, which can be achieved with 1 penny. So, we have 1 penny (initial) + 1 penny (additional) = 2 pennies, 1 nickel, 2 dimes, and 3 quarters (1 initial + 2 additional).

## Step 5: Problem 1 - Check the total value and number of coins for the revised distribution.
2 pennies = $0.02, 1 nickel = $0.05, 2 dimes = $0.20, and 3 quarters = $0.75. Total = $0.02 + $0.05 + $0.20 + $0.75 = $1.02. Total coins = 2 + 1 + 2 + 3 = 8, which is less than 9. Let's adjust: We actually need to stick with the initial thought but adjust the coins. Having 1 quarter, 1 dime, 1 nickel, and 1 penny ($0.41) and then adding 5 more coins to make $0.61. If we add 6 dimes, it exceeds the count and value. A feasible combination is having more quarters.

## Step 6: Problem 1 - Reconsider the distribution to meet the exact count and value.
Let's directly check feasible options: If we have 1 penny, 1 nickel, 1 quarter, and 6 dimes, it gives 9 coins. The value is $0.01 + $0.05 + $0.25 + 6*$0.10 = $0.01 + $0.05 + $0.25 + $0.60 = $0.91, which is less than $1.02. Adding more quarters: 1 penny, 1 nickel, 2 dimes, and 5 quarters give $1.51, which is too high. Let's try: 1 penny ($0.01), 1 nickel ($0.05), 3 dimes ($0.30), and 4 quarters ($1.00). Total = $0.01 + $0.05 + $0.30 + $1.00 = $1.36, still too high. Adjusting, if we have 1 penny, 1 nickel, 2 dimes, and 5 quarters, it's too high. Let's adjust to 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), and 4 quarters ($1.00), and then add 2 more coins. We have $1.16, so we need -$0.14. Replacing a quarter with 14 pennies is not feasible due to the count. Let's directly analyze the dime count.

## Step 7: Problem 1 - Analyze the dime count based on the constraints and total value.
Let's directly check: If we have 1 quarter, the remaining $0.77 can be made with 7 coins. Trying different combinations shows that having at least one of each and totaling $1.02 with 9 coins requires a specific distribution. One feasible way is to have more quarters and adjust other coins.

## Step 8: Problem 1 - Finalize the number of dimes based on feasible distributions.
Let's directly test the choices with the condition that we have 9 coins and $1.02. For B (2 dimes), we can have 1 penny, 1 nickel, 2 dimes, and 5 quarters. This gives 9 coins but $1.51, which is too high. Let's adjust: 2 pennies, 1 nickel, 2 dimes, and 4 quarters = $0.02 + $0.05 + $0.20 + $1.00 = $1.27, still too high. Trying 1 penny, 1 nickel, 1 dime, and 6 quarters exceeds the count. For A (1 dime), let's try: 1 penny ($0.01), 1 nickel ($0.05), 1 dime ($0.10), 4 quarters ($1.00), and 2 more coins to make $1.02 - $1.16 = -$0.14. We can adjust to fit.

## Step 9: Problem 1 - Check if having 1 dime satisfies the given conditions.
1 penny, 1 nickel, 1 dime, and 4 quarters = 7 coins, $1.16. We need 2 more coins to make -$0.14. Replacing 1 quarter with 14 pennies (but we only need 2 coins) is not feasible. However, having 1 dime and adjusting other coins: 4 pennies ($0.04), 1 nickel ($0.05), 1 dime ($0.10), and 3 quarters ($0.75) + 1 quarter is too much. Let's directly check a plausible scenario: 1 quarter ($0.25), 1 dime ($0.10), 1 nickel ($0.05), 1 penny ($0.01) = $0.41. Remaining $0.61 with 5 coins can be achieved with 2 quarters ($0.50) and 1 dime ($0.10) and 1 penny ($0.01), totaling 2 dimes.

The final answer is: 
ANSWER 1: B

## Step 1: Problem 2 - Understand the conditions given for the positive integers.
The sum of the squares of the digits is 50, and each digit is larger than the one to its left.

## Step 2: Problem 2 - List the possible squares that sum up to 50.
The squares to consider are 1, 4, 9, 16, 25, 36, and 49. We need to find combinations that sum to 50.

## Step 3: Problem 2 - Find combinations of squares that sum to 50.
Possible combinations are: 1 + 49 = 50 (1 and 7), 1 + 4 + 9 + 36 = 50 (1, 2, 3, and 6).

## Step 4: Problem 2 - Identify the numbers corresponding to these combinations.
For 1 + 49, the number is 17. For 1 + 4 + 9 + 36, the number is 1236.

## Step 5: Problem 2 - Determine the largest such integer and calculate the product of its digits.
The largest number is 1236. The product of its digits is 1*2*3*6 = 36.

The final answer is: 
ANSWER 2: C

## Step 1: Problem 3 - Understand Maria's buying and selling prices.
Maria buys disks at 4 for $5 and sells them at 3 for $5.

## Step 2: Problem 3 - Calculate the cost and selling price per disk.
Cost per disk = $5 / 4 = $1.25. Selling price per disk = $5 / 3.

## Step 3: Problem 3 - Determine the profit per disk.
Profit per 
openrouter:deepseek/deepseek-v4-pro A ✓
show
**Problem 1:**
We have pennies (1¢), nickels (5¢), dimes (10¢), quarters (25¢), and total is $1.02 = 102¢.
At least one of each type.
Let p, n, d, q be numbers of each.
p + 5n + 10d + 25q = 102, and p, n, d, q ≥ 1.

We want number of dimes (d). Since p is number of pennies, p ≡ 102 (mod 5) ⇒ 102 mod 5 = 2, so p ≡ 2 (mod 5). Minimum p=2 (since p≥1, but could be more, e.g., 7,12,...). But p affects the total.

Subtract the required one of each coin:
One of each: 1 + 5 + 10 + 25 = 41¢.
Remaining value: 102 - 41 = 61¢.
Remaining coins: (p-1) pennies, (n-1) nickels, (d-1) dimes, (q-1) quarters, all nonnegative integers.
We need to make 61¢ with these.

Let remaining pennies = p', nickels = n', dimes = d', quarters = q'.
Total value: p' + 5n' + 10d' + 25q' = 61.
Also p' ≡ 61 mod 5 => 61 mod 5 = 1, so p' ≡ 1 mod 5. p' could be 1, 6, 11, ... but p' ≤ 61.

We want to find d+1 = d' + 1? Actually original d = d' + 1.
So we need to determine possible d'. Since d' is number of dimes after the first one.

We can try to minimize or maximize d'? We only need to know which answer fits.
Possible dimes choices: 1,2,3,4,5. So d' can be 0,1,2,3,4.

Try to see if a solution exists for each? But typically such problems have unique answer.
We need to find a combination using quarters, since quarters are largest.
Maximum quarters: q' max = floor(61/25)=2. So q' = 0,1,2.

Case q'=2: 50¢, remainder 11¢. Then p' + 5n' + 10d' = 11.
p' ≡ 1 mod 5, so p' possibilities: 1, 6, 11.
If p'=1: 5n' + 10d' = 10 => n' + 2d' = 2.
Possible (n', d') nonnegative integers: d'=0, n'=2; d'=1, n'=0. So d' can be 0 or 1. So d = d'+1 = 1 or 2.
If p'=6: remainder 5 => 5n'+10d'=5 => n'+2d'=1 => n'=1, d'=0. So d=1.
If p'=11: remainder 0, then n'=d'=0, so d=1.
So d can be 1 or 2 here.

Case q'=1: 25¢, remainder 36¢.
p' + 5n' + 10d' = 36, p' ≡ 1 mod 5.
p'=1: remainder 35 => 5n'+10d'=35 => n'+2d'=7. d' can be 0,1,2,3. d=1,2,3,4.
p'=6: remainder 30 => n'+2d'=6 => d'=0..3 => d=1..4.
p'=11: remainder 25 => n'+2d'=5 => d'=0,1,2 => d=1,2,3.
p'=16: remainder 20 => n'+2d'=4 => d'=0,1,2 => d=1,2,3.
p'=21: remainder 15 => n'+2d'=3 => d'=0,1 => d=1,2.
p'=26: remainder 10 => n'+2d'=2 => d'=0,1 => d=1,2.
p'=31: remainder 5 => n'+2d'=1 => d'=0 => d=1.
p'=36: remainder 0 => n'=d'=0 => d=1.
So d possible: 1,2,3,4.

Case q'=0: remainder 61¢.
p' + 5n' + 10d' = 61, p' ≡ 1 mod 5.
p'=1: 5n'+10d'=60 => n'+2d'=12 => d' max 6 => d up to 7, but choices only up to 5, so possible.
But we need at least one of each coin original => n' and q'? Wait, we already included at least one quarter? If q'=0, that means q=1 quarter total. Still okay. So many possibilities, d can be 1,2,3,4,5.

But we must check if we can have a unique answer? Maybe there's a constraint I missed: "collection of pennies, nickels, dimes, and quarters" with at least one of each. No other constraints. The problem might imply that the number of dimes is uniquely determined? No, it says "How many dimes must you have?" meaning what must be true in all possible such collections? The word "must" indicates that regardless of the distribution satisfying the conditions, the number of dimes is fixed.

Check if d=1 is forced? No, we found d=2 also possible. But maybe some combinations are impossible because of the number of pennies? Let's re-examine: we must have at least one penny, nickel, dime, quarter. When we set p'=1, we have total pennies= p'+1 = 2. That's fine.
Check if any solution with d=2 exists?
Yes, e.g., q'=2, p'=1, d'=1, n'=0 => original: q=3, d=2, n=1, p=2. Total value: 3*25 + 2*10 + 1*5 + 2*1 = 75+20+5+2=102. Yes. So d=2 works.
What about d=3? q'=1, p'=1, d'=2, n'+2*2=7 => n'=3 => original: q=2, d=3, n=4, p=2. Total: 50+30+20+2=102. Works.
So d is not unique? But maybe "must" indicates that in ALL possible collections, dimes are the same? That contradicts finding multiple.
Let me re-read: "How many dimes must you have?" Might be interpreted as "What is the number of dimes you have?" assuming there's a unique solution given the constraints? But we have multiple solutions. Let's check if there's any implicit constraint like "collection" means set? No.
Wait, maybe I made a mistake: The total is $1.02 with at least one of each. Are all coins used exactly nine coins? "You have nine coins" - oh! I missed that! The problem says: "You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type." Yes! Nine coins total. That's the key constraint I missed. Let's incorporate that.

Total coins = p+n+d+q = 9.
We had p'+n'+d'+q' = 9 - 4 = 5 remaining coins.
And value remaining = 61.
p' + 5n' + 10d' + 25q' = 61.
p'+n'+d'+q' = 5.
All nonnegative integers.

Now solve:
From coins: n' = 5 - p' - d' - q'.
Plug into value:
p' + 5(5 - p' - d' - q') + 10d' + 25q' = 61
=> p' + 25 - 5p' - 5d' - 5q' + 10d' + 25q' = 61
=> -4p' + 5d' + 20q' + 25 = 61
=> -4p' + 5d' + 20q' = 36
=> 5d' + 20q' = 36 + 4p'.
Since left side is multiple of 5, right side must be multiple of 5. 36 mod 5 = 1, so 4p' ≡ -1 ≡ 4 mod 5 => multiply by inverse of 4 mod 5 (4*4=16≡1) => p' ≡ 4*4=16≡1 mod 5? Actually 4p' ≡ 4 mod 5 => divide by 4? 4 and 5 coprime, so p' ≡ 1 mod 5. So p' = 1, 6, 11, ... but p' ≤ 5 (since total remaining coins =5). So p' = 1 only. (p'=6 >5 impossible). So p'=1 exactly.

Then p = p'+1 = 2 pennies.
Now equation: 5d' + 20q' = 36 + 4(1) = 40.
Divide by 5: d' + 4q' = 8.
And coin count: n' = 5 - p' - d' - q' = 4 - d' - q'.
Also n' ≥ 0 => d' + q' ≤ 4.
But from d' + 4q' = 8, and d', q' nonnegative integers.

Possible q':
q'=0 => d'=8 => d'+q'=8 >4 impossible.
q'=1 => d'=4 => d'+q'=5 >4 impossible.
q'=2 => d'=0 => d'+q'=2 ≤4, n' = 4-0-2=2. Works.
q'=3 => d'=-4 impossible.
So only solution: q'=2, d'=0, p'=1, n'=2.
Thus original: q = q'+1 = 3, d = d'+1 = 1, n = n'+1 = 3, p = 2.
Check total coins: 3+1+3+2 = 9. Value: 75+10+15+2 = 102¢.
So number of dimes = 1.
Thus answer is A. 1.

ANSWER 1: A

**Problem 2:**
Positive integers with digits such that:
(I) sum of squares
openrouter:qwen/qwen3.7-max A ✓
show
Problem 1:
We need to find the number of dimes among 9 coins (pennies, nickels, dimes, quarters) totaling $1.02 (102¢), with at least one of each type.

Let p, n, d, q be the counts. We have:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102
- p, n, d, q ≥ 1

Substituting p' = p−1, n' = n−1, d' = d−1, q' = q−1 (all ≥ 0):
- p' + n' + d' + q' = 5
- p' + 5n' + 10d' + 25q' = 102 − 41 = 61

Testing q' = 2 (so q = 3): p' + 5n' + 10d' = 11 and p' + n' + d' = 3.
Substituting p' = 3 − n' − d': 4n' + 9d' = 8. Only solution: d' = 0, n' = 2, p' = 1.
This gives p = 2, n = 3, d = 1, q = 3. Check: 2 + 15 + 10 + 75 = 102 ✓ and 2+3+1+3 = 9 ✓

Testing q' = 1: 4n' + 9d' = 32 with p'+n'+d' = 4. No valid non-negative integer solutions.
Testing q' = 0: 4n' + 9d' = 56 with p'+n'+d' = 5. No valid solutions.

The only solution is d = 1.

ANSWER 1: A

Problem 2:
We need positive integers with strictly increasing digits whose squares sum to 50. We want the largest such integer.

Squares of digits 1–9: 1, 4, 9, 16, 25, 36, 49, 64, 81.

Finding all subsets of {1,...,9} with distinct elements whose squares sum to 50:
- Size 2: {1, 7} → 1 + 49 = 50 ✓ → number 17
- Size 3: {3, 4, 5} → 9 + 16 + 25 = 50 ✓ → number 345
- Size 4: {1, 2, 3, 6} → 1 + 4 + 9 + 36 = 50 ✓ → number 1236
- Size 5+: Minimum sum is 1+4+9+16+25 = 55 > 50, so impossible.

The valid numbers are 17, 345, and 1236. The largest is 1236 (4 digits beats 3 or 2 digits).

Product of digits: 1 × 2 × 3 × 6 = 36.

ANSWER 2: C

Problem 3:
Cost per disk = $5/4 = $1.25
Revenue per disk = $5/3 ≈ $1.667
Profit per disk = 5/3 − 5/4 = 20/12 − 15/12 = $5/12

Number of disks for $100 profit:
100 ÷ (5/12) = 100 × 12/5 = 240 disks.

ANSWER 3: D

Problem 4:
Value of silver is proportional to volume.
- 2-inch cube volume = 2³ = 8 cubic inches → worth $200
- 3-inch cube volume = 3³ = 27 cubic inches

Value = $200 × (27/8) = $200 × 3.375 = $675.

ANSWER 4: E

Problem 5:
Start: 128 apples
- Sells 25% to Jill: 128 × 0.25 = 32 sold. Remaining: 128 − 32 = 96
- Sells 25% of remaining to June: 96 × 0.25 = 24 sold. Remaining: 96 − 24 = 72
- Gives 1 to teacher: 72 − 1 = 71

ANSWER 5: D

Problem 6:
Four coin tosses, total outcomes = 2⁴ = 16.
"At least as many heads as tails" means heads ≥ 2.

- P(2 heads) = C(4,2) = 6
- P(3 heads) = C(4,3) = 4
- P(4 heads) = C(4,4) = 1

P(heads ≥ 2) = (6 + 4 + 1)/16 = 11/16.

ANSWER 6: E

Problem 7:
Let initial amounts be A (Amy), J (Jan), T = 36 (Toy).

**Step 1** (Amy doubles Jan and Toy): Amy = A−J−T, Jan = 2J, Toy = 2T
**Step 2** (Jan doubles Amy and Toy): Amy = 2(A−J−T), Jan = 2J−(A−J−T)−2T = 3J−A−T, Toy = 4T
**Step 3** (Toy doubles Amy and Jan): Amy = 4(A−J−T), Jan = 2(3J−A−T), Toy = 4T − 2(A−J−T) − (3J−A−T) = 7T − A − J

Toy ends with 36: 7(36) − A − J = 36 → 252 − A − J = 36 → A + J = 216

Total = A + J + T = 216 + 36 = $252.

ANSWER 7: D

Problem 8:
Since x/|x| = sign(x), let S = sign(a) + sign(b) + sign(c) + sign(abc).

Since a + b + c = 0 with all nonzero, we can't have all same sign. Two cases:
- **Two positive, one negative** (e.g., a,b > 0, c < 0): S = 1 + 1 + (−1) + sign(negative) = 1 + 1 − 1 − 1 = 0
- **One positive, two negative** (e.g., a > 0, b,c < 0): S = 1 + (−1) + (−1) + sign(positive) = 1 − 1 − 1 + 1 = 0

In every case, S = 0.

ANSWER 8: A

Problem 9:
Let the seven numbers be x₁ through x₇.
- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

The overlap is x₄: (Sum of first 4) + (Sum of last 4) = (Sum of all 7) + x₄
20 + 32 = 46 + x₄ → x₄ = 6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each getting ≥ 1 (onto functions).

Using inclusion-exclusion:
3⁵ − C(3,1)·2⁵ + C(3,2)·1⁵ = 243 − 3(32) + 3(1) = 243 − 96 + 3 = 150.

Verification by partition type:
- 3+1+1: C(3,1) × C(5,3) × 2! = 3 × 10 × 2 = 60
- 2+2+1: C(3,1) × C(5,1) × C(4,2) = 3 × 5 × 6 = 90
Total: 60 + 90 = 150.

ANSWER 10: B

Problem 11:
At 4:20 PM:
- Minute hand: 20 min → 20/60 × 360° = 120° from 12
- Hour hand: 4 hours + 20 min → 4 × 30° + (20/60) × 30° = 120° + 10° = 130° from 12

Acute angle = |130° − 120°| = 10°.

ANSWER 11: D

Problem 12:
Let's find the pattern by computing small cases:
- k=1: 9 × 4 = 36 → digit sum = 9
- k=2: 99 × 44 = 4356 → digit sum = 4+3+5+6 = 18
- k=3: 999 × 444 = 443556 → digit sum = 4+4+3+5+5+6 = 27
- k=4: 9999 × 4444 = 44435556 → digit sum = 4+4+4+3+5+5+5+6 = 36

Pattern: The product has (k−1) fours, one 3, (k−1) fives, and one 6.
Digit sum = 4(k−1) + 3 + 5(k−1) + 6 = 9k.

For k = 94: digit sum = 9 × 94 = 846.

ANSWER 12: A
openrouter:moonshotai/kimi-k2.6 A ✓
show
 **Problem 1:**
We have nine coins consisting of pennies (1¢), nickels (5¢), dimes (10¢), and quarters (25¢).  
Let \(p,n,d,q\) be the numbers of each coin. We are told:

\[
p+n+d+q=9,\qquad p+5n+10d+25q=102,
\]

with \(p,n,d,q\ge 1\).  
Subtract the first equation from the second:

\[
4n+9d+24q=93.
\]

Since each variable is at least 1, test possible values of \(q\):

- If \(q=3\): \(4n+9d=21\). With \(d=1\) we get \(4n=12\Rightarrow n=3\). Then \(p=9-(3+1+3)=2\). This works: \(2(1)+3(5)+1(10)+3(25)=102\).
- If \(q=2\): \(4n+9d=45\). The only positive integer solutions have \(n+d>8\), forcing \(p<1\), impossible.
- If \(q=1\): \(4n+9d=69\). Solutions again require \(n+d>8\), impossible.

Thus the only valid solution is \(d=1\). The number of dimes is forced to be 1.

ANSWER 1: A

---

**Problem 2:**
We need strictly increasing digits whose squares sum to 50.  
Squares of digits 1–9: \(1,4,9,16,25,36,49\).

- **Two digits:** \(1^2+7^2=50\) gives 17.
- **Three digits:** \(3^2+4^2+5^2=9+16+25=50\) gives 345.
- **Four digits:** \(1^2+2^2+3^2+6^2=1+4+9+36=50\) gives 1236.
- **Five digits:** The smallest possible sum of five distinct positive squares is \(1+4+9+16+25=55>50\), impossible.

The largest such integer is the 4-digit number 1236.  
The product of its digits is \(1\cdot2\cdot3\cdot6=36\).

ANSWER 2: C

---

**Problem 3:**
Maria’s cost per disk is \(\frac{\$5}{4}=\$1.25\).  
Her selling price per disk is \(\frac{\$5}{3}\).  
Profit per disk:

\[
\frac{5}{3}-\frac{5}{4}=\frac{20-15}{12}=\frac{5}{12}\text{ dollars}.
\]

To earn \$100 profit:

\[
\text{Number of disks}=\frac{100}{5/12}=100\cdot\frac{12}{5}=240.
\]

Check: Cost \(=240\cdot\frac{5}{4}=300\), Revenue \(=240\cdot\frac{5}{3}=400\), Profit \(=100\).

ANSWER 3: D

---

**Problem 4:**
Value is proportional to volume (same material).  
Volume of \(2\times2\times2\) cube: \(2^3=8\).  
Volume of \(3\times3\times3\) cube: \(3^3=27\).

\[
\text{Worth}=200\cdot\frac{27}{8}=25\cdot27=675\text{ dollars}.
\]

ANSWER 4: E

---

**Problem 5:**
Start with 128 apples.

1. Sell 25% to Jill: \(0.25\times128=32\) sold. Remaining: \(128-32=96\).
2. Sell 25% of remaining to June: \(0.25\times96=24\) sold. Remaining: \(96-24=72\).
3. Give 1 to teacher: \(72-1=71\).

ANSWER 5: D

---

**Problem 6:**
“At least as many heads as tails’’ in 4 tosses means 2, 3, or 4 heads.

\[
\binom{4}{2}+\binom{4}{3}+\binom{4}{4}=6+4+1=11
\]

favorable outcomes out of \(2^4=16\) total.

\[
P=\frac{11}{16}.
\]

ANSWER 6: E

---

**Problem 7:**
Let Amy, Jan, Toy start with \(A\), \(J\), \(36\).

1. **Amy gives:** Jan and Toy double.  
   New amounts: \(A-J-36,\; 2J,\; 72\).

2. **Jan gives:** Amy and Toy double.  
   New amounts: \(2(A-J-36),\; 2J-(A-J-36)-72=3J-A-36,\; 144\).

3. **Toy gives:** Amy and Jan double.  
   Toy ends with \(144-\bigl[2(A-J-36)\bigr]-\bigl[3J-A-36\bigr]\).

We are told Toy ends with 36:

\[
144-2(A-J-36)-(3J-A-36)=36.
\]

Simplify:

\[
144-2A+2J+72-3J+A+36=36\;\Rightarrow\;A+J=216.
\]

Total money is constant:

\[
A+J+36=216+36=252.
\]

ANSWER 7: D

---

**Problem 8:**
For any nonzero real \(x\), \(\frac{x}{|x|}\) is its sign: \(+1\) or \(-1\).  
Since \(a+b+c=0\) with all nonzero, they cannot all have the same sign.

- **Case 1:** Two positive, one negative.  
  \(\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}=1+1-1=1\).  
  \(abc<0\), so \(\frac{abc}{|abc|}=-1\).  
  Total: \(1+(-1)=0\).

- **Case 2:** Two negative, one positive.  
  Signs sum to \(-1\). \(abc>0\), so the last term is \(+1\).  
  Total: \(-1+1=0\).

Thus the expression is always 0.

ANSWER 8: A

---

**Problem 9:**
Let the seven numbers be \(a_1,a_2,a_3,a_4,a_5,a_6,a_7\).  
The first four sum to \(4\times5=20\).  
The last four sum to \(4\times8=32\).  
The average of all seven is \(6\frac{4}{7}=\frac{46}{7}\), so their total sum is \(46\).

Adding the two four-number sums counts the common middle number \(a_4\) twice:

\[
20+32=46+a_4\;\Rightarrow\;a_4=6.
\]

ANSWER 9: B

---

**Problem 10:**
Distribute 5 distinct awards to 3 distinct students so each gets at least one.  
Use inclusion–exclusion:

\[
3^5-\binom{3}{1}2^5+\binom{3}{2}1^5=243-3\cdot32+3\cdot1=243-96+3=150.
\]

ANSWER 10: B

---

**Problem 11:**
At 4:20, the hour hand has moved \(4+\frac{20}{60}=\frac{13}{3}\) hours from 12.  
Each hour represents \(30^\circ\), so the hour hand is at \(\frac{13}{3}\times30^\circ=130^\circ\).  
The minute hand at 20 minutes is at \(20\times6^\circ=120^\circ\).  
The acute angle between them is \(|130^\circ-120^\circ|=10^\circ\).

ANSWER 11: D

---

**Problem 12:**
Look at small cases:

\[
\begin{aligned}
9\times4 &= 36,\\
99\times44 &= 4356,\\
999\times444 &= 443556,\\
9999\times4444 &= 44435556.
\end{aligned}
\]

Pattern: for a string of \(n\) nines times a string of \(n\) fours, the product is  
\((n-1)\) fours, followed by 3, followed by \((n-1)\) fives, followed by 6.

For \(n=94\): the digit sum is

\[
93\cdot4+3+93\cdot5+6=93(4+5)+9=93\cdot9+9=94\cdot9=846.
\]

ANSWER 12: A
openrouter:z-ai/glm-5.1 A ✓
show
## Problem 1:
We have nine coins (pennies, nickels, dimes, quarters) worth $1.02 = 102¢, with at least one of each type.

Let p, n, d, q be the counts. Then:
- p + n + d + q = 9
- p + 5n + 10d + 25q = 102

Subtracting: **4n + 9d + 24q = 93**

Since p ≥ 1, we need n + d + q ≤ 8.

**Trying q = 1:** 4n + 9d = 69. Testing d = 1,2,...,7: no valid (n,d) gives integer n with n + d + q ≤ 8.

**Trying q = 2:** 4n + 9d = 45. Testing: d = 1 gives n = 9 (p = -3, invalid). No valid solutions.

**Trying q = 3:** 4n + 9d = 21. 
- d = 1: 4n = 12, so n = 3, p = 9 - 3 - 1 - 3 = 2 ✓

**Check:** 2(1) + 3(5) + 1(10) + 3(25) = 2 + 15 + 10 + 75 = 102 ✓

**Trying q = 4:** 4n + 9d = -3 (impossible)

The only solution has **d = 1**.

ANSWER 1: A

---

## Problem 2:
We need digits whose squares sum to 50, with each digit strictly larger than the previous.

**2 digits:** a² + b² = 50, a < b → 1 + 49 = 50 gives a=1, b=7 → **17**

li>
**3 digits:** a² + b² + c² = 50, a < b < c → 9 + 16 + 25 = 50 → a=3, b=4, c=5 → **345**</li>
**4 digits:** a² + b² + c² + d² = 50 → 1 + 4 + 9 + 36 = 50 → a=1, b=2, c=3, d=6 → **1236**</li>
**5 digits:** Minimum sum = 1+4+9+16+25 = 55 > 50, impossible.

The largest such integer is **1236**. Product = digits = 1 × 2 = **36**.

ANSWER 2: C

---

## Problem 3:
- Cost per disk = $5/4 = $1.25
- Revenue per disk = $5/3 ≈ $1.667
- Profit per disk = $5/3 - $5/4 = $5(4-3)/12 = **$5/12**

To make $100 profit: ($5/12) × n = $100, so n = 100 × 12/5 = **240**.

ANSWER 3: D

---

## Problem 4:
Value is proportional to volume ( the same material.

- 2×2×2 cube: volume = 8 in³, worth $200
- 3×3×3 cube: volume = 27 in in³

Value = $200 × (27/8) 675

ANSWER 4: E E

---

## Problem 5:
- Start: 128 apples
- Sell 25% to Jill: 128 × 0.25 = = 32 sold, remaining = 96
- Sell 25% of remaining to June: 96 × 0.25 = 24 sold, remaining = 72
- Give 1 to teacher: 72 - 1 = **71**

ANSWER 5: D

---

## Problem 6:
"At least as many heads as tails" in 4 tosses means: 2H2T, 3H1T, or 4H0T.

- P(4H) = C(4,4)(1/2)⁴ = 1/16
- P(3H1T) = C(4,3)(1/2)⁴ = 4/16
- P(2H2T) = C(4,2)(1/2)⁴ = 6/16

Total = (1 + 4 + 6)/16 = **11/16**

ANSWER 6: E

---

## Problem 7:
Let initial amounts be A, J, T with T = 36.

**After Amy doubles Jan and Toy:** Amy: A - J - T, Jan: 2J, Toy: 2T

**After Jan doubles Amy and Toy:** 
- Jan gives (A - J - T) + 2T = A - J + T
- Amy: 2(A - J - T), Jan: 3J - A - T, Toy: 4T

**After Toy doubles Amy and Jan:**
- Toy gives 2(A - J - T) + (3J - A - T) = A + J - 3T
- Toy's final: 4T - (A + J - 3T) = 7T - A - J

Given Toy ends with $36: 7(36) - A - J = 36, so A + J = 216.

Total = A + J + T = 216 + 36 = **$252**

ANSWER 7: D

---

## Problem 8:
Given a + b + c = 0, find possible values of a/|a| + b/|b| + c/|c| + abc/|abc|.

Since a + b + c = 0, the signs can't all be the same.

**Case 1: Two positive, one negative** (say a,b > 0, c < 0):
abc < 0, so: 1 + 1 + (-1) + (-1) = **0**

**Case 2: One positive, two negative** (say a > 0, b,c < 0):
abc > 0, so: 1 + (-1) + (-1) + 1 = **0**

In all cases, the value is **0**.

ANSWER 8: A

---

## Problem 9:
Let the seven numbers be a₁, a₂, ..., a₇. The common number is a₄.

- Sum of first four = 4 × 5 = 20
- Sum of last four = 4 × 8 = 32
- Sum of all seven = 7 × (46/7) = 46

Since a₄ is counted in both groups of four:
20 + 32 - a₄ = 46, so a₄ = **6**

ANSWER 9: B

---

## Problem 10:
5 different awards to 3 students, each student gets at least one. This is the number of surjections from a 5-set to a 3-set:

By inclusion-exclusion: 3⁵ - C(3,1)·2⁵ + C(3,2)·1⁵ = 243 - 96 + 3 = **150**

ANSWER 10: B

---

## Problem 11:
At 4:20 PM:
- **Minute hand:** 20 × 6° = 120° from  12°
- **Hour hand:** 4 × 30° +  20 × 0.5° = 120° from 12°

Angle between them = |130° - 120°| = **10°**

ANSWER 11: D D

---

## Problem 1212:
Let n = 94. Compute 999...99 (n nines) × 4444...44 (n fours).

 then find the digit sum.

**Pattern for small n:**
- n = 2: 99 × 44 = 43556
 4li>
- n = 3: 999 × 444 = 443556
- n = 4: 9999 × 4444 = 44435556

The pattern is: **(n-1) fours, then 3, then (n-1) f 5s, then 6 6**.

For n = 94: 93 fours, 3, 93 fives, 6.

Digit sum = 93(4) + 3 + 93(5) + 6 = 372 + 3 + 465 + 6 = **846**

ANSWER 12: A
openrouter:minimax/minimax-m2.7 – ⚠ timed out after 900s — too slow / stuck in reasoning to answer all questions in one call (counted as a fail)
openrouter:baidu/ernie-4.5-vl-424b-a47b – ✗
show
Problem 1:
We have nine coins: pennies (1 cent), nickels (5 cents), dimes (10 cents), and quarters (25 cents), with a total value of 102 cents. We need at least one of each type. Let:
- $ p $ = number of pennies
- $ n $ = number of nickels
- $ d $ = number of dimes
- $ q $ = number of quarters

We have:
$$ p + n + d + q = 9 $$
$$ p + 5n + 10d + 25q = 102 $$

Since there's at least one of each, $ p, n, d, q \geq 1 $. Subtract the first equation from the second:
$$ 4n + 9d + 24q = 93 $$

We need integer solutions. Try $ q = 1 $:
$$ 4n + 9d + 24 = 93 \implies 4n + 9d = 69 $$

Now, $ d $ must be such that $ 4n = 69 - 9d $ is divisible by 4. Try $ d = 1 $:
$$ 4n + 9 = 69 \implies 4n = 60 \implies n = 15 $$
But $ p + n + d + q = p + 15 + 1 + 1 = 9 \implies p = -8 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 69 \implies 4n = 24 \implies n = 6 $$
Then $ p + 6 + 5 + 1 = 9 \implies p = -3 $ (invalid).

Try $ d = 3 $:
$$ 4n + 27 = 69 \implies 4n = 42 \implies n = 10.5 $$ (invalid).

Try $ d = 7 $:
$$ 4n + 63 = 69 \implies 4n = 6 \implies n = 1.5 $$ (invalid).

Now $ q = 2 $:
$$ 4n + 9d + 48 = 93 \implies 4n + 9d = 45 $$
Try $ d = 1 $:
$$ 4n + 9 = 45 \implies 4n = 36 \implies n = 9 $$
Then $ p + 9 + 1 + 2 = 9 \implies p = -3 $ (invalid).

Try $ d = 5 $:
$$ 4n + 45 = 45 \implies 4n = 0 \implies n = 0 $$ (invalid, need at least one).

Try $ d = 3 $:
$$ 4n + 27 = 45 \implies 4n = 18 \implies n = 4.5 $$ (invalid).

Try $ d = 1 $ didn't work, but $ q = 3 $:
$$ 4n + 9d + 72 = 93 \implies 4n + 9d = 21 $$
Try $ d = 1 $:
$$ 4n + 9 = 21 \implies 4n = 12 \implies n = 3 $$
Then $ p + 3 + 1 + 3 = 9 \implies p = 2 $

Check: $ 2 + 3 + 1 + 3 = 9 $ coins, and $ 2 \times 1 + 3 \times 5 + 1 \times 10 + 3 \times 25 = 2 + 15 + 10 + 75 = 102 $. Valid.

Thus, dimes $ d = 1 $.

ANSWER 1: A

Problem 2:
We need numbers where digits increase left to right, and sum of squares of digits is 50. Largest such number: try digits 1,2,3,4,5,6,7,8,9.

Possible combinations:
- 1,3,4,6: $ 1^2 + 3^2 + 4^2 + 6^2 = 1 + 9 + 16 + 36 = 62 $ (too big)
- 1,2,5,6: $ 1 + 4 + 25 + 36 = 66 $ (too big)
- 1,3,5,5: digits not increasing
- 3,4,5: $ 9 + 16 + 25 = 50 $, digits 3,4,5 (increasing), product $ 3 \times 4 \times 5 = 60 $
- 1,4,5,6: $ 1 + 16 + 25 + 36 = 78 $ (too big)
- 1,2,3,7: $ 1 + 4 + 9 + 49 = 63 $ (too big)
- 1,2,4,5,6: $ 1 + 4 + 16 + 25 + 36 = 82 $ (too big)
- 1,3,4,5: $ 1 + 9 + 16 + 25 = 51 $ (close)
- 1,2,3,6: $ 1 + 4 + 9 + 36 = 50 $, digits 1,2,3,6 (increasing), product $ 1 \times 2 \times 3 \times 6 = 36 $

36 vs 60: 60 is larger, but 3,4,5 is three digits, 1,2,3,6 is four digits. Larger number means more digits, so 1,2,3,6 is larger than 3,4,5. Product 36.

But 50: also 5^2 + 5^2 = 50, but digits not increasing. Or 7^2 + 1^2 + 0^2 but 0 not positive.

Another: 2,4,4,4: not increasing. So 1,2,3,6 is valid, product 36.

But is there larger? 1,2,5, something? 1+4+25=30, need 20, no digit. 1,3,4,6 too big. So 1,2,3,6 is largest? But 1,2,3,6 vs 3,4,5: 1236 vs 345, 1236 is larger. Product 36.

But 60 is from 3,4,5, but 345 < 1236? No, 345 is 345, 1236 is 1236, 1236 is larger. But product 36 < 60? The question is product of digits of the largest such integer. Largest integer is 1236? But 6312 is not increasing. Only increasing digits, so 1236 is largest? But 1245? $1+16+16+25=58$ no. 1236 is 1,2,3,6.

Another: 2,3,5: $4+9+25=38$ no. 1,4,3,6 not increasing. So 1,2,3,6 is largest, product 1*2*3*6=36.

But 3,4,5 is 345, but 1236 is larger number? 1236 vs 345, 1236 is larger. But digits must be increasing from left to right, so 1236: 1<2<3<6, yes. 345: 3<4<5, but 345 is smaller than 1236? No, 345 is three-digit, 1236 is four-digit, so 1236 is larger. But 1236 is 1236, 345 is 345, numerically 1236 > 345, but the number is the integer, so 1236 is larger than 345. But in terms of value, yes. But is there a four-digit number larger than 1236? Like 1245? $1+16+16+25=58$ no. 1345: $1+9+16+25=51$ no. So 1236 is largest, product 36.

But earlier 3,4,5 gives 60, but 345 is smaller than 1236? But the integer is the number, so 1236 is larger than 345. But 1236 has product 36, 345 has 60, but 345 is not larger than 1236? The largest integer is 1236, so its product is 36.

Perhaps 125? $1+4+25=30$ no. 162? Not increasing. So 1236 is largest, product 36.

But let's confirm: digits increasing: 1,2,3,6. Sum squares 1+4+9+36=50. Yes. Product 1*2*3*6=36.

Is there a larger number? 1245: 1+16+16+25=58 no. 1345:1+9+16+25=51 no. 2345:4+9+16+25=54 no. 1234:1+4+9+16=30 no. So yes.

But 1,2,3,6 is 1236, but what about 5,3,4? Not increasing. Or 6,3,2,1 not increasing. So only increasing sequences.

Another: 1,1,7 but not distinct? Digits don't have to be distinct? The problem says "each digit is larger than the one to its left", so must be strictly increasing, so digits distinct and increasing.

So 1,2,3,6 is one. 1,3,6? Three digits: 1+9+36=46 no. 2,3,5:4+9+25=38 no. 3,5,4 not increasing. So 1236 is largest? But 1236 vs 345, but 345 is 345, 1236 is 1236, 1236>345, but is there a number like 1245? No. 1324 not increasing. So yes.

But 1,2,3,6 product 36, but option has 60, which is 3*4*5, but 345 is smaller than 1236? But 345 is 345, 1236 is 1236, but 1236 has four digits, 345 has three, so 1236 is larger. But numerically 1236 > 345, yes. But the integer 1236 is larger than 345, so it should be the largest. But let's list all: possible increasing sequences with sum squares 50.

- Three digits: possible? a<b<c, a^2+b^2+c^2=50. a=1, b=2,c=6? 1+4+36=41<50. b=3,c=6:1+9+36=46<50. b=4,c=5:1+16+25=42<50. a=1,b=5,c=6:1+25+36=62>50. a=2,b=3,c=5:4+9+25=38<50. a=2,b=4,c=5:4+16+25=45<50. a=3,b=4,c=5:9+16+25=50 yes. So 345.

- Four digits: a<b<c<d, a^2+b^2+c^2+d^2=50. a=1,b=2,c=3,d=6:1+4+9+36=50 yes. a=1,b=2,c=4,d=5:1+4+16+25=46<50. a=1,b=3,c=4,d=5:1+9+16+25=51>50. So only 1236.

- Five digits: minimum 1^2+2^2+3^2+4^2+5^2=1+4+9+16+25=55>50, too big. So only 345 and 1236. 1236 > 345, so largest is 1236, product 1*2*3*6=36.

But 345 product 3*4*5=60, but 345 is smaller than 1236, so no
openrouter:bytedance-seed/seed-2.0-lite – ⚠ model returned empty content (finish_reason=content_filter) — likely a soft refusal or only tool/reasoning output
openrouter:stepfun/step-3.7-flash A ✓
show
---
### Problem 1:
We have 9 coins (pennies=1¢, nickels=5¢, dimes=10¢, quarters=25¢) totaling $1.02=102¢, with at least one of each type. Let \(p,n,d,q\) be the counts of each coin. We have:
1.  \(p+n+d+q=9\)
2.  \(p +5n +10d +25q=102\)
3.  \(p,n,d,q \geq1\), integers.
Subtract 1 of each coin first: let \(p'=p-1, n'=n-1, d'=d-1, q'=q-1\), so \(p',n',d',q' \geq0\). Then:
- \(p'+n'+d'+q' = 9-4=5\)
- Substitute into the value equation: \((p'+1)+5(n'+1)+10(d'+1)+25(q'+1)=102\). Simplify: \(p'+5n'+10d'+25q' = 102 - 41=61\).
Replace \(p'=5 -n' -d' -q'\) in the value equation:
\[
(5 -n' -d' -q') +5n' +10d' +25q' =61 \implies 4n' +9d' +24q' =56.
\]
Test possible values of \(q'\) (since \(24q' \leq56\), \(q'=0,1,2\)):
- \(q'=2\): \(24*2=48\), so \(4n' +9d'=8\). \(9d' \leq8 \implies d'=0\), so \(4n'=8 \implies n'=2\). Then \(p'=5-2-0-2=1\), which is non-negative. This gives \(d=d'+1=1\), valid.
- \(q'=1\): \(24*1=24\), so \(4n'+9d'=32\). Testing \(d'=0,1,2,3\): \(d'=3\) gives \(4n'=5\) (non-integer), \(d'=2\) gives \(4n'=14\) (non-integer), \(d'=1\) gives \(4n'=23\) (non-integer), \(d'=0\) gives \(n'=8\), so \(p'=5-8-0-1=-4\) (invalid).
- \(q'=0\): \(4n'+9d'=56\). Testing \(d' \leq6\): all lead to negative \(p'\) or non-integer \(n'\).
Only \(d=1\) works.
ANSWER 1: A
---
### Problem 2:
We need positive integers with (I) sum of squares of digits =50, (II) strictly increasing digits. We need the largest such integer, then the product of its digits.
Digits are 1-9 (0 cannot be included, as it would have to be first, leading to an invalid positive integer, and digits are increasing). Squares of digits: \(1^2=1, 2^2=4, 3^2=9,4^2=16,5^2=25,6^2=36,7^2=49, 8^2=64>50\).
Find all sets of distinct increasing digits with square sum 50:
- 1 digit: 50 is not a square, no solutions.
- 2 digits: \(a^2 +b^2=50, a<b\). Only \(1+49=50\), so set \(\{1,7\}\), number 17.
- 3 digits: \(a^2+b^2+c^2=50, a<b<c\). Only \(9+16+25=50\), set \(\{3,4,5\}\), number 345.
- 4 digits: Smallest sum is \(1+4+9+16=30\). \(1+4+9+36=50\), so set \(\{1,2,3,6\}\), number 1236. No other 4-digit sets work (all other combinations exceed 50 or are not squares).
- 5+ digits: Minimum sum \(1+4+9+16+25=55>50\), no solutions.
The largest number is 1236 (4 digits > any 3-digit number). Product of digits: \(1*2*3*6=36\).
ANSWER 2: C
---
### Problem 3:
Maria buys disks at 4 for $5, sells at 3 for $5. Find number of disks to sell for $100 profit.
Profit per 12 disks (LCM of 4 and 3):
- Cost for 12 disks: \((12/4)*5 = \$15\)
- Revenue for 12 disks: \((12/3)*5 = \$20\)
- Profit per 12 disks: \(20-15=\$5\).
To make $100 profit: \(100 /5 =20\) sets of 12 disks. Total disks: \(20*12=240\).
Verify: Cost for 240 disks: \((240/4)*5=\$300\). Revenue: \((240/3)*5=\$400\). Profit: \(400-300=\$100\).
ANSWER 3: D
---
### Problem 4:
A 2×2×2 inch silver cube weighs 3 lbs, worth $200. Find value of 3×3×3 cube.
Volume scales with the cube of side length:
- Volume of 2-inch cube: \(2^3=8\) in³.
- Volume of 3-inch cube: \(3^3=27\) in³.
Value is proportional to volume: Value = \(200 * (27/8) = 200 * 3.375 = \$675\).
ANSWER 4: E
---
### Problem 5:
Jack has 128 apples. Sells 25% to Jill, 25% of remaining to June, gives 1 to teacher.
- After first sale: \(128 * (1-0.25) = 128 * 0.75 =96\) apples left.
- After second sale: \(96 *0.75=72\) apples left.
- After giving 1 to teacher: \(72-1=71\).
ANSWER 5: D
---
### Problem 6:
Toss a nickel 4 times. Probability of at least as many heads as tails.
Total outcomes: \(2^4=16\). "At least as many heads as tails" means \(H \geq T\), so \(H \geq2\) (since \(H+T=4\)):
- \(H=2\): \(\binom{4}{2}=6\) outcomes.
- \(H=3\): \(\binom{4}{3}=4\) outcomes.
- \(H=4\): \(\binom{4}{4}=1\) outcome.
Total favorable: \(6+4+1=11\). Probability: \(11/16\).
ANSWER 6: E
---
### Problem 7:
Three friends (Amy=A, Jan=J, Toy=T) redistribute money:
1.  Amy gives J and T enough to double their amounts: \(A_1 = A-J-T\), \(J_1=2J\), \(T_1=2T\).
2.  Jan gives A and T enough to double theirs: \(A_2=2A_1=2(A-J-T)\), \(J_2=J_1 -A_1 -T_1=2J - (A-J-T) -2T=3J -A -T\), \(T_2=2T_1=4T\).
3.  Toy gives A and J enough to double theirs: Final \(T = T_2 -A_2 -J_2 =4T -2(A-J-T) - (3J -A -T) =7T -A -J\).
Given initial \(T=36\), final \(T=36\):
\[
7*36 -A -J =36 \implies 252 -A -J=36 \implies A+J=216.
\]
Total money is conserved (only transfers), so total = \(A+J+T=216+36=252\).
ANSWER 7: D
---
### Problem 8:
Nonzero reals \(a,b,c\) with \(a+b+c=0\). Find possible values of \(\frac{a}{|a|} + \frac{b}{|b|} + \frac{c}{|c|} + \frac{abc}{|abc|}\) (note: the original formatting implies division, as multiplication gives values not in the options).
For any nonzero \(x\), \(\frac{x}{|x|}=1\) if \(x>0\), \(-1\) if \(x<0\). Let \(s = \frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}\), \(t=\frac{abc}{|abc|}\) (product of the three signs).
Since \(a+b+c=0\), they cannot all be positive or all negative:
- Case 1: 2 positive, 1 negative. Then \(s=1+1-1=1\), \(t=1*1*(-1)=-1\). Total: \(1 + (-1)=0\).
- Case 2: 2 negative, 1 positive. Then \(s=-1-1+1=-1\), \(t=(-1)*(-1)*1=1\). Total: \(-1 +1=0\).
Only possible value is 0.
ANSWER 8: A
---
### Problem 9:
7 numbers: average of first 4 is 5, average of last 4 is 8, average of all 7 is \(6\frac{4}{7}=\frac{46}{7}\). Find the common number (4th number, \(x\)).
- Sum of first 4: \(4*5=20\).
- Sum of last 4: \(4*8=32\).
- Sum of all 7: \(7*\frac{46}{7}=46\).
The 4th number is counted in both the first 4 and last 4, so total sum = \(20 +32 -x =52 -x\). Solve:
\[
52 -x=46 \implies x=6.
\]
ANSWER 9: B
---
### Problem 10:
5 distinct awards to 3 students, each gets at least 1. Number of onto functions from 5 elements to 3 elements:
Use inclusion-exclusion:
- Total distributions: \(3^5=243\).
- Subtract distributions missing at least 1 student: \(3*2^5=3*32=96\).
- Add back distributions missing 2 students (all awards to 1 student): \(3*1^5=3\).
Total: \(243 -96 +3=150\).
Alternatively, count partitions of 5 into 3 positive integers:
- 3+1+1: Choose student for 3 awa
anthropic:claude-opus-4-8 A ✓
show
Problem 1:
Need pennies(P), nickels(N), dimes(D), quarters(Q) ≥1, total 9 coins, value 102 cents.
To make cents end in 2, pennies must be 2 (or 7). Try P=2.
Then N+D+Q=7 coins, value 100 cents.
5N+10D+25Q=100, N+D+Q=7.
Try Q=3: 75 cents, remaining 25 with N+D=4: 5N+10D=25 → N+2D=5, N+D=4 → D=1, N=3. Works.
So D=1.
Check P=7: pennies 7, then 2 coins =95 cents impossible (max 25+25=50). So D=1.

ANSWER 1: A

Problem 2:
Digits increasing, sum of squares =50. Want largest integer (most digits, then largest).
Try to maximize digit count. Squares: find distinct increasing digits with squares summing 50.
1+49=50 → digits 1,7 → 17.
25+25 no (distinct).
1+4+9+36=50 → 1,2,3,6 → number 1236, product=1·2·3·6=36.
Check others: 9+16+25=50 → 3,4,5 → 345.
1+4+9+36 gives 4 digits, largest count. Largest integer = 1236.
Product =36.

ANSWER 2: C

Problem 3:
Cost per disk: 5/4 = $1.25. Sell price: 5/3 ≈ $1.6667. Profit per disk = 5/3 - 5/4 = (20-15)/12 = 5/12.
Need 100: disks = 100/(5/12)=240.

ANSWER 3: D

Problem 4:
Worth proportional to volume (weight). 2³=8, 3³=27. Ratio 27/8.
200·27/8 = 25·27 = 675.

ANSWER 4: E

Problem 5:
128, sell 25% → keep 96. Sell 25% of 96 → keep 72. Give 1 away → 71.

ANSWER 5: D

Problem 6:
4 tosses, 16 outcomes. At least as many heads as tails means heads ≥ 2.
Heads=2: C(4,2)=6; heads=3:4; heads=4:1. Total=11. Probability 11/16.

ANSWER 6: E

Problem 7:
Total stays constant. Let total = T. After all operations, Toy ends with $36.
Standard solution: total = 252. Let me verify.
Let amounts. Toy starts 36, ends 36. Known answer is 252.
Each doubling: after Amy's move, Jan and Toy doubled. After Jan's, Amy and Toy doubled. After Toy's, Amy and Jan doubled.
Work backward: final Toy=36. Before Toy's gift, Amy and Jan were half their final.
Total T constant. After Toy gives, Amy and Jan doubled, so before Toy's move Amy_2, Jan_2 were half of final; Toy before = 36 + (Amy_final - Amy_2)+(Jan_final - Jan_2)= 36 + Amy_2 + Jan_2.
This is complex; the known AMC answer is 252.

ANSWER 7: D

Problem 8:
Each term ±1 depending on sign. Since a+b+c=0, can't all same sign. Cases: two positive one negative, or two negative one positive.
Case two positive one negative: signs give +1+1-1=1, and abc = (pos)(pos)(neg)=negative → -1. Sum=1-1=0.
Case two negative one positive: -1-1+1=-1, abc=positive → +1. Sum=-1+1=0.
Always 0.

ANSWER 8: A

Problem 9:
Sum all seven = 7·(6 4/7)=7·46/7=46.
First four sum=20, last four sum=32. Overlap = 20+32-46=6.

ANSWER 9: B

Problem 10:
Distribute 5 distinct awards to 3 students, each ≥1. Surjections = 3⁵ - 3·2⁵ + 3·1⁵ = 243 -96+3=150.

ANSWER 10: B

Problem 11:
Minute hand at 20 min = 120°. Hour hand at 4:20 = 4·30 + 20·0.5 = 120+10=130°.
Difference =10°.

ANSWER 11: D

Problem 12:
N = (10^94 -1)·4·(10^94 -1)/9... let's compute. Nines string = 10^94 -1. Fours string = 4·(10^94 -1)/9.
Product = (10^94 -1)·4(10^94-1)/9.
Known pattern: product of n nines and n fours has digit sum.
For small case: 9·4=36, digit sum 9. 99·44=4356, sum=18. 999·444=443556, sum=27. Pattern: digit sum = 9n.
So for n=94: 9·94 = 846.

ANSWER 12: A
anthropic:claude-sonnet-4-6 A ✓
show
I'll solve each problem systematically.

---

**Problem 1:**
We need 9 coins (pennies, nickels, dimes, quarters), at least one of each, totaling $1.02.

Let p + n + d + q = 9 and 1p + 5n + 10d + 25q = 102.

With at least one of each: let's try q = 3: 75¢, remaining 102-75=27¢ from 6 coins (p,n,d ≥1).
Try d=1: 10¢, remaining 17¢ from 5 coins. Try n=2: 10¢, remaining 7¢ from 3 pennies — but 7 pennies ≠ 3 coins.
Try q=3, d=2: 95¢, remaining 7¢ from 4 coins. n=1: 5¢, remaining 2¢ from 3 pennies — 2≠3.
Try q=3, d=1, n=3: 75+10+15=100¢, remaining 2¢ from 2 pennies. p=2. Total: 2+3+1+3=9 ✓, value=102 ✓.

So d = **1**.

ANSWER 1: A

---

**Problem 2:**
Need digits in increasing order, sum of squares = 50.
Try 3 digits: 1²+3²+6²=1+9+36=46 no; 1²+4²+5²=1+16+25=42 no; 3²+4²+5²=9+16+25=50 ✓ → digits 3,4,5
Try 4 digits: 1²+2²+4²+5²=1+4+16+25=46 no; 1²+3²+4²+... 1+9+16+x²=50→x²=24 no; 1²+2²+3²+6²=1+4+9+36=50 ✓ → digits 1,2,3,6
Try 5 digits: 1²+2²+3²+4²+x²=1+4+9+16+x²=50→x²=20 no; 1²+2²+2²... digits must be distinct and increasing.

Largest integer: compare 3456 vs 1236. 3456 > 1236, so largest is 3456.
Product = 3×4×5×6 = **360**... wait that's not a choice.

Wait — 345: product = 60. 1236: product = 1×2×3×6 = 36.
Largest integer is 3456? But 3²+4²+5²+6² = 9+16+25+36 = 86 ≠ 50.
Largest number with increasing digits summing squares to 50: 345 (product=60) vs 1236 (product=36). 1236 < 345 as numbers? No: 1236 > 345. So largest is 1236, product = 36.

ANSWER 2: C

---

**Problem 3:**
Cost per disk: $5/4. Selling price per disk: $5/3.
Profit per disk = 5/3 - 5/4 = 20/12 - 15/12 = 5/12.
Number needed: 100 ÷ (5/12) = 100 × 12/5 = **240**.

ANSWER 3: D

---

**Problem 4:**
Volume of 2-inch cube: 8 in³, worth $200. Value per in³ = $25.
Volume of 3-inch cube: 27 in³. Worth = 27 × $25 = **$675**.

ANSWER 4: E

---

**Problem 5:**
Start: 128. Sold 25%: keeps 96. Sold 25% of 96: keeps 72. Gave 1 to teacher: **71**.

ANSWER 5: D

---

**Problem 6:**
P(heads ≥ tails) in 4 tosses = P(H≥2) = P(2)+P(3)+P(4) = (6+4+1)/16 = 11/16.

ANSWER 6: E

---

**Problem 7:**
Work backwards from end. After Toy's gift: all doubled. Before Toy's last move, Amy and Jan each had half their final amounts. Total = $108 (constant). Toy had $36 at end → Amy+Jan = $72 at end. Before Toy's redistribution: Amy = final/2, Jan = final/2... Total stays $108. Toy's $36 at end, started with $36 → total = **$252**? Let me verify: total is constant = 3×36=108? Toy ends with 36, and total=108 → **$108**.

ANSWER 7: A

---

**Problem 8:**
With a+b+c=0, either all negative (impossible since sum=0), or 2 positive/1 negative, or 1 positive/2 negative. Each term a/|a| = ±1. For 2 pos, 1 neg: sum=2-1=1, abc<0 → total=1+(-1)=0. For 1 pos, 2 neg: sum=1-2=-1, abc>0 → total=-1+1=0. Always **0**.

ANSWER 8: A

---

**Problem 9:**
First four sum=20, last four sum=32, total seven=46. Middle number=20+32-46=**6**.

ANSWER 9: B

---

**Problem 10:**
Surjective functions from 5 awards to 3 students: S(5,3)×3! = 25×6=150.

ANSWER 10: B

---

**Problem 11:**
At 4:20: minute hand at 120°. Hour hand: 4×30+20×0.5=120+10=130°. Angle=**10°**.

ANSWER 11: D

---

**Problem 12:**
99…9 (94 nines) × 44…4 (94 fours) = 4×(10⁹⁴-1)/9 × 9 × 44…4... The product = 44…3955…6 pattern. Sum of digits: 94 nines × 4 = digit sum of result. Using pattern: 9×4=36, digits sum=8+5=13... For n digits: sum = 9n. Here 94×9=**846**.

ANSWER 12: A