

Dropping support for that stuff means breaking 95% of the websites people currently use. It’s a non-starter, it cannot ever happen, even if you think it would be for the best.
Dropping support for that stuff means breaking 95% of the websites people currently use. It’s a non-starter, it cannot ever happen, even if you think it would be for the best.
The standard .NET C# compiler and CLI run on and build for Windows, MacOS, and Linux. You can run your ASP.NET webapps in a Linux docker container, or write console apps and run them on Linux, it doesn’t matter anymore. As a .NET dev I have literally no reason to ever touch Windows, unless I’m touching legacy code from before .NET Core or building a Windows-exclusive app using a Windows app framework.
Ok, there’s no such thing as native Windows apps for Linux, but there are cross platform GUI frameworks like Avalonia and Uno that can produce apps with a polished identical experience across all platforms, no electron needed
It’s fully cross platform with .NET Core and later.
Code is easy in a vacuum. 50 moving parts all with their own quirks and insufficient testing is how you get stuff like this to happen.
No, they’re not sure. You’re correct.
Definitely not.
All people. 320kbps mp3 is completely audibly transparent under all normal listening conditions. It’s a low-tier audiophile meme to claim otherwise but they will never pass a double-blind test.
That’s what the /etc/foo.conf.d/ is for :DDDDD
The argument describes an algorithm that can be translated into code.
1/(1-x)^(2) at 0 is 1
(1/(1-x)^(2) - 1)/x = (1 - 1 + 2x - x^(2))/x = 2 - x at 0 is 2
(1/(1-x)^(2) - 1 - 2x)/x^(2) = ((1 - 1 + 2x - x^(2) - 2x + 4x^(2) - 2x(3))/x(2) = 3 - 2x at 0 is 3
and so on
Let f(x) = 1/((x-1)^(2)). Given an integer n, compute the nth derivative of f as f^((n))(x) = (-1)(n)(n+1)!/((x-1)(n+2)), which lets us write f as the Taylor series about x=0 whose nth coefficient is f^((n))(0)/n! = (-1)^(-2)(n+1)!/n! = n+1. We now compute the nth coefficient with a simple recursion. To show this process works, we make an inductive argument: the 0th coefficient is f(0) = 1, and the nth coefficient is (f(x) - (1 + 2x + 3x^(2) + … + nx(n-1)))/x(n) evaluated at x=0. Note that each coefficient appearing in the previous expression is an integer between 0 and n, so by inductive hypothesis we can represent it by incrementing 0 repeatedly. Unfortunately, the expression we’ve written isn’t well-defined at x=0 since we can’t divide by 0, but as we’d expect, the limit as x->0 is defined and equal to n+1 (exercise: prove this). To compute the limit, we can evaluate at a sufficiently small value of x and argue by monotonicity or squeezing that n+1 is the nearest integer. (exercise: determine an upper bound for |x| that makes this argument work and fill in the details). Finally, evaluate our expression at the appropriate value of x for each k from 1 to n, using each result to compute the next, until we are able to write each coefficient. Evaluate one more time and conclude by rounding to the value of n+1. This increments n.
Your first sentence asserts the claim to be proved. Actually it asserts something much stronger which is also false, as e.g. 0.101001000100001… is a non-repeating decimal which doesn’t include “2”. While pi is known to be irrational and transcendental, there is no known proof that it is normal or even disjunctive, and generally such proofs are hard to come by except for pathological numbers constructed specifically to be normal/disjunctive or not.
Web of trust
It’s not all of Microsoft, you just can’t download ISOs from their website.
The eigenvalues of a diagonal matrix are the values on the diagonal. Diagonalizable matrices’ eigenvalues can be determined by diagonalizing them and looking at the entries on the diagonal.
Microsoft blocks people from downloading stuff all the time for unknowable reasons. You have to either reset your IP or go through customer support to fix it. I did the latter and they did not tell me why I was blocked in the first place.
But something has to be written on the birth certificate and social security card, and that’s what everything else will expect you to use. I think just due to technical limitations (e.g. of the printer/template for those things) it wouldn’t be allowed, but I dunno about legally
Keycaps are expensive but you can easily spend $500 on a keyboard chassis/plate/pcb alone
It’s a different situation, as a dev I’d happily bet my life on this assumption.