/sci/ - Science & Math

>>6461572

Plato was discoursing on his theory of ideas and, pointing to the cups on the table before him, said while there are many cups in the world, there is only one `idea' of a cup, and this cupness precedes the existence of all particular cups.

"I can see the cup on the table," interupted Diogenes, "but I can't see the `cupness'".

"That's because you have the eyes to see the cup," said Plato, "but", tapping his head with his forefinger, "you don't have the intellect with which to comprehend `cupness'."

Diogenes walked up to the table, examined a cup and, looking inside, asked, "Is it empty?"

Plato nodded.

"Where is the `emptiness' which procedes this empty cup?" asked Diogenes.

Plato allowed himself a few moments to collect his thoughts, but Diogenes reached over and, tapping Plato's head with his finger, said "I think you will find here is the `emptiness'."

Or is this all just some /sci/ meme to hate philosophy?

>>6163738

Are boners living beings ?

That was the theory of aether vortices. Newton devoted one third of the Principia in an attempt to demolish it.

Descartes was't human. He is a dog kemonomimi.

Just look at that flop-flop. He looks like a spaniel.

Extracting cubic roots from numbers up to 1000000 (the result must be integer or it won't work!)

1. You need to memorize this table:
03 = 0
13 = 1
23 = 8
33 = 27
43 = 64
53 = 125
63 = 216
73 = 343
83 = 512
93 = 729

2. Note that the X3 values for the 10 digits all have different ending digit, so inverse table is:
0 => 0
1 => 1
2 => 8
3 => 7
4 => 4
5 => 5
6 => 6
7 => 3
8 => 2
9 => 9
It's all in order, just 2 swapped with 8 and 3 with 7, so pretty easy to memorize.

3. Now, given a number XXXYYZ, from which you need to extract the cubic root (XXX for 6-digit numbers, XX for 5-digit, X for 4-digit). For example 195112 => XXX = 195 , Z = 2

First, find the largest number smaller or equal than XXX from the first table: 195 => 125 => 5
Second, find the digit matching the root for Z from the second table: 2 => 8
The cubic root of 195112 is 58

Another example: 2197
X = 2 => 1
Z = 7 => 3
133 = 2197

I'm struggling with some cryptography and wondering if anyone could point me in the right direction.

>Asked to digitally sign message using RSA
>Given both public keys of sender and receiver
>Then asked to determine both private keys and obtain 10 numbers of the digitally signed message that will be sent
>Then verify by recovering original message

I'm not exactly sure where to start, at all really.
I know how to find private keys using Diffie Hellman, would i use that here?

I've also seen worked examples, however in the examples you are given both the sender and receivers initial primes in which you use the product of as their individual modulus during encryption/decryption. I am just so fucking confused by it all, so any help would be appreciated.