## Is there a spell, ability or magic item that will let a PC identify who wrote a letter?

In my campaign my players are working for a secretive organisation, and gets their orders through a magical scroll that lets them send messages back and forth. There are two copies of the scroll, and a copy will display whatever is written in the other.

They now suspect that someone is impersonating their contact, and want to try to locate either the other copy of the scroll, or somehow identify the person writing in the scroll.

Is there a spell, ability, or magic item that will let a PC do this?

So far I’ve identified Legend Lore, which could probably get them some information on the organisation they’re working for, and Scrying, which (depending on how you rule) could let them target the sender. There is also the Retriever, even if it feels a little extreme.

(I could just homebrew something, but it is interesting for me to know if such a thing already exists)

## CHECK Constraint to enforce upper case letter and pattern match

For one of my columns I am trying to enforce a pattern. The first letter should be D upper case, and the remaining 3 characters should be digits. For example:

D678, D890, D000

I’m quite new with CHECK constraints and things like regular expressions.

Below is what I’ve done so far, which (I think) enforces the general pattern. However when I try adding something like d900 it works, even though it’s a lower case d. I expected this to fail.

Can someone please assist:

CREATE TABLE Systems( SystemsID NVARCHAR(4), Title NVARCHAR(30), CONSTRAINT chk_SystemsID CHECK (SystemsID LIKE '[D][0-9][0-9][0-9]')); 

## How to add the vector symbol on a letter?

Ho to add the vector symbol on a letter like this: $$\vec{r}$$?

Consider the following code:

k0 = Graphics[{Text[      Style["\!$$\*SubscriptBox[\(K$$, $$0$$]\)", 12], {0.5, -0.05}],      Thick, Arrow[{{0, 0}, {1, 0}}]}]; k1 = Graphics[{Text[      Style["\!$$\*SubscriptBox[\(K$$, $$0$$]\)-q", 12], {0.5, 0.2}],      Thick, Arrow[{{0, 0}, {0.8, 0.2}}]}]; q = Graphics[{Text[Style["q", 12], {0.9, 0.15}], Thick,      Arrow[{{0.8, 0.2}, {1, 0}}]}]; l = Graphics[{Text[Style["\[Theta]", 12], {0.2, 0.03}], Thick,      Line[{{0, 0}, {0.2, 0}}]}]; Show[k0, k1, q, l, Boxed -> False] 

## What is “[High Level] Letter of Challenge” in Kritika Reboot

Every I kill the boss, then there are appears some notifications, includes "[High Level] Letter of Challenge". I have 52 items. It’s explain that this item can make a dungeon with raids monster. But how to use it?

## Would a two word domain name with a shared letter between the words be treated the same for SEO as the fuller name?

I found a domain name (2 words) that is not available. Then I found almost the same domain name with a slight difference, the last letter of the first word is the same of the first letter of the second word.

Ex : jamessecret.com (not available)      jamesecret.com (available) 

In terms of SEO, is it seen as the same to Google? Would search engines interpret them the same?

## Regular Expression for strings of minimum length six and second and second last letter is ‘a’

I am trying to convert this language into regular expression. And I came up with (a+b)a(a+b)*a(a+b)

I just wanted to ask if it is correct?? Any help shall be highly appreciated.

## Over the alphabet {a,b,c,d}, how would i construct a NFA that only accepts strings that end with a letter that is already part of the string?

I’ve been trying to create a NFA that accepts strings that end with a letter that exists in the string. For example abcdb, cbdd, acac etc. while strings like abc aacd etc are not accepted since the last letter wasnt in the string before the last letter was read. I only seem to be able to create a NFA that accepts a subset of the language. What is the right way to go about it? I’m very lost.

## Weighted automaton counting occurrences of the most frequent letter

Here’s a problem I’ve been dealing with for the past few weeks.

On the alphabet $$\Sigma=\{a, b\}$$, give a weighted (finite) automaton recognizing the language $$\{(u, \max(|u|_a, |u|_b))\mid u \in\Sigma^∗\}$$,

## What is the schema vocabulary for industry dealing in online resume and cover letter builder?

I’d like to know if a company dealing in online resume and cover letter service, and have pages like resume templates etc then which schema type is best suitable for the page.

The following pages are:

• Resume Templates
• Resume Samples
• Cover Letter Examples
• Online resume builder

I would appreciate if anyone have experience in working with career industry and can answer this with an example of schema code.

## Is better to have as password a setence or first letter of the setence?

Which is better master KeePass password to prevent bruteforce between theses two type of password :

• Complete sentence invented by user like : I like cheeseburger, tomatoes and fries ! 🙂

• Each first letter of the word with lower and higher case : Ilcb,tAf!:)

Edit : My hesitation come from the facto that the sentence indeed is more longer but, it composed of real words which could be taken from a dictionnary.