Score:1

Deal with large number

fj flag

I'm having a problem in a RSA challenge. I already had p, and q is calculated based on p.

(100000000**(p-1) -1)%p

q is the nearest prime to this number.

I knew that my comp will take a huge time too compute this (Don't know what time it would take). So can you guys suggest some ways to deal with this large number. Many thanks!

michael501 avatar
in flag
fermat's little theorem
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.