Cecil Ellard

[Cecil Ellard @cecilellard]

@NetworkFact This is also true of any graph whose vertex set has cardinality at most |R|.

[Cecil Ellard @cecilellard]

@LensScientific But as Newton proved in his Principia, it would still be true that equal areas are swept out in equal times.

[Cecil Ellard @cecilellard]

@AlgebraFact What are some nice applications of this theorem?

[Cecil Ellard @cecilellard]

@TonesOfMusic Lenny White, with Return to Forever, around 1976.

[Cecil Ellard @cecilellard]

@00aleph00 I have been watching your YouTube video “The bridge between number theory and complex analysis”. I really like the video but there seem to be some issues; for example at 5:50 where you state there are 5 solutions mod 2. Also, at 5:55 the prime 11 is missing.

[Cecil Ellard @cecilellard]

@Math_files It is a connection between the modular function j and the finite simple Monster group.

[Cecil Ellard @cecilellard]

@AnecdotesMaths Multiply both sides by 28 to see why.

[Cecil Ellard @cecilellard]

@kristinatastic Mothers of Invention

[Cecil Ellard @cecilellard]

@mikeandallie Conjecture: if a < b are real numbers, then there exists a number in (a, b) which contains the letter A.

[Cecil Ellard @cecilellard]

@Math_files Every real number is almost an integer.

[Cecil Ellard @cecilellard]

@AlgebraFact Including the positive integer 1?

[Cecil Ellard @cecilellard]

@jamestanton Assuming ZFC, there a real-valued function defined on the set of all real numbers such that the average rate of change is never equal over any two different intervals [a,b] and [c,d].

[Cecil Ellard @cecilellard]

@Math_World_ Substitute z-4 for x, then solve for z.

[Cecil Ellard @cecilellard]

@Ganeshuor If e < a < b, then b^a < a^b. Challenge: give a non-calculus proof.

[Cecil Ellard @cecilellard]

@schweingehtbree @NetworkFact For me, graph means no loops or multiple edges.

[Cecil Ellard @cecilellard]

For me, graph means no loops or multiple edges.

[gems_paws @schweingehtbree]

@cecilellard @NetworkFact Surely not? - I could just take a graph with one vertex but more than |ℝ| many loops, and then there would surely be no topological injective map into ℝ^3?

[Cecil Ellard @cecilellard]

@TheMathFlow There exists a function f defined and differentiable on all of R such that for all natural numbers n, f(n) is the n-th prime.

[Cecil Ellard @cecilellard]

@AnalysisFact I believe his proof was incomplete.

[Cecil Ellard @cecilellard]

@AlgebraFact Also: r-k=r+1-k