I liked Latin, and could manage the declensions & conjugations, but you do not have to speak it. I can manage the pronunciation, but that is not my problem.
it's really just one venmo transaction, and then i email a picture of a lesliecoin with your name written on it. if you like i could put a random hexadecimal string below that.
there's a blockchain involved but it's very eco friendly. what we go for with lesliecoin is the seamlessness of the transaction.
Politico's New Yorkers pick a new mayor after chaotic, historic primary begins:
NEW YORK — Polls have closed in New York City’s first ever ranked-choice election and, while the die has been cast, voters may not know the outcome for weeks.
[...] Further extending the ballot count is the advent of...
they should shut the door on 2010-2019. didn't do anybody any good
open older questions can stay open
ted, you'll like this. we have a 'timed exchange' of emails with the other side tonight. we have to exchange documents and nobody wants the other side to see theirs first and then make edits before they reply back, so we agree on a time. i proposed 9 and they came back with 10.
for enrollment in courses they took us to a classroom in evans with a bunch of telephones, and we sat down with paper course catalogs and dialed into the enrollment system
What is structural induction ? I heard that strong induction can be proven from ordinary induction and ordinary induction Is one of the axioms of the peano axioms (axiom of induction). But then , which axiom system does structural induction come from?
@copper.hat There was a Batman logo thread on Code Golf a few years ago. I submitted two entries in sed, three in Python, and one in Conway's Game of Life. codegolf.stackexchange.com/q/126223/46655
Tupper's self-referential formula is a formula that visually represents itself when graphed at a specific location in the (x, y) plane.
== History ==
The formula was defined by Jeff Tupper and appears as an example in Tupper's 2001 SIGGRAPH paper on reliable two-dimensional computer graphing algorithms.
This paper discusses methods related to the GrafEq formula-graphing program developed by Tupper.Although the formula is called "self-referential", Tupper did not name it as such.
== Formula ==
The formula is an inequality defined as:
1...
max_y min_x Ax -By can anything be said about finiteness of such an expression without knowing A and B. A and B are matrices. max and min are taken over the entire space of Rn
@AkivaWeinberger BTW, you get Fibonacci & Lucas numbers from the solutions to the generalised Pell equation related to phi, $x^2-5y^2=\pm 4$. You might enjoy playing with the PQA algorithm. mathafou.free.fr/exe_en/exepqa.html
@copper.hat In this case $\lim_{n\to\infty}f_n=0$. So the left hand side (where the limit is inside the integral) is equal to zero. The right hand side is equal to $1$ then?
In the second part of the question I posted ... Why I can't put x = y = z ? Using AM GM inequality. Though in this case I know it is a plane so its value will be normal distance of plane from origin But why AM GM inequality not work ?
If there was no constraints given than for any value of x, y,z optimum value would be when x = y = z . And the constraint also allows me to do so ... Than why this is not valid ?
@LeakyNun sometime we change the powers to be optimised by writing 2x = x + x and so... Then why is it necessary for situation to be symmetric in x, y and z
We have $2^n$ rows for $n$ variables in the truth table, so in total we have two possibilities for each row, either True or Flase, for all rows, we have 2 values (true, false): $2~values(true,false) ~~ \times (2n) ~times ~~\times 2~values(true,false)=2^{2n}$. Is that correct please?