## I don’t know what is wrong with my Rock, Paper, Scissors Python 2.7 program

Thanks for contributing an answer to Stack Overflow!

But avoid

• Making statements based on opinion; back them up with references or personal experience.

## 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!

## Prize – If I have a photo of a celebrity never published, can I earn money by selling it online on glossy paper?

1975 is a long time ago (although I also remember the year), but this question SE deserves to be read. If I read the Wikipedia "Sheer Heart Attack" page correctly, it looks like the McFarlin Memorial Auditorium would be a private indoor place, so it could be boiled down to whether you can reasonably expect to have permission for photography and the right of author of the work.

Whether it's profitable could end up being a Catch 22. You don't do anything in the photo, whatever? A long time ago, right? But the general rule is that as soon as something makes a significant profit, the lawyers will start coming out of the woodwork. And there is profit.

(A fleeting thought – perhaps that is why Rolling Stone did not respond. Or they may already have the rights to post more photos of Freddie than they did. 39; they cannot use them.)

Short answer – watch out for that. A photo of Freddie never seen before could be great news. If there is a chance that lawyers will get involved, make one first.

## Compact space integration of signed radon measurements in the Sobolev \$ W ^ {- 1, q} \$ space of Evans paper; Does it work in a space dimension?

Context: I am working on a PDE problem where I have an approximate sequence of measured value functions and I have to incorporate it compactly in a negative Sobolev space $$W ^ {- m, q}$$ over the bounded interval $$mathbb {R}$$. I am especially interested in spaces where $$q = 2$$. I only found such integration in the only theorem of the article:

Evans – Weak convergence methods for nonlinear partial differential equations, 1990.

Theorem 6 (Compactness of measurements, page 7): Suppose the sequence $${ mu_k } _ {k = 1} ^ { infty}$$ is delimited by $$mathcal {M} (U)$$, $$U subset mathbb {R} ^ n$$. so $${ mu_k } _ {k = 1} ^ { infty}$$ is precompressed in $$W ^ {- 1, q} (U)$$ for each $$1 leq q <1 ^ *$$.

Here $$mathcal {M} (U)$$ represents the space of the Radon measurements signed on $$U$$ of finite mass, $$U subset mathbb {R} ^ n$$ is an open, bounded and smooth subset of $$mathbb {R} ^ n, n geq 2$$ and $$1 ^ * = frac {n} {n-1}$$ represents a Sobolev conjugate.

The identical theorem (Lemma 2.55, page 38) is given in the book: Malek, Necas, Rokyta, Ruzicka – Weak and measured solutions to evolutionary PDE, 1996, with the difference that instead of $$1 leq q <1 ^ *$$, there is written $$1 leq q < frac {n} {n-1}$$ (Here it is not explicitly written that $$n geq 2$$).

My question: Theorem 6 works in one dimension ($$n = 1$$)? Simply put, do we have a compact footprint of space $$mathcal {M} (U)$$ in space $$W ^ {- 1, q} (U)$$, or $$U subset mathbb {R}$$?

• I guess if we have a compact integration in $$W ^ {- 1, q} (U)$$, we also have it in the $$W ^ {- m, q} (U), m geq 1$$?
• Are there other measurement spaces (for example, finite positive measurement space $$mathcal {M} _ +$$, probability measure space with finite first moment $$Pr_1$$, etc.) which are compactly integrated into certain negative spaces of Sobolev $$W ^ {- m, q} (U)$$?

I think if we use the definition of the Sobolev conjugate: $$frac {1} {p ^ *} = frac {1} {p} – frac {1} {n}$$, we get for $$p = 1, n = 1$$ the $$frac {1} {1 ^ *} = frac {1} {1} – frac {1} {1} Rightarrow 1 ^ * = infty$$. So we would have Theorem 6 (maybe) to work for each $$1 leq q < infty$$ (then for $$q = 2$$ as well)? If we use $$p ^ * = frac {np} {n-p}$$ we would have for $$n = 1,$$ $$p ^ * = frac {p} {1-p}$$ and here we couldn't take $$p = 1$$ and get $$p ^ *$$.

I don't usually take care of measured and negative Sobolev spaces, so I don't know much about them. Help would be great and I really need it. And any additional references in addition to the two mentioned above would be nice. Thanks in advance.

## printing – What PPI should I set for photos to avoid pixelated and jagged edges on the paper?

I want to take some photos using the smartphone. I will receive JPEG files. The PPI will be 72. The next step I will move these photos to a desktop computer. The next step, I will convert JPEG photos to TIFF. I don't know which software I will use for this. Maybe GIMP, ImageMagick or something else.

During editing, I don't want to use JPEG because JPEG has lossy compression. This affects editing and artifacts. If I edit photos, I save them several times. If I edit photos in JPEG format and save them several times, I will receive artifacts there. I don't want any artifacts in the photos. Because of this, right after I move photos from a smartphone to a desktop computer, I will convert photos from JPEG to TIFF.

Next step, I will modify these TIFFs: some of them will be cropped, scaled, rotated. On some photos, I will adjust the brightness and contrast. I don't know which software I will use for this. Maybe GIMP, ImageMagick or something else.

Next step, I will import edited TIFF files into software in which I will organize the photos on the pages and add a few lines of text to each of them – explaining what is in the photo . On each page, I will organize some photos and texts for each of them. I will have about 9 or 10 pages. Maybe I'll use LibreOffice Writer, Scribus or something else. The next step, I will create a PDF file.

Next step, I will send a PDF file to a friend. A friend will read it on a smartphone or desktop computer. It will use Adobe Acrobat Reader or something equivalent. Maybe a friend will want to print this PDF to the printer. In this case, the photos on paper must not have pixelated and jagged edges.

What PPI should I set for photos to avoid pixelated and jagged edges on the paper?

## usa – Are the 100USD 2008 paper notes too old to be exchanged in the UK?

I have a 2006A US \$ 100 bill. When I asked the question in a suburban bank branch, probably over a weekend, the employee * trying to move the line faster told me that she could no longer be used. I was surprised and disappointed.

At home, I did a quick web search and found the US Treasury web pages on the US \$ 100 bills.

https://www.uscurrency.gov/denominations/100

Most importantly, ALL money from the United States is worth its face value. Period. The bank employee was wrong. It is never removed. Any invoice of US \$ 100 is worth \$ 100. Details on how to identify a legitimate invoice are available on the website.

My 2006A series is from the 1996-2013 era. It has all the security features and recognition marks. I plan to come back and train them on the subject if they do not accept the invoice.

1] Safety thread: A thread embedded in the paper indicates "USA 100", to the left of the portrait of Benjamin Franklin. Visible from both sides. Said to glow pink in UV light.

2] A water mark that echoes the portrait of Franklin on the far right of the note. Again, hold it in the light, its visible from each side.

3] The "100" printed in the lower right corner on the front side of the ticket color changes from green to black depending on the viewing angle. Seems like a sparkling close-up.

4] The "100" printed in the lower left corner of the side of the face is micro-printed "USA 100" instead of hatching to give it a "gray" appearance.

5] "UNITED STATES OF AMERICA" are micro-printed on the edge of Franklin's lapel.

6] Printing is in 3D – Treasury and mint seals are embossed and can be recognized on the back of the bill, as are the "hundred dollars" and the bottom "100" and "100" on the side of the face.

* One who politely asks, when a line forms, "What can we do for you today?" that is to say, "Can I get you out of this line in one way or another?", or "Is there a chance that what you want does not require one of the 2 service tellers?

## spells – Where can I find the legion details of the Featured folded paper?

The feat comes from Green Ronin's Bestiary Advanced, which is also where the model comes from.

Preconditions: Ability to summon a monster or ally of nature as a spell or similar ability to a spell.

Advantage: Whenever you summon a monster or nature ally as a spell or spell-like ability, you can choose to call 1d4 + 1 ofuda's level creatures rather than 1d3. In addition, you gain +1 ofuda of creatures of the appropriate type for each level greater than the spell effect than the summoning table where the reselected creature appears. For example, with a monster summon IV spell, a caster can summon 1d4 + 1 giant scorpion ofuda, 1d4 + 2 cheetah ofuda (from the monster summon table), 1d4 + 3 ofuda giant centipede (from the summoning table of monster II), or 1d4 + 4 ofuda say rats (from the summoning table of monsters I).

This cannot be applied to summoning due to the summoning ability of a universal monster.

As for how Summoning Ofuda creatures work, if you were to say Summon Monster 6, you can summon 1d3 Ofuda creatures from the Summon Monster 6 list, or 1d4 + 1 Ofuda creatures from n & # 39; any list below (go two or more lists below). is still only 1d4 + 1 monsters, the legion of the folded paper feat changes that).

## Is it possible to write a bitcoin transaction, having only a pen, paper and a private address key with unspent outflows?

In my last answer, I made an allegation that I want to prove or refute. If it works, how much paper is needed? What kind of software does Bob need to send a transaction to miners?

update What is the simplest calculator (no laptop, smartphone or raspberry) you need to make this humanly possible? How long does it take to validate the written transaction?

## Python – Online encrypted rock paper scissors set

I did an RPS game with python with the `Crypto` and `socket` modules.

I would like you to look at the code and tell me if something can be improved and if there are errors, etc.

The game works like this, the server establishes the socket connection, then listens to at least 2 clients, when there are 2 clients in the session, they must choose a nickname to play. Once they have chosen, the need to choose R / P / S. The server sends clients its public key, they encrypt their choice and send it back to the server. The server decrypts its choice and calculates the result. The result will be sent to both customers.

Note * – Only the client's choice is encrypted, there is no need to encrypt other data on the network.

Server:

``````import socket
from Crypto.PublicKey import RSA
from Crypto.Cipher import PKCS1_OAEP
from time import sleep

def rules(first_choice, second_choice, mem1, mem2) -> str:
first_choice = first_choice.decode(); second_choice = second_choice.decode()
if (first_choice == 'R' and second_choice == 'P'
or first_choice == 'P' and second_choice == 'S'
or first_choice == 'S' and second_choice == 'R'):
return f'nResult: {mem2} Wonn{mem1} Choice - {first_choice}n{mem2} Choice - {second_choice}'
elif (first_choice == 'S' and second_choice == 'S'
or first_choice == 'P' and second_choice == 'P'
or first_choice == 'R' and second_choice == 'R'):
return f'nResult: Tie!n{mem1} Choice - {first_choice}n{mem2} Choice - {second_choice}'
else:
return f'nResult: {mem1} Won!n{mem1} Choice - {first_choice}n{mem2} Choice - {second_choice}'

class Connect:
def __init__(self):
players = 0
self.prikey = RSA.generate(1024)
self.pubkey = self.prikey.publickey()
self.token = PKCS1_OAEP.new(self.prikey)
with socket.socket(socket.AF_INET, socket.SOCK_STREAM) as sock:
sock.bind(('0.0.0.0', 21523))
sock.listen(2)
print('Waiting for at least 2 players, please wait.')
while True:
players += 1
if players == 1:
self.nick1 = self.conn.recv(1024).decode()
print(f'Player 1 is {self.nick1}')
self.player1_conn = self.conn
elif players == 2:
self.nick2 = self.conn.recv(1024).decode()
print(f'Player 2 is {self.nick2}')
self.player2_conn = self.conn
break
self.connection()

def connection(self) -> None:
print('2 Players have joined, starting game in 5 seconds.n')
sleep(5)
self.player1_conn.send('Y'.encode())
self.player2_conn.send('Y'.encode())
self.game_play()

def game_play(self) -> None:
self.player1_conn.send(self.pubkey.exportKey())
self.player2_conn.send(self.pubkey.exportKey())
choice_1_cipher = self.player1_conn.recv(1024)
choice_1_plain = self.token.decrypt(choice_1_cipher)
print('Got first choice, waiting for another choice..')
choice_2_cipher = self.player2_conn.recv(1024)
choice_2_plain = self.token.decrypt(choice_2_cipher)
print(rules(choice_1_plain, choice_2_plain, self.nick1, self.nick2))
self.player1_conn.send(f'{rules(choice_1_plain, choice_2_plain, self.nick1, self.nick2)}'.encode())
self.player2_conn.send(f'{rules(choice_1_plain, choice_2_plain, self.nick1, self.nick2)}'.encode())
exit(0)

if __name__ == '__main__':
Connect()
``````

Customer:

``````import socket
from time import sleep
from Crypto.Cipher import PKCS1_OAEP
from Crypto.PublicKey import RSA

nickname = input('Enter Nickname: ').encode()

class Client:
def __init__(self):
self.prikey = RSA.generate(2048)
self.pubkey = self.prikey.publickey()
with socket.socket(socket.AF_INET, socket.SOCK_STREAM) as self.sock:
self.sock.connect(('10.0.0.42', 21523))
self.sock.send(nickname)
data = self.sock.recv(1024).decode()
if data == 'Y':
self.start_game()

def start_game(self) -> None:
print('n (R)ock | (P)aper | (S)cissors - ')
while True:
my_choice = input().upper()
if my_choice not in ('R', 'P', 'S'):
print('Invalid Input, input must be one of those R\P\S')
else:
user_pubkey = RSA.importKey(self.sock.recv(2048))
token = PKCS1_OAEP.new(user_pubkey)
cipher_choice = token.encrypt(my_choice.encode())
self.sock.send(cipher_choice)
break
self.recv_and_exit()

def recv_and_exit(self):
print(self.sock.recv(1024).decode()) # Result
sleep(5)
exit(0)

if __name__ == '__main__':
try:
Client()
except Exception as e:
print(f'err: {e}')
except KeyboardInterrupt:
print('A player has pressed (Ctrl + C) to quit the game, game ended!')
$$```$$
``````

## Minsc is mentioned, although he does not appear as a real character, in Baldur & # 39; s Gate: Descent into Avernus

As you noted, Minsc is mentioned in passing in the 4th Encounters module Murder at Baldur & # 39; s Gate, especially that there is a statue of him and Boo in The Wide, the big market in the upper town. This detail is again presented in BG: DiA, where it is explained that what was presumed to be a statue was in fact the petrified figures themselves – and at some point between the years MiBG and BG: DiA they have been healed and ready to wander the world again:

Statue of Minsc and Boo. For years, the Wide has hosted one of the city's most beloved landmarks: the Beloved Ranger, a statue of a mighty chainmail warrior wearing a cheerful smile and cradling a hamster in his hands . Recently, however, the statue was revealed to be Rashemi's hero, Minsc, and his companion "miniature giant hamster," Boo, trapped in the effects of petrifying magic. When the magic was dispelled, it freed the heroes to travel the world once again, but deprived the Wide of a bit of its charm. The merchants complained loudly, and a replacement statue of Minsc and Boo was quickly ordered and placed on the pedestal where the real heroes stood for years.

However, it does not figure otherwise in the adventure. As far as I know, this is the only mention of Minsc (and Boo) in the 5th material published so far. However, it seems likely that this specific detail would be a way of keeping the character available for use in future 5th material – establishing that Minsc & Boo have been petrified for the past hundred years properly avoids the problem that a normal human like Minsc who was active in the late 1300s DR should have been dead (or at best extremely old) by the years 1480 and 90, when the FR material of 5th grade is defined. (As a giant miniature space hamster, we can probably assume that Boo's lifespan is not a problem.)

If you widen the net a little, Minsc does not appear in the written documents, but his character made will appear in the Wizards of the Coast 2019 live play live event Lowering, where he was played by Jim Zub, who previously wrote the character in the IDW D&D comics. Boo was performed by Matt Mercer, from critical role.