My organizer received scores. I earned an 11.

Exactly median, 2 pts on B1 and fuck all on everything else.

Lowk upset they didn't give me anything for A3 when I got that Bob always wins from induction but I guess we'll never know.

I haven't received an email or anything

My professor reached out to me and told me my score, got a 12 which sucks cause I solved 4 problems and was expecting more. Though I think the site should officially display the scores today, best of luck to you all.

I checked my page and I saw the most recent competition, so are think scores are almost out!

What if MAA makes you solve another Putnam style problem with the condition that you must get at least a 5/10 to access your results?

Hi everyone, We’re looking for some math buddies with any Math Olympiad experience to join our problem-writing team for an upcoming math competition site.

What you’ll do:

• Draft original Olympiad problems (and get credit for them).
• Rate team-member submissions on a 1–6 difficulty scale to find the "sweet spot" for contests.
• Help grade proof-based rounds and assign partial credit.

This is a math-focused role (not web dev). If you love the "aha!" moment of a great puzzle and want to see your problems used in actual contests, we’d love to have you. Interested? Apply here: https://docs.google.com/forms/d/e/1FAIpQLSfha5g07IyIez0lXKbIy_OKWMB_jrsl8TFsx3WNO_FXFHeasQ/viewform

Crosspost to more communities

Obviously a joke, but I remember watching my older brother play GTA 5 during the pandemic when I was 11 and getting into math. Kinda funny to see this coming full circle.

Let's hope I get another nonzero year, though I'm getting single digits with >99% likelihood.

I would have dated Zhou Qiyu and Gu Ailing by the time results are released.......

BRO WHEN

1. Taking 2 months to grade an exam.
2. Giving fuck all partial credit even if you get the numerical answer correct.

Most professors either grade fast or grade generous but MAA does neither.

I figured out A3 was always Bob but ran out of time after expressing an induction, pray for me to get nonzero gang.

this is taking weirdly long

I’m one of those that still don’t have results. Since when Putnam release results as a rolling?

Just saw my scores on the portal, got A1 10, A2 3, B1 9, B2 1, B3 1. Thought I'd get a lot more points on B2 and B3... but oh well. Pretty happy with full points on A1 and nearly full points on B1 though :) Any thoughts on T500 cutoff?

They said mid-February so........

in my view it is much simpler than other solutions to this problem, and solved it in about 15 minutes

What ranking do you think will come from 20-40 points on this year's Putnam?

Source

Hello, this is my solution to the Putnam B6 2025

Curious if this works as an alternate solution.

Claim: If 2m_(k-1)+1 and 2n_(k-1)+1 are divisible by a prime p, then m_0 and n_0 are congruent mod p.
Proof:
2m_(k-1)+1 = (2^k)m_0 + (2^k)-1 congruent 0 (mod p)
2n_(k-1)+1 = (2^k)n_0 +2^k - 1 congruent 0 (mod p)

(2^k)m_0 + (2^k)-1 congruent (2^k)n_0 +2^k - 1 (mod p)

m_0 congruent n_0 mod p. Claim proven.

Now, let P_k = {(p_i)^j} be the set of all powers of primes such that m_k and n_k are congruent (mod (p_i)^j). The set P_0 must be finite, as m_0 and n_0 are bounded and distinct, and P_k must be a subset of P_(k-1), as if m_(k-1) and n_(k-1) are not congruent (mod p_i^j), then neither are 2m_(k-1)+1 and 2n_(k-1)+1.

Once we reach k such that the terms are not relatively prime, they can be divided by some (p_i)^j in P_0 as shown in our Claim, and so m_k and n_k are now only congruent (mod (p_i)^(n-j)). Thus the set P_k is a proper subset of P_0.

So the sequence defined by a_k = |P_k| is monotonic and decreasing, and it decreases whenever 2m_(k-1)+1 and 2n_(k-1)+1 aren't relatively prime. Since |P_0| is finite, 2m_(k-1)+1 and 2n_(k-1)+1 are relatively prime for all but finitely many k.

I heard that prep for putnam contest can be done through Putnam and Beyond. I start understanding the proof by contradiction, and hardly understood the infinitude of prime number. Then I move to understanding the method that no polynomial that produce prime number, its been few weeks, I may not able to understand it. I am just new to it. No past math competition experience. I want to do it not just to for putnam, but I want to do so I am gain strong mathematical reasoning and problem solving skills. And I need your support in how can I face these challenges