## photoshop – Erase tool partial opacity on Layer Mask?

Don’t use Erase on layer masks, just use the brush.
Pick a colour – well, two colours, white to paint in, black to paint out, grey if you need finer control [though I personally use the opacity & flow controls instead of greys].

Use X to flip between the two quickly.

Erase erases to the current background colour, which not only is a variable, just like the brush, but will also erase bits you didn’t mean to, as it indiscriminately erases both black & white [and any grey in between] back to itself.

## photoshop – This is driving me crazy. Erase tool partial opacity on Layer Mask?

I’ve been using Photoshop for years but this issue has me totally baffled.
It must be some setting I changed, but I have NO IDEA why this happens or how to change it.

The issue is that on layers masks (doesn’t matter what kind), the erase tool will ALWAYS leave some percentage of opacity, no matter what I try.
You can see the vague grey-ish area that I attempted to erase, but it will never go to full transparancy. See image below.

## Partial correctness for array multiplication [closed]

Can someone help me to prove partial correctness and termination for array multiplication.

## google sheets – Conditional Formatting w/multiple conditions and partial text match

I am working in google sheets and have a manual input quantity in column E. I am trying to write a conditional format that will highlight each cell in column E (or the whole row) that is greater than 1 only if column C’s matching row begins with “EM”. I have a few variations but this is closest that could seem to work but cells that do not match the conditions are getting highlighted and cells with the conditions are being omitted…

=and(regexmatch(C2,”EM”),E2>1)

I know I will need some wildcards in there but I tried a few different combo’s already with no luck. Thanks for any help!

## Numerical \$n\$-th order mixed partial derivative

To start with, this might be a naive question since I do not have a lot of experience with numerical analysis.

Let $$f(boldsymbol{x})$$ be a function in $$M$$ variables, i.e. $$f:mathbb{R}^Mtomathbb{R}$$. I wonder how one would compute numerically an $$n$$-th order mixed partial derivative at $$boldsymbol{a}$$ of the form

$$left( prod_{k=1}^{M} frac{partial^{m_k}}{partial x_k^{m_k}} right) f(boldsymbol{x})_{vert boldsymbol{x} = boldsymbol{a}} ; ;text{where} sum_k^M m_k=n$$

i.e., in all generality, the $$n$$ partial derivatives are distributed arbitrarily over the $$M$$ variables.

So far, I have looked into finite differences and indeed in 1D, one can work out formalue for the $$n$$-th order derivative. But, I cannot find anything general applying to the multivariate case. I have found some things about stencils for 2D for low order mixed derivatives.
I am looking for a formula and even more importantly, I would like to know how the error in such numerical derivatives behaves if one goes to high dimensions. Does the approximation become worse and worse or is it independent of the dimensionality?

## Calculate Aliexpress partial refund sum when using coupons

Consider following order:

``````Total:              440.86  -  Price of 2 pieces
Seller coupons:      77.62  -  Seller coupon 77.62 of 350
Coins:                6.99  -  Mobile coins discount
Total Amount:       356.26

AliExpress coupons: 200.00  -  Aliexpress coupon 200 of 350
Payed:              156.26  -  The sum I've payed to aliexpress
``````

Now I’m opening dispute.

I want to receive 156.26 / 2 = 78.16 as money.
Aliexpress specifies limits up to 356.26.

I’m not sure what discounts will be subtracted from the sum I will specify for refund. As I understand Aliexpress coupon will be, so I have to specify at least 278.16. But I remember that in previous disputes Seller coupons was subtracted too.

How should I calculate the correct sum to specify in dispute?

## partial differential equations – Help with comprehension of this paper:

forgive me for my lack of knowledge on this, as I understand it’s a fairly naive question, but I would like some help with courses of knowledge that will allow me to understand this paper. I have finished Calculus I and II and I am part way through III, as well as linear algebra and the Kahn Academy multivariable calculus course. however I have yet to understand the Phi symbol in this paper, or the := operator or the |-> operator, for example. I’d love if someone with a knowledge of applied mathematics could recommend some course names I can follow up with, to complete my understanding of this mathematics employed here.

Thank you so much!

## partial differential equations – Difficulty proving the coercivity of \$ a (u, v) = int _ { Omega} nabla u cdot nabla v \$

I am obliged to prove the coercivity of the bilinear function in the variational formulation of the problem:

$$begin {array} {c} – nabla ^ {2} u = f quad text {in} Omega \ u = g_ {D} text {on} partial Omega_ {D} quad text {and} quad frac { partial u} { partial n} = g_ {N} text {on} partial Omega_ {N} end {array}$$

or $$partial Omega_ {D} cup partial Omega_ {N} = partial Omega$$ and $$partial Omega_ {D}$$ and $$partial Omega_ {N}$$ are distinct.

The variational formulation is:

Find $$u in mathcal {H} _ {E} ^ {1}$$ such as
$$(( int _ { Omega} nabla u cdot nabla v = int _ { Omega} vf + int _ { partial Omega_ {N}} v g_ {N} quad text {for all} v in mathcal {H} _ {E_ {0}} ^ {1} )$$

Or:
begin {aligned} mathcal {H} _ {E} ^ {1} &: = left {u in mathcal {H} ^ {1} ( Omega) | u = g_ {D} text {on} partial Omega_ {D} right } \ mathcal {H} _ {E_ {0}} ^ {1} &: = left {v in mathcal {H} ^ {1} ( Omega) | v = 0 text {on} partial Omega_ {D} right } end {aligned}

Proof by contradiction means $$a (u, v) = int _ { Omega} nabla u cdot nabla v + int _ { partial Omega} uv$$ . but here our bilinear form does not contain the term $$int _ { partial Omega} uv$$

I start by using AspNet Core 3.0 with Dapper and I have trouble loading a partial view in the main view.

I want to load the customer contacts in a list: Customer (view) and Contacts (partial view)

Model customers:

``````public class Cliente
{
(Key)
public int CodCli { get; set; }
public string Nome { get; set; }
public string Fantasia { get; set; }
public string CNPJ { get; set; }

public IEnumerable Contatos { get; set; }

}
``````

Model contacts:

``````    public class ClienteContato
{
public int FkCodCli { get; set; }
public string Fantasia { get; set; }
public string Cargo { get; set; }
public string Nome { get; set; }
}
``````

Controller:

``````public IActionResult Details(int CliId)
{

using (IDbConnection db = new SqlConnection(_config.GetConnectionString("DefaultConnection")))
{
var query = @"SELECT * from VIE_Clientes  WHERE CodCli = @CliId;
SELECT * FROM VIE_ClientesContatos WHERE FkCodCli = @CliId";

var results = db.QueryMultiple(query, new { @CliId = CliId });

if (clientes != null)

return View(clientes);

}
}
``````

Show the details:

``````@model SIGApp.Entities.Cliente

@{
ViewData("Title") = "Details";
}

Details

Cliente

@Html.DisplayNameFor(model => model.CodCli)

@Html.DisplayFor(model => model.CodCli)

@Html.DisplayNameFor(model => model.Nome)

@Html.DisplayFor(model => model.Nome)

@Html.DisplayNameFor(model => model.Fantasia)

@Html.DisplayFor(model => model.Fantasia)

Back to List

``````

Partial view _test

``````@model IEnumerable

Create New

@foreach (var item in Model) {

}

@Html.DisplayNameFor(model => model.FkCodCli)

@Html.DisplayNameFor(model => model.Fantasia)

@Html.DisplayNameFor(model => model.Cargo)

@Html.DisplayNameFor(model => model.Nome)

@Html.DisplayFor(modelItem => item.FkCodCli)

@Html.DisplayFor(modelItem => item.Fantasia)

@Html.DisplayFor(modelItem => item.Cargo)

@Html.DisplayFor(modelItem => item.Nome)

``````

When executing the project, I get the following error:
InvalidOperationException: the model element passed to the ViewDataDictionary is of type
& # 39; SIGApp.Entities.Cliente & # 39 ;, but this ViewDataDictionary instance requires a model element of type
"System.Collections.Generic.IEnumerable" 1 (SIGApp.Entities.ClienteContato) ".

Thanks in advance for any help.

Thank you so much,

Marcelo

## partial sum of a power number equal to a power number of the same power

Can we show that there is at least one pair for each positive integer $$m$$ such as

$$a_1 ^ m + a_2 ^ m + cdots + a_n ^ m = b ^ m$$

Or $$a_i, b, m, n in mathbb {Z} _ +$$ and $$a_i ne a_j$$ for $$1 le i, j le n$$ and $$n> 1$$

Example:

$$begin {split} 1 + 2 + 7 & = 10 \ 1 ^ 2 + 2 ^ 2 + 3 ^ 2 + 5 ^ 2 + 19 ^ 2 & = 20 ^ 2 \ 3 ^ 3 + 4 ^ 3 + 5 ^ 3 & = 6 ^ 3 \ 30 ^ 4 + 120 ^ 4 + 272 ^ 4 + 315 ^ 4 & = 353 ^ 4 \ 7 ^ 5 + 43 ^ 5 + 57 ^ 5 + 80 ^ 5 + 100 ^ 5 & = 107 ^ 5 \ 8 ^ 6 + 12 ^ 6 + 30 ^ 6 + 78 ^ 6 + 102 ^ 6 + 138 ^ 6 + 165 ^ 6 + 246 ^ 6 & = 251 ^ 6 end {split}$$

An example for $$7$$& # 39; e Powers Found by Mark Dodrill:
$$127 ^ 7 + 258 ^ 7 + 266 ^ 7 + 413 ^ 7 + 430 ^ 7 + 439 ^ 7 + 525 ^ 7 = 568 ^ 7$$

An example for $$8$$& # 39; e Powers Found by Scott Chase:

$$90 ^ 8 + 223 ^ 8 + 478 ^ 8 + 524 ^ 8 + 748 ^ 8 + 1088 ^ 8 + 1190 ^ 8 + 1324 ^ 8 = 1409 ^ 8$$

$$9$$& # 39; e and $$10$$& # 39; th by Jaroslaw Wroblewski:

$$42 ^ 9 + 99 ^ 9 + 179 ^ 9 + 475 ^ 9 + 542 ^ 9 + 574 ^ 9 + 625 ^ 9 + 668 ^ 9 + 822 ^ 9 + 851 ^ 9 = 917 ^ 9$$

$$62 ^ {10} + 115 ^ {10} + 172 ^ {10} + 245 ^ {10} + 295 ^ {10} + 533 ^ {10} + 689 ^ {10} + 927 ^ {10} + 1011 ^ {10} + 1234 ^ {10} + 1603 ^ {10} + 1684 ^ {10} = 1772 ^ {10}$$

This question was posted in MSE (2/27/20) got an answer from Robert Israel, but without getting any evidence, hence posting in MO link to MSE message