[ Politics ] Open Question : Was Trump wrong for telling Congress Lawmakers to “go back to where they come from” or no?

Trump on Sunday morning targeted “progressive Democratic congresswomen,” — most likely referring to the “Squad” of freshman progressives which include New York Rep. Alexandria Ocasio-Cortez, Massachusetts Rep. Ayanna Pressley, Michigan Rep. Rashida Tlaib, and Minnesota Rep. Ilhan Omar — and told them to “go back” to their “corrupt” and “broken and crime infested” countries.

What do you roll Insight against when a PC is telling the truth? [duplicate]

• What do you roll Insight against when the other person is telling the truth? 4 answers

There is already a similar question, however the answers focus on that you should not tell players that they don’t believe the other but they should decided that themselves and only get hints. And while that may be true, it doesn’t actually answer the question posted in the title. I started to talk about it in the comments of the first answer but the discussion is too extended for comments. So here a new question.

In my specific case I have a new character x joining the party and he wants to help the party and tells them the town master is actually bad. The party has no reason to believe him. They ask for an insight check. Now what does x roll?

X is a charismatic character and I want him to be able to take advantage of that maybe via persuasion. But I don’t just want to contest the party insight with his persuasion, because I feel like a high role on either side should be rewarded by on one hand x showing signs of being truthful and the party reading those signs. I was thinking about adding both checks and taking an average against DC 10 but it seems a bit random.

Algorithm telling when an affine curve is planar

I am sorry, I asked a misguided question here: Reference request: smooth affine curves are planar, here is my attempt at a better question.

Let $$\mathfrak{p}$$ be a prime ideal of $$\mathbb{C}[x, y, z]$$ of height 2. It defines an integral affine scheme of relative dimension 1 over $$\mathrm{Spec}\:\mathbb{C}$$ (I found this: https://math.stackexchange.com/a/49285 useful to clarify how dimension works here). This curve may or may not admit a $$\mathbb{C}$$-locally closed immersion in the projective plane.

My question is, can we determine whether there exists such an immersion algorithmically. The input is an explicit set of generators for $$\mathfrak{p}$$ (there can be more than 2 generators of course, but still a finite number because the algebra is Noetherian). The output is yes or no (does there exist such an immersion or not). Simpler algorithms are preferred. If you also give an implentation in some CAS that is great.

This is the message I am receiving:

Only add people who you know
Please only send friend requests to people who you know personally. If you think you’re seeing this by mistake, please let us know

Why am I receiving this message?

Telling users passwords don’t match and aren’t strong enough

I have two functions in my user registration form

• The other checks if the password is strong enough.

I have two presentation related questions

• What words should I use if the passwords don’t match or isn’t strong enough? I have a text field beside the first password which is initially empty but gets updated as each character is typed in (I can add a second text field beside the confirm password part).
• When and in what order should the functions be called? For example if I only call the passwords match function on the confirm password section then if the user goes back and changes the first password things will get messed up. If I call the passwords match function at the first time the user types in the password then it will override the message about the password not being strong enough or the strong enough password will override the “password don’t match” message.

The function that checks if the password is strong enough is real simple, just to prevent “123” and password. In the future I’d like to make an option to unmask the password and only have one field and no confirm.

Just got a new privacy banner on facebook telling me they are watching me..lol

They are not the boss of me!

Telling Probability of Point Configurations being in Convex Configuration from Vertex Degree in Planar Euclidean MSTs

Question:

what is the probability that four distinct points in general position in the Euclidean plane are in convex configuration, depending on the number of leaf nodes in their MST?

I assume that a quadruplet of points has a higher probability of being in convex configuration if its MST has two leaf nodes than if it has three, but that that probability is less than 1.

Telling right from left

I know a lot of people, some of them mathematicians, who have trouble telling right from left. This can lead to problems when you are composing functions, for example.

When did this seemingly innocuous confusion lead to wrong results being published? Here is an example from arithmetic geometry.