For every ε > 0, are there only finitely many triples of coprime positive integers a + b = c such that c > d (1+ε), where d denotes the product of the distinct prime factors of abc?
This is a technique John Horton Conway uses a lot, expressing conjectures as games, where two (or more) people try to do something in turns to make, or not make, something happen.
Useful idea.
a⋅x² + b⋅x + c
are given by
x = (-b ± √(b² - 4⋅a⋅c)) / (2⋅a)
φ ∩ (ψ ∪ ρ) ↔ (φ ∩ ψ) ∪ (φ ∩ ρ)
Thanks! I can't even begin to describe how useful this will be!
If I could upvote this more than once, I would!
Unicode, of course: ε
When I need a Unicode character, I find it with my Unicode search page:
Then I copy the character into the document I'm working on. Others have more efficient ways to enter Unicode from their keyboards, like having a list of codes and a keyboard layout that allows the codes to be entered efficiently.