r/mathematics • • 18h ago

Discussion Inspiring Story of Teenager Hannah Cairo solving an open problem by constructing a counter example with her own ingenuity

45 Upvotes

https://www.quantamagazine.org/at-17-hannah-cairo-solved-a-major-math-mystery-20250801/

Quanta featured a great article about a homeschooled teenager. She constructed a counter-example to the long standing Mizohata-Takeuchi conjecture in harmonic analysis. I found it inspiring at a time when much of our thinking is being outsourced. There were a few points I found notable

  • Homeschooled - She was home schooled. This allowed her to think freely. She did not have limitations imposed on her, in terms of what materials or problems would be too advanced from her. In the article, she mentions never knowing how good she was at Mathematics because she did not have any peers to compare herself to.
    • I believe this allowed her to have have the belief to tackle an open problem.
    • It also fostered creative and unconventional thinking.
  • Humanly constructed counter example - The counterexample was made by human thought. She chanced upon a complicated wave function that disproved the conjecture. Later, she simplified it into something more concise and elegant. This is exactly how humans think and solve problems.

Interestingly, this counter example allowed her to go straight to graduate school without a high school diploma or a college degree !

It was heart warming to read of advances made by humans.


r/mathematics • • 4h ago

Can I get into any PhD program?

0 Upvotes

I go to a nescac liberal arts college, I have. 3.9 gpa , with an A- in most of my math classes. I have a B in real analysis , but As in complex analysis, probability and abstract algebra.
I have data science internships, and 1 published paper so far.


r/mathematics • • 21h ago

Anyone else love math !?!

Post image
91 Upvotes

r/mathematics • • 6h ago

LEFT BEHIND MATH THEORIES, C.E STUDENT 2nd year

Thumbnail
0 Upvotes

r/mathematics • • 5h ago

Number Theory Divisibility in dozenal

Thumbnail
gallery
1 Upvotes

A little something I have done today because I need it for enigma in dozenal for a game.

Everything is in dozenal, so remember 6 + 6 = 10

Have you a better method ?


r/mathematics • • 21h ago

Understanding Directional Derivatives

Post image
18 Upvotes

Directional derivatives measure the rate of change of a multivariable function as you move away from a point (x_0, y_0) towards a particular direction.

For a function of two variables, the directional derivative in the direction of a unit vector u = ⟨u_1, u_2⟩ is described by the formula:

D_u f(x, y) = ∇f(x, y) • u

Here's how to calculate the directional derivative step by step:

  1. Find the gradient ∇f(x, y) = ⟨∂f/∂x, ∂f/∂y⟩ (where ∂f/∂x and ∂f/∂y are partial derivatives with respect to one variable).

  2. If the direction isn't already a unit vector, normalize it by dividing it by its magnitude.

  3. Compute the dot product (∇f • u = ||∇f|| cos(θ), where θ is the angle between ∇f and u)

This gives:

D_u f(x, y) = ||∇f|| cos(θ)

Example: start with f(x, y) = x²y + y³ and find the directional derivative at (2, 1) in the direction of the vector v = ⟨3, 4⟩.

  1. The partial derivatives give ∂f/∂x = 2xy and ∂f/∂y = x² + 3y²

  2. The gradient is ∇f = ⟨2xy, x² + 3y²⟩ which we evaluate at (2, 1) giving ∇f = ⟨4, 7⟩

  3. Normalize v: ||v|| = √(3² + 4²) = 5, so v = ⟨3/5, 4/5⟩

  4. Finally, the dot product is v/||v|| • ∇f = (3/5)(4) + (4/5)(7) = 12/5 + 28/5 = 40/5 = 8

And so in that direction, the rate of change is 8.

And for the general case where the function f has n variables, x_1 through x_n:

∇f = ⟨∂f/∂x_1, ∂f/∂x_2, ... ∂f/∂x_n⟩

u = ⟨u_1, u_2, u_3, ... u_n⟩

D_u f = Σ[0, n] ∂f/∂x_i u_i


r/mathematics • • 12h ago

Computer Science BB(209) is logically independent of ZFC. Credit James Chang on Github.

Thumbnail github.com
81 Upvotes

r/mathematics • • 1h ago

Combinatorics Must every maximum Sidon set in the Boolean cube {0,1}^d contain a complementary pair? (Proved for d ≤ 5)

• Upvotes

Let b_d be the maximum size of a Sidon set in {0,1}^d: all pairwise sums u+v (u ≠ v, in ℤ^d) distinct. Known values: 2, 3, 5, 7, 12 for d = 1,…,5 (OEIS A309370).

Forbid complementary pairs (no u, v ∈ Z with u + v = (1,…,1)) and call the maximum b_d^af. A Sidon set contains at most one complementary pair, since u + (1−u) = v + (1−v) for any two, so

b_d − 1 ≤ b_d^af ≤ b_d.

What I've proved

This comes from a problem I've been working on: identifying two equally heavy fake coins with non-adaptive weighings, where only the tilt direction is read. Coins become vectors in {−1,0,1}ⁿ and all pairwise sums must lie on distinct rays ("directed-ray Sidon sets"). Parity fibers of {−1,0,1}ⁿ map onto Boolean cubes, which is where b_d enters. Results:

  1. Boolean cubes. Pen-and-paper proofs of b_d = 2, 3, 5, 7, 12 for d ≤ 5. The upper bound b₅ ≤ 12 is a three-line fiber difference budget; b₄ = 7 comes from a Hamming-distance and parity argument.

  2. Antipodal-free version. b_d^af = 1, 2, 4, 6, 11 for d ≤ 5, i.e. exactly b_d − 1. So in these dimensions every maximum Sidon set contains a complementary pair.

  3. Unconditional s₄ = 12. The largest twin-free (mod 2) vector-Sidon set in {−1,0,1}⁴ has 12 points. Hence every m-point vector-Sidon set there has at least m − 12 same-parity twins.

  4. Exact capacities for n ≤ 3. The two-heavy-coin problem is solved for n = 1, 2, 3: 3, 4 and 8 coins (vector-Sidon maxima 3, 5, 9). All by hand.

  5. n = 4. By hand: σ(4) ≤ 18, E(4) ≤ 20, and the equal-pan capacity is at most 17. The tools are an "8-slot law" on 2D fibers and a signed-K₄ switching argument that kills 15 of the 16 corners of the 4-cube. With finite certificates on the residual orbit spaces, the exact values are 15 coins, σ(4) = 16 (unique extremal set) and E(4) = 17.

  6. n = 5. s₅ ≤ 27 unconditionally, two explicit C₅-symmetric 27-coin designs, and a 28-point set where every pairwise sub-system is clean but the whole fails through a 4-body collision. So no pairwise argument can close n = 5.

Questions

  1. Is the antipodal-free Boolean Sidon problem known or studied anywhere?

  2. Does b_d^af = b_d − 1 hold for all d, or does some maximum Sidon set avoid complementary pairs in higher dimensions?

  3. Is there a structural reason a complementary pair "helps" an extremal Sidon set?


r/math • • 4h ago

Career and Education Questions: November 19, 2026

4 Upvotes

This recurring thread will be for any questions or advice concerning careers and education in mathematics. Please feel free to post a comment below, and sort by new to see comments which may be unanswered.

Please consider including a brief introduction about your background and the context of your question.

Helpful subreddits include /r/GradSchool, /r/AskAcademia, /r/Jobs, and /r/CareerGuidance.

If you wish to discuss the math you've been thinking about, you should post in the most recent What Are You Working On? thread.


r/mathematics • • 4h ago

Computer Science James Chang has further reduced the bound for ZFC independence of busy beavers to BB(207).

Thumbnail github.com
41 Upvotes

r/mathematics • • 8h ago

Conjectures on the Parity and 2–adic valuations of Taxicab Numbers

0 Upvotes

I have been analyzing the parity and $2$-adic valuations of the known taxicab numbers $\operatorname{Ta}(n)$ and their consecutive differences. Based on the known values up to $\operatorname{Ta}(6)$, I have formulated a set of structural conjectures and would appreciate feedback on whether any known results on sums of two cubes immediately prove, refute, or contextualize them.

---

### **Definition**

For each $n \in \mathbb{Z}^+$, let $\operatorname{Ta}(n)$ denote the $n$-th taxicab number, defined as the smallest positive integer expressible as a sum of two positive cubes in at least $n$ distinct ways:

$$\operatorname{Ta}(n) = \min \left\{ N \in \mathbb{Z}^+ : \#\left\{ (x, y) \in \mathbb{Z}^+ \times \mathbb{Z}^+ \;\middle|\; x \le y,\; x^3 + y^3 = N \right\} \ge n \right\}.$$

For all $n \in \mathbb{Z}^+$, let $d_n = \operatorname{Ta}(n+1) - \operatorname{Ta}(n)$ denote the $n$-th consecutive difference, and for any non-zero integer $m$, let $v_2(m) = \max \{ k \in \mathbb{Z}_{\ge 0} : 2^k \mid m \}$ denote the $2$-adic valuation of $m$.

---

### **Conjecture 1 (Weak Form — Alternating Parity Avoidance)**

For all integers $k \ge 6$, no four consecutive differences $(d_k, d_{k+1}, d_{k+2}, d_{k+3})$ exhibit a strictly alternating parity pattern:

$$\forall k \ge 6, \quad \neg \Big( d_k \equiv d_{k+2} \pmod{2} \;\land\; d_{k+1} \equiv d_{k+3} \pmod{2} \;\land\; d_k \not\equiv d_{k+1} \pmod{2} \Big).$$

---

### **Conjecture 2 (Strong Form — $2$-adic Parity Lock & Asymptotic Divisibility)**

The sequence $\{\operatorname{Ta}(n)\}_{n \ge 1}$ and its consecutive differences $\{d_n\}_{n \ge 1}$ satisfy the following three structural properties:

  1. **Permanent Parity Lock:**

    $$\forall n \ge 4, \quad \operatorname{Ta}(n) \equiv 0 \pmod{2} \implies d_n \equiv 0 \pmod{2}.$$

    Since $\operatorname{Ta}(4) = 6963472309248$ is even, induction implies that the set of indices yielding odd taxicab numbers is strictly finite:

    $$\left\{ n \in \mathbb{Z}^+ : \operatorname{Ta}(n) \equiv 1 \pmod{2} \right\} = \{2, 3\}.$$

  2. **Cubic $2$-adic Thresholds:**

    $$\forall n \ge 4, \quad v_2(\operatorname{Ta}(n)) \ge 3 \quad (\text{i.e., } 8 \mid \operatorname{Ta}(n)),$$

    $$\forall n \ge 5, \quad v_2(\operatorname{Ta}(n)) \ge 6 \quad (\text{i.e., } 64 \mid \operatorname{Ta}(n)).$$

  3. **Asymptotic $2$-adic Divergence:**

    $$\lim_{n \to \infty} v_2(\operatorname{Ta}(n)) = \infty.$$

---

### **Proposition (Logical Hierarchy & Falsifiability)**

  1. **Implication Hierarchy:** Conjecture 2 implies Conjecture 1. Specifically, given the base case $\operatorname{Ta}(4) \equiv 0 \pmod{2}$, Part 1 of Conjecture 2 yields:

    $$\text{Conjecture 2} \implies \Big( \forall n \ge 4,\; d_n \equiv 0 \pmod{2} \Big) \implies \text{Conjecture 1}.$$

    Conversely, Conjecture 1 does not imply Conjecture 2 (e.g., if $d_n$ is eventually constant odd for $n \ge 6$, Conjecture 1 holds while Conjecture 2 fails).

  2. **Counterexample Thresholds:**

    * Refuting Conjecture 1 requires at least $5$ consecutive values $\operatorname{Ta}(k), \dots, \operatorname{Ta}(k+4)$ for some $k \ge 6$ that generate an alternating parity sequence in $(d_k, d_{k+1}, d_{k+2}, d_{k+3})$.

    * Refuting Conjecture 2 requires only a single counterexample $n \ge 4$ violating its $2$-adic bounds—such as $\operatorname{Ta}(n) \equiv 1 \pmod{2}$, $v_2(\operatorname{Ta}(n)) < 3$ for $n \ge 4$, or $v_2(\operatorname{Ta}(n)) < 6$ for $n \ge 5$.

---

### **Empirical Data**

Verification up to the highest known taxicab number $\operatorname{Ta}(6) = 24153319581254312065344$ supports both conjectures:

* $v_2(\operatorname{Ta}(1)) = 1$ ($\operatorname{Ta}(1) = 2$)

* $v_2(\operatorname{Ta}(2)) = 0$ ($\operatorname{Ta}(2) = 1729$)

* $v_2(\operatorname{Ta}(3)) = 0$ ($\operatorname{Ta}(3) = 87539319$)

* $v_2(\operatorname{Ta}(4)) = 10$ ($\operatorname{Ta}(4) = 6963472309248$)

* $v_2(\operatorname{Ta}(5)) = 6$ ($\operatorname{Ta}(5) = 48988659276962496$)

* $v_2(\operatorname{Ta}(6)) = 6$ ($\operatorname{Ta}(6) = 24153319581254312065344$)

### **Questions**

  1. Are there known heuristic arguments (e.g., via elliptic curves $x^3 + y^3 = N$ or scaling known solutions by $2^{3k}$) explaining why $v_2(\operatorname{Ta}(n))$ jumps at $n \ge 4$ and whether $\lim_{n \to \infty} v_2(\operatorname{Ta}(n)) = \infty$ is expected to hold?

  2. Could an odd integer $N$ with $n \ge 4$ representations as a sum of two positive cubes plausibly be smaller than the smallest even integer with $n$ representations, or is there an obstruction in $2$-adic density?


r/mathematics • • 12h ago

Math give physics a special taste ( math broke me ) NSFW

Post image
13 Upvotes

r/mathematics • • 16h ago

Why do you love math? How does it serve you? What beauty do you see?

24 Upvotes

Hi everybody, I'm a painting student. I realize math dictates space, structure, change, and many other fundamental logics behind art. I'm really curious, what makes you love math? Do you have any theorems, branches, concepts, etc. that serve a sense of beauty or personal purpose to you?


r/mathematics • • 17h ago

Discussion How do you relearn mathematics from scratch?

4 Upvotes

ive been very poor in mathematics and idk anything
the only thing i used to do is to do cramming
bcz of that i didn't develop and math skill but it's making it very hard for me to go though my university course
i wanna re-learn mathematics from scratch
can anyone tell me a proper guide with book suggestion
like what to learn first and what to learn next etc