Re:Proof Claimed for Deep Connection between Prime Numbers
by ColinWright on Tuesday September 11, 2012 @09:34AM
(#4505304)
Link to a clear statement of the question, expressed as a game:
http://news.ycombinator.com/item?id=4505264
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.
Re:Proof Claimed for Deep Connection between Prime Numbers
by csense on Tuesday September 11, 2012 @12:48AM
(#4503864)
How do you get epsilon to appear in comments? The only docs I could find on formatting are http://news.ycombinator.com/formatdoc and it has no clues.
Re:Proof Claimed for Deep Connection between Prime Numbers
by mmcnickle on Tuesday September 11, 2012 @05:41AM
(#4504547)
Those familiar with LaTeX may find the following tool useful: http://www.unicodeit.net/ It takes LaTeX symbols as input and outputs the unicode for them. There is a mac app available too, which will convert it in-place for you too.
Re:Proof Claimed for Deep Connection between Prime Numbers
by csense on Tuesday September 11, 2012 @04:32PM
(#4507646)
The solutions to
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!
Re:Proof Claimed for Deep Connection between Prime Numbers
by lutusp on Tuesday September 11, 2012 @12:55AM
(#4503873)
> How do you get epsilon to appear in comments?
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.
Re:Proof Claimed for Deep Connection between Prime Numbers
by mseebach on Tuesday September 11, 2012 @02:53AM
(#4504141)
I just Google "unicode [name of character]". Hasn't let me down yet.
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?