r/learnmath • • 7h ago

Uniqueness of logarithmic curves

0 Upvotes

So in my standard math curriculum for logarithmic functions, we have to plot like 9+ points, and it got me wondering if all of those points are even needed. How many points does a logarithmic function even need to be uniquely determined?

So at first I thought of a model,

y = a log F(x) + c

Where,

  • a and c are constants
  • F(x) is a polynomial of x (E.g., ax+c, ax^2+bx+c, etc.)

If we let m be the total number of points needed, my proof says m needs to be at least,

m >= 2d+1+⌊d/2⌋

Where, d is the degree of F(x).

TL;DR: The proof below is very long.

Setting it up

Let d ≥ 1. F, G real polynomials of degree at most d, a and ã nonzero real constants. Take distinct real numbers

x₁ < x₂ < ⋯ < x_m

with F(xᵢ) > 0 and G(xᵢ) > 0 for every i. Suppose

y = a log F(x) + c and y = ã log G(x) + c̃

agree at every xᵢ. Then if m ≥ 2d + 1 + ⌊d/2⌋, the two models are identical on every interval where both logs are defined. Agreement at enough points forces the same curve.

Transforming the problem

At each sample point,

a log F(xᵢ) + c = ã log G(xᵢ) + c̃.

Divide by a ≠ 0 and set α = ã/a, β = (c̃ − c)/a. Since a, ã ≠ 0, we get α ≠ 0. The equality becomes

log F(xᵢ) − α log G(xᵢ) − β = 0.

So define

H(x) = log F(x) − α log G(x) − β,

and H(xᵢ) = 0 for every i. Differentiating,

H′(x) = F′(x)/F(x) − α G′(x)/G(x) = [F′(x)G(x) − α G′(x)F(x)] / [F(x)G(x)].

Let

Q(x) = F′(x)G(x) − α G′(x)F(x).

Since deg F, deg G ≤ d, we have deg(F′G) ≤ 2d−1 and deg(G′F) ≤ 2d−1, so

deg Q ≤ 2d−1

Now, we must show Q has at least 2d distinct real zeros, which can force Q≡0.

Counting roots inside sample intervals

Lemma: if a real polynomial P is positive at both endpoints of an interval (u,v), then the sum of the multiplicities of its real roots inside (u,v) is even.

Why? At a real root r of multiplicity k, write P(x) = (x−r)^k S(x) with S(r) ≠ 0. The sign of P changes across r iff k is odd. Positive at both endpoints means an even number of sign changes, so the total multiplicity is even.

Corollary: Let P be a real polynomial of degree at most d with P(xᵢ) > 0 for all i. Then P has a real root in at most ⌊d/2⌋ of the intervals Iᵢ = (xᵢ, x_{i+1}).

Why? By the lemma, any interval containing a root of P contains real roots whose multiplicities sum to at least 2. These intervals are disjoint, so the total multiplicity in their union is at least twice the number of such intervals. That total is at most deg P ≤ d. So the number of such intervals is at most ⌊d/2⌋.

Apply this to F and to G separately. Set

A = {Iᵢ : F has a root in Iᵢ}, B = {Iᵢ : G has a root in Iᵢ}.

Then |A| ≤ ⌊d/2⌋ and |B| ≤ ⌊d/2⌋, so in particular |A ∩ B| ≤ ⌊d/2⌋

Getting zeros of Q from the intervals

Call an interval clean if neither F nor G has a root in it, exclusive if exactly one does, shared if both do.

Clean intervals. F and G are positive at both endpoints and have no roots inside, so by continuity F > 0 and G > 0 on [xᵢ, x_{i+1}]. So H is continuous on the closed interval and differentiable on the open one. Since H(xᵢ) = H(x_{i+1}) = 0, Rolle gives r ∈ (xᵢ, x_{i+1}) with H′(r) = 0. But H′(r) = Q(r)/(F(r)G(r)), and F(r)G(r) ≠ 0, so Q(r) = 0.

Exclusive intervals. Say Iᵢ contains roots of F but none of G (the other case is symmetric). G > 0 on [xᵢ, x_{i+1}]. Two possibilities:

If F has a multiple root r in Iᵢ, then F(r) = F′(r) = 0, so Q(r) = F′(r)G(r) − α G′(r)F(r) = 0.

If every root of F in Iᵢ is simple, the lemma says there's an even number of them: r₁ < r₂ < ⋯ < r_{2k}. Between consecutive roots, F has constant sign. Since both are simple, the sign just right of rⱼ is sgn F′(rⱼ), and the sign just left of r_{j+1} is −sgn F′(r_{j+1}). These agree, so sgn F′(rⱼ) = −sgn F′(r_{j+1}). At each root, Q(rⱼ) = F′(rⱼ)G(rⱼ), and G(rⱼ) > 0, so Q(r₁) and Q(r₂) have opposite signs. By IVT, Q has a zero in (r₁, r₂) ⊂ Iᵢ.

Either way, Iᵢ contributes at least one zero of Q. The symmetric argument (Q(s) = −α G′(s)F(s) at a root s of G, with F(s) > 0 and α ≠ 0) handles the case where G has roots, and F doesn't.

So every clean or exclusive interval contains at least one zero of Q.

Shared intervals. If both F and G have roots in Iᵢ, we just throw Iᵢ away. That costs us at most |A ∩ B| intervals.

Counting the zeros

Usable intervals: (m−1) − |A ∩ B| ≥ m − 1 − ⌊d/2⌋. Each gives at least one zero of Q, and zeros from distinct intervals are distinct since the intervals are disjoint. So Q has at least

m − 1 − ⌊d/2⌋

distinct real zeros. By hypothesis m ≥ 2d + 1 + ⌊d/2⌋, so

m − 1 − ⌊d/2⌋ ≥ 2d.

So Q has at least 2d distinct real zeros. But deg Q ≤ 2d−1, so Q can't be nonzero. Therefore Q ≡ 0.

From Q ≡ 0 to identical models

We have

F′G − α G′F ≡ 0. (1)

Since F(xᵢ) > 0 and G(xᵢ) > 0 at the sample points, neither F nor G is the zero polynomial.

If F is constant, then F′ ≡ 0, so (1) gives α G′F ≡ 0. Since α ≠ 0 and F ≢ 0, G′ ≡ 0, so G is constant. Then both models are constant, and since they agree at a sample point, they're the same constant. Same if G is constant. So assume both are nonconstant.

Divide (1) by FG (not identically zero):

F′(x)/F(x) = α G′(x)/G(x). (2)

Now work over ℂ. Let z be a root of F of multiplicity r ≥ 1. Near z,

F(x) = (x−z)^r U(x), U(z) ≠ 0, so F′/F = r/(x−z) + U′/U,

so F′/F has a simple pole at z with residue r. By (2), α G′/G has a pole at z, so z is a root of G. If its multiplicity in G is s, then α G′/G has residue αs at z, so

r = αs. (3)

Reversing roles, every root of G is a root of F. So F and G have the same distinct complex roots.

Since F is nonconstant, at least one such root z exists. From (3), α = r/s (Uh, it is supposed to be a fraction; I don't know why Reddit is thinking it's some subreddit), a ratio of positive integers — so α is rational and positive. Write α = p/q in lowest terms with p, q positive coprime. Then (3) reads qr = ps, and since gcd(p,q) = 1 there's a positive integer k_z with

r = p k_z, s = q k_z.

Let P be the monic real polynomial whose roots are the distinct complex roots of F (equivalently of G), each to multiplicity one. Since F is real, its nonreal roots come in conjugate pairs with equal multiplicity, so P is real. From the multiplicities, F and P^p have the same roots with the same multiplicities, and both are real, so

F = u P^p

for some nonzero real u. Similarly

G = v P^q

for some nonzero real v.

On any interval where F > 0 and G > 0, P(x) ≠ 0 and

log F(x) = log|u| + p log|P(x)|, log G(x) = log|v| + q log|P(x)|.

Therefore

log F(x) − α log G(x) = log|u| − (p/q) log|v|,

which is a constant C independent of x — and it's the same constant on every connected component of the common domain.

At each sample point xᵢ,

log F(xᵢ) − α log G(xᵢ) = β,

so C = β. Hence,

log F(x) − α log G(x) = β

on the entire common domain. Multiply by a and recall α = ã/a, β = (c̃ − c)/a:

a log F(x) − ã log G(x) = c̃ − c,

that is,

a log F(x) + c = ã log G(x) + c̃.

The two models are identical wherever both logs are defined.

Bounds table

dN(d)
13
26
38
411

And so on.

That also begs another question. Is this bound the optimal bound? Like, could you guarantee uniqueness for a cubic with fewer than 8 points? I don't have anything on that yet.


r/learnmath • • 16h ago

TOPIC So now that AI solved the Riemann Hypothesis what's the explanation of people on this subreddit that claimed"AI is doing shit at maths"?

0 Upvotes

I had lots of arguments claiming that AI was a good tool to learn maths and was able to give clear explanations and was an excellent teacher to learn maths. But people here were claiming that AI was shit and that it was bad at maths. "LLM can't do maths"


r/learnmath • • 16h ago

TOPIC So now that AI solved the Riemann Hypothesis what's the explanation of people on this subreddit that claimed "LLM can't do maths"?

0 Upvotes

I had lots of arguments claiming that AI was a good tool to learn maths and was able to give clear explanations and was an excellent teacher when asked to teach a subject. But people here were claiming that it was bad at maths. "LLM can't do maths".

I just want to know if their view changed.


r/learnmath • • 2h ago

Link Post Understand the Riemann Hypothesis: faster than you could beat GTA6

Thumbnail
riemann-quest.pages.dev
0 Upvotes

I was going through the Riemann hypothesis remark from Alpoge, and just trying to understand what it was all about. I built this tool ( using AI ) to break down each single line of it, down to a level I could understand with high school math. Thought it might be helpful for anyone trying to understand the proof.


r/learnmath • • 15h ago

Why couldn’t I solve the Riemann Hypothesis?

0 Upvotes

I downloaded Claude and spent my hard earned 20$, readying myself to solve the Riemann Hypothesis using Fable 5.2.

I was going to use Claude Fable 5.2, but it said I needed to pay with credits to use after I bought the membership. I thought it would give me full access since it told me I needed membership to use before when I clicked it. I thought this was predatory, so I decided to not buy any credits and to use Opus 5.5.

I wrote my prompt that took me 30 seconds: “Prove and formalize the Riemann hypothesis step by step through my standardized chat. You will do this by writing however long of a compiled text. Make sure it’s not a very obscure page paper but instead details the meta reasoning details of the Riemann Hypothesis paper and explains the technical reasoning details that would’ve been explained through lean.”

This was the response. Please read it and tell me what went wrong: “I can't give you a proof of the Riemann Hypothesis, because nobody has one. It's still unsolved as of November 2026. If I wrote a "proof" anyway, it would be fake, and Lean would catch it: the formal proof would have to contain a sorry (Lean's placeholder for a missing step) at the hard part.
What I can give you is the real structure. Below is the exact formal statement, the reasoning any proof has to follow, a Lean outline where every step except one is known mathematics, and the latest progress.

  1. Where things stand (Nov 2026)
  • Still open. In October, OpenAI announced an AI proof of a weaker "quasi-Riemann hypothesis." Thomas Bloom says "the full Riemann hypothesis still seems out of reach."
  • The weaker result: Quasi-RH asks only for a proof that all nontrivial zeros lie in a vertical strip narrower than the known strip between 0 and 1. A 199-page version claimed all nontrivial zeros lie between real parts 1/8 and 7/8, and the article says it was formally verified in Lean. A shorter 49-page version claimed 1/12 to 11/12 and is not formally verified. Experts "largely agree that the result is correct," but Sarnak said he won't consider it "a Theorem" until humans check all the details.
  • A related Anthropic result: a research version of Claude raised the proven lower bound on the fraction of zeta zeros that lie on the critical line, from 41.6% to 67.2%. Claude produced a Lean formalization of the result. But Claude's attempt on the hypothesis itself did not succeed.
  1. The statement

Informally: ζ(s) = Σ 1/nˢ for Re(s) > 1, extended to all of ℂ except a pole at s = 1. It is zero at −2, −4, −6, … (the "trivial zeros"). RH says every other zero has real part exactly ½.
In Lean: Mathlib (Lean's main math library) already contains the statement. It's roughly:
def RiemannHypothesis : Prop :=
∀ (s : ℂ) (_ : riemannZeta s = 0)
(_ : ¬∃ n : ℕ, s = -2 * (n + 1))
(_ : s ≠ 1),
s.re = 1 / 2
Some formalization details:

  • What s ≠ 1 is for. Mathlib defines riemannZeta on all of ℂ, so at the pole s = 1 it assigns a placeholder value. The s ≠ 1 condition keeps that placeholder out of the statement.
  • Trivial zeros are excluded by formula. The condition ¬∃ n, s = -2(n+1) removes them, so the statement never needs a definition of "nontrivial zero."
  • It's a def, not a theorem. Mathlib states RH as a property (Prop) and never proves it. Proving theorem rh : RiemannHypothesis would mean solving the problem.
  1. The reasoning a proof has to follow

Any proof needs the same three stages. The first two are known. The third is the entire open problem.
Stage A: Confine zeros to the strip 0 < Re(s) < 1.

  • For Re(s) > 1, the Euler product ζ(s) = ∏ₚ (1 − p⁻ˢ)⁻¹ converges, and a convergent product of nonzero factors is nonzero.
  • On Re(s) = 1, ζ is also nonzero. This is the analytic core of the Prime Number Theorem (Hadamard and de la Vallée Poussin, 1896). The classic proof uses 3 + 4cos θ + cos 2θ ≥ 0.
  • For Re(s) ≤ 0, the functional equation reflects s to 1 − s. The only zeros there come from sine and Gamma factors, which are exactly the trivial zeros.

Stage B: Use symmetry to cut the problem in half.

  • The completed zeta ξ(s) = ½ s(s−1) π^(−s/2) Γ(s/2) ζ(s) satisfies ξ(s) = ξ(1−s). It is also real on the real line, so ξ(s̄) is the conjugate of ξ(s).
  • So the zeros are symmetric about the line Re = ½. A zero at ½ + a + it forces another at ½ − a + it.
  • RH is therefore equivalent to: ζ has no zeros with ½ < Re(s) < 1.

Stage C: Rule out zeros with ½ < Re(s) < 1. This is the open part.
Known methods only get part of the way:

  • Zero-free regions. The best one known (Vinogradov–Korobov) pushes zeros away from Re = 1 by an amount that shrinks toward 0 as the height t grows. No method gives a fixed gap. The quasi-RH result would be the first fixed gap (Re ≤ 11/12), still far from ½.
  • Counting zeros on the line. Levinson, then Conrey, then later work show a positive fraction of zeros lie on the line, now 67.2%. A percentage, even 100% "in density," doesn't exclude every single exception.
  • Numerical checks. Trillions of zeros have been checked and all lie on the line. Checking can't cover infinitely many zeros.
  • Equivalent forms. RH has many equivalent restatements, each moving the difficulty somewhere else:
  • Weil's positivity criterion
  • Li's criterion
  • Robin's inequality σ(n) < e^γ n log log n for n > 5040
  • the Nyman–Beurling criterion
  • a Hilbert–Pólya operator (a self-adjoint operator whose eigenvalues match the zeros)
  • None has been proved, but each one hands you a specific inequality to aim at.
  1. The Lean outline: the full shape with one honest gap

This is how a formalization would be organized. Theorem names follow recent Mathlib and may differ slightly between versions.
import Mathlib
open Complex

/-- STAGE A1 (in Mathlib): no zeros on Re(s) ≥ 1. -/
lemma zeta_ne_zero_right (s : ℂ) (hs : 1 ≤ s.re) :
riemannZeta s ≠ 0 :=
riemannZeta_ne_zero_of_one_le_re hs

/-- STAGE A2 (provable, not trivial): zeros with Re ≤ 0
are trivial. Uses the functional equation
`riemannZeta_one_sub`, Gamma having no zeros,
and the zeros of sin(πs/2). -/
lemma zeros_left_are_trivial (s : ℂ) (hs : s.re ≤ 0)
(hz : riemannZeta s = 0) :
∃ n : ℕ, s = -2 * (n + 1) := by
sorry -- known mathematics, roughly a few hundred lines of Lean

/-- STAGE B (provable): symmetry of zeros. -/
lemma zero_reflect (s : ℂ) (h0 : 0 < s.re) (h1 : s.re < 1)
(hz : riemannZeta s = 0) :
riemannZeta (1 - s) = 0 := by
sorry -- from `completedRiemannZeta_one_sub`

/-- STAGE C: THE RIEMANN HYPOTHESIS ITSELF.
No known proof. This `sorry` cannot be filled. -/
theorem no_zeros_right_half (s : ℂ)
(h1 : 1/2 < s.re) (h2 : s.re < 1) :
riemannZeta s ≠ 0 := by
sorry -- OPEN PROBLEM

/-- Putting it together: RH follows from A + B + C. -/
theorem riemann_hypothesis : RiemannHypothesis := by
intro s hz htriv hs1
-- Case Re ≥ 1: contradicts A1.
-- Case Re ≤ 0: A2 says the zero is trivial; contradicts htriv.
-- Case 0 < Re < 1, Re ≠ 1/2:
-- if Re > 1/2, contradicts C directly;
-- if Re < 1/2, reflect via B to get Re(1 - s) > 1/2,
-- contradicting C.
sorry -- routine case analysis via `lt_trichotomy`
How Lean exposes the gap: running #print axioms riemann_hypothesis lists sorryAx. That flags the theorem as depending on an unproved step. Filling the routine sorrys (A2, B, and the case split) is ordinary formalization work. Removing the Stage C sorry would solve RH. Any document claiming to prove RH can be checked the same way: if its Lean code contains sorry or adds a new axiom, it isn't a proof.
What Stage C would look like via Weil's criterion:

  1. Define the Weil functional. From the explicit formula (a sum over zeros equals a sum over primes plus an archimedean term), define W(f) for smooth, compactly supported test functions f on (0, ∞).
  2. Prove the equivalence (hard but known). RH holds exactly when W(f ⋆ f*) ≥ 0 for all f. In Lean this means building Mellin transforms, contour shifting, and convergence estimates for sums over zeros.
  3. Prove positivity (open). This is where the open part lives. Connes's 2026 survey, for example, studies restrictions of Weil's quadratic form to finitely many primes.

Even the Claude 67.2% result works this way: it uses a function space with a quadratic form, where positive- and negative-definite subspaces correspond to zeros on and off the line.

  1. Why this is hard

Every proven result about ζ in the critical strip pays some price for averaging:

  • density bounds that allow rare exceptions
  • zero-free regions that thin out as height grows
  • percentages of zeros rather than all of them

RH allows no exceptions. Prime-sum estimates can't tell the real ζ apart from "fake" functions that share many of its properties but have zeros off the line. The Davenport–Heilbronn function, for example, satisfies a similar functional equation and has zeros off the line. So a proof must use the Euler product in an essential way, not just analytic properties. This is the main reason experts expect a genuinely new idea will be needed.
If it helps, I can carry one of the provable steps through to sorry-free Lean, for example Stage A2 or the ζ ≠ 0 on Re = 1 argument.”


r/learnmath • • 19h ago

Link Post À la recherche d’un compagnon ou d’une compagne de maths !

Thumbnail reddit.com
0 Upvotes

r/learnmath • • 7h ago

power series

0 Upvotes

do you guys have any suggestions for resources that explain the representations of functions as power series and power series in general. This part of my calc 2 curriculum is just something that I'm not getting. I feel that my understanding of all this is iffy, even with all the practice problems I've done. any conceptual resources?


r/learnmath • • 3h ago

who needs a maths tutor?

0 Upvotes

Tutoring maths for £15-£20. Whoever wants to be tutored for gcse maths please dm me. There will be a trial session to know your weaknesses and where you need help with free of charge. If you enjoyed the trial then there should be a suitable timetable tailored for you.


r/learnmath • • 17h ago

I am not good at math (seeking advice)

1 Upvotes

I come asking for some advice!

I am a university student studying English literature as my major and math as my minor. Math is a struggle for me, and I have a couple inklings as to why.

Abstract concepts, humanities, arts, philosophy, emotional knowledge, are things that come quite easy to me. By this I mean, I think I am almost wired to comprehend concepts like this with a pretty extreme level of depth.

The only way I can describe math is that it's like I'm trying to comprehend the world and patterns in a language I am not familiar with. So, when I look at an equation (that is fundamentally connected to the overall system), I need to translate it in my head to "English" or more "emotional" logic. And this translation itself, requires my full attention to do so. Meaning, if a question requires me to be able to comprehend the entire system at the same time, I simply can't, because I can only focus on one concept at a time.

Picture a tree with many branches. To solve the issue, I need to realize a connection between a node on branch #1 and a node on branch #4. If this is a humanities/emotional problem, it's like I'm processing the entire tree and it's branches simultaneously, the entire tree is glowing. So it's easy. However, if this was math, it's like the tree is in French! If I focus on branch #1, it glows (I'm trying to translate this mathematical language/logic into something I understand). However once I shift my attention to branch #4 and start making sense of that one, branch #1 stops glowing. So I can't make the connection between the node on branch #1 and branch #4 because I can't grasp the depth of both at the same time.

This has gotten me a bit frustrated, because I can swear what it feels like to really, deeply understand something; this is how I feel in humanities classes. The whole system, the dependency between hundreds of things simultaneously; if you bring the value of x down, what happens to y,z,a,b and everything else. I was a strong biology student at the time, because I think biology relies on a lot of this dependency when considering systems.

However, I just know I just don't get it when it comes to math. But at the same time, it doesn't make sense to me why. Because I think my "intellectual strength", for a lack of a better word, is being able to register the dependencies between many many things simultaneously.

At some point I considered the fact that I might have dyscalculia. But I feel like that's a bit extreme, because I feel like I can get by with day-to-day math requirements just fine... but that might be because I'm well practiced. I also have a tendency to continuously make calculation errors and just write things down wrong? Which also might just be normal!

I'm not sure what to do! I'm wondering if there is advice from anybody, as I'm currently rocking a 27% in my linear algebra class WHOOOPPS.

Thank you!


r/learnmath • • 4h ago

Looking for a Mathematics Partner!

1 Upvotes

I'm looking for someone who is genuinely interested in mathematics and wants to explore it at a deeper level.

I'm a BS Mathematics student, and I want to become skilled in Mathematics , Problem solving , Logical reasoning ( Or more ) we can:

Explain mathematical concepts to each other and share our understanding.

Solve problems together, from basic to advanced levels.

Challenge each other with mathematical puzzles and questions.

Discuss different approaches to solving the same problem.

Take small tests and challenge each other's knowledge.

Explore how mathematics works in real life and where different concepts are applied.

Discuss interesting mathematical ideas and explore the reasoning behind them.

I don't want this to be limited to just studying for exams. I want us to develop a deeper understanding of mathematics, improve our problem-solving abilities, and continuously challenge ourselves.

One important thing: I'd prefer someone who is comfortable communicating through voice or video calls. Showing your face is absolutely not necessary; audio calls are perfectly fine.

You don't need to be an expert or know advanced mathematics already. What matters most is your curiosity, consistency, willingness to learn, and genuine interest in mathematics.

If you're interested in learning mathematics together and growing intellectually, feel free to reach out! :)


r/learnmath • • 18h ago

We built a free, hands-on application to learn quantum computing, starting from school maths. Looking for honest feedback!

1 Upvotes

Hi everyone,

We've been building a project called Quantum Realm, for learning Quantum Computing through interactive elements, starting from the mathematical basics and gradually building up to more advanced concepts.

It's still a prototype, and we'd really appreciate it if you could give it a try and share your honest feedback.

Try it here: https://quantum-realm.vercel.app

What is in it today:

  • Module 1, "Meet the quantum computer": why these machines exist, what is inside one, where the technology really stands today, including where it falls short
  • Module 2, the maths behind it: probability, complex numbers, linear algebra
  • A playground after each lesson with small challenges
  • An AI tutor for when you get stuck
  • An Android app you can download from the site

What we'd particularly like to know:

Is it engaging, or does it feel too much like a traditional textbook?

Is the level appropriate for someone learning quantum computing for the first time?

Do the interactive elements actually help build intuition, or do they feel like unnecessary distractions?

What topics, explanations, or exercises would you like to see added?

Would you actually use something like this to learn quantum computing? What would make you come back?

It's completely free, and we're not selling anything. We're at an early stage, so this is exactly the kind of feedback that would help us improve.


r/learnmath • • 16h ago

Link Post Math Notion: Free Math Study Guide, Worksheets, Practice Tests & Teacher-written Workbooks

Thumbnail reddit.com
0 Upvotes

r/learnmath • • 19h ago

Why can we “fling around” dx?

26 Upvotes

Isaac Newton visualized these numbers as infinitesimally small numbers, but that is not a well-defined definition. Obviously we use the limit definition instead, which defines, for f(x)=x, f’(x) = 1, for instance. If I put this is Leibniz notation df/dx = 1, df/dx becomes no more than notation to indicate the variable being differentiated, right? So why do I often see df=dx and substituting for dx and dy and du and all of that?


r/learnmath • • 20h ago

RESOLVED beginner algebra word problem struggle, how do i make something fit two conditions? (pounds and price)

5 Upvotes

question:
7. Two different teas are mixed to make a blend that will be sold at a fair. Black tea sells for $2.20 per pound and orange pekoe tea sells for $3.00 per pound. How much of each should be used to obtain 4 lb of a blend selling for $2.50?

im not sure how to make an equation in which i solve for both 4 pounds and it costing 2.50. i got solving for one condition (like finding oz or litres of a mixture) but this is a new question. i've banged my head against my notebook not sure how to go about this. the book gives the answer as 2.5 lbs of black tea and 1.5 of orange pekoe tea.

my attempts:
2.20p + 3p = 2.50(4)

this didn't work at all and i recognize that 4 lbs is WORTH 2.50 and this was a poor way of phrasing, but i wasn't sure how to express 4 lbs = 2.50 on the right hand side and guessed.

i tried
2.20 + 3p = 2.50/4

not sure why i tried this but i did and its also incorrect

i also tried
2.20p + 3p = 4
i tried solving for p only so it could equal 4. gave me much too small of a number. same when i tried this except the right hand side = 2.50

i guess my main problem is im not sure how to go about expressing this mathematically. help appreciated. trying my best to get really good at word problems.


r/learnmath • • 7h ago

How to turn things around?

3 Upvotes

I’m a first year undergrad mathematics student in the UK and I’m starting to worry about whether or not Im going to be able to do even remotely well in my degree, or even pass the first year. For context, it’s at the university of Oxford (not trying to sound pretentious, but trying to convey that the course difficulty and workload intensity are therefore very tough to handle, I don’t think I even deserve to be here to be honest).

I knew what I was getting into when I chose to study mathematics, and did preparation beforehand. Things started well but the difficulty of problem sheets (assignments) ramped up quickly and I started to struggle a lot, especially in comparison to the rest of the students in my cohort. Now I’m 2 months in and I’m barely scraping by. The modules I’m doing at the moment are Calculus, Linear Algebra 1, Analysis I: Sequences and Series, Geometry (similar to linear algebra) and Probability. I’ve consistently been to all my lectures and tried my very best on every single problem sheet I was given. The actual content we learn hasn’t been too difficult to wrap my head around for the most part, but I’m having a ridiculously hard time applying what I learn to solve the problems in the problem sheets, especially when it comes to more abstract concepts. Even when I do solve the problems on my sheets, often times I need a hint from a classmate or tutor. Many times I don’t even know where to start when approaching the problem. Don’t get me wrong, I’m enjoying what I’m learning and have 0 intention of giving up, but it feels like I’m not getting anywhere at all when it comes to problem solving, and at this rate, there’s a solid chance I fail my first year finals. It’s gotten to the point where I ask myself why I’m still trying.

The things I’m struggling on the most are linear algebra (span and basis, linear maps, rank-nullity and bilinear forms etc.), geometry (isometries, orthogonal matrices and bases) and parts of calculus (jacobians and partial derivatives, scalar line integrals).

I know my question is really vague but does anyone have any advice on turning things around, and how to develop an intuition for the more abstract or complex aspects of higher level mathematics and get better at problem solving, especially for more rigorous proof-orientated mathematics?


r/learnmath • • 11h ago

How do I transform boolean function (BC+A)(B'C)' to a function that solely relies on NOR gates?

2 Upvotes

In my task it is told that I need to use De Morgan theorem, but I could not come up with the solution as I can not get rid of variable complements such as for example (B'+C')'

Thank you in advance for the help


r/learnmath • • 13h ago

Does working hard in mathematics make u smarter, or is it just about applying what u already study? Cuz even if u study a subject really, really well, there's always an exercise where u just can't touch the pen.

3 Upvotes

Actually, if that's true, then being intelligent isn't necessarily related to how much u study. It's more about something within your brain.

My question is: how can I improve this ability?

Please understand what I mean. I'm not asking how to solve every single exercise. I'm looking for something that can train my brain to deal with any exercise, even when it's something completely new that I've never encountered before.

This is what I got after more than two years of studying mathematics.


r/learnmath • • 16h ago

TOPIC Learn Stochastic Processes (Theory, Application, Code)

0 Upvotes

Repo: https://github.com/JulianChaoul16/Stochastic_Processes_Independent_Study-.git

Last spring, I spent the semester doing an independent study in stochastic processes; it was a good mixture of applied and theoretical work.

The goal of the study was to learn the topics while building small projects to show real applications of the project. I also built a final project and a final presentation that I presented to a panel.

Some topics I covered:

  1. Random walks: drift and entropy
  2. Markov chains: transition matrices, stationary distributions, plus an n-gram sentence generator (it does a pretty good Batman impression)
  3. Martingales: fair games vs roulette, and why the doubling strategy fails
  4. Brownian motion: built as the limit of a random walk, then extended to geometric Brownian motion (GBM)
  5. Continuous-time Markov chains: birth-death processes and SIR epidemic models
  6. Poisson processes: taxi arrivals, with Exponential and Gamma waiting times
  7. Time series: AR/MA models and hidden-Markov regime switching
  8. Final project: 7 progressively more complex models of Microsoft's stock price, backtested on 2018

While I do not suggest this be a substitute for a traditional textbook or course, it is a good first look at the realm of stochastic processes. The repo is split into code, visuals, and the theory itself.

I'd love feedback, especially on anything I explained wrong. Also, if you could think of another cool application of these topics, that would be awesome.


r/learnmath • • 16h ago

What actually is Ultrafinitism?

22 Upvotes

I have heard about the story of ultrafinitists not believing in the concepts infinity, continuum, uncountable, etc. They are trying to explain mathematics with finite stuffs only, but I don't understand how. The key question, at least I think so, is that what is the actual upper bound (instead of infinity in modern mathematics) of that world ultrafinitists believe they are living in? Is there one? Or is it just a belief of that it exists and cannot be stated?