![](/static/253f0d9/assets/icons/icon-96x96.png)
![](https://lemmy.ml/pictrs/image/CJ7moKL2SV.png)
Thats what the 2fa for most transfers is for.
Thats what the 2fa for most transfers is for.
highly scalled person
You might be on to something, it might have been the lizzard people!
Watched it today and could not stop myself from referencing life of brian, when paul said he was not the messiah.
Idk, its not like there’s no housing shourtage/rant gauging in other countries with more sensible zoning.
Well I ain’t just gonna repeat it…
Nah, TCP is still just kicking the box over, but just kicking it over again, if the reciever doesn’t kick back a box saying they got it.
B is for Bribery
yay, we replaced it with more ?masculinormativity? :D.
Try (100,100,100,100,100,101) or 50 ones and a two, should result in 102 and 4 as a max respectively. I tried using less numbers, but the less numbers you use, the higher the values (to be exact less off a deviation(%-difference) between the values, resulting in higher numbers) have to be and wolframAlpha does not like 10^100 values so I stopped trying.
thanks for looking it up:).
I do think the upper bound on that page is wrong thought. Incedentally in the article itself only the lower bound is prooven, but in its sources this paper prooves what I did in my comment before as well:
for the upper bound it has max +log(n) . (Section 2, eq 4) This lets us construct an example (see reply to your other comment) to disproove the notion about beeing able to calculate the max for many integers.
to be fair it does seem to work for any two numbers where one is >1. As lim x,y–> inf ln(ex+ey) <= lim x,y --> inf ln(2 e^(max(x,y))) = max(x,y) + ln(2).
I think is cool because works for any number of variables
using the same proof as before we can see that: lim,x_i -->inf ln(sum_i/in I} e^(x_i)) <= ln(.
So it would only work for at most [base of your log, so e<3 for ln] variables.
laxatives and sirup?
Like…no. Just stir it occasionally lol
Why? It doesn’t stick while its in the water either way (for me at least, maybe the starch content varies enough to change that around the world).
so 0.3 ~= 1-ln(2)=max(1-ln(2),1-ln(2)) = floor(ln(2*e^(1-ln(2)))) = floor(ln(2)+(1-ln(2))) = 1 ?
That would bee engeneer 2, not Mathematician3 xD.
Just out of curiostity, what was you Idea behind that?
are there no dc-dc PSUs (or technically just voltage regulators I guess) to relace a PSU with available? That way OP could avoid part of the Ac->Dc->Ac->Dc-conversion related losses he would have with a battery-backup.
I think you are wrong!