New answers tagged development
1
vote
What is the step-by-step algorithmic process to find the modular multiplicative inverse of (n-1) mod np, where (n-1) and np are not coprime?
What you're asking for is impossible.
You're looking for x such that (n-1)x = 1 mod np. However, both n-1 and np are even. It's easy to see that any multiple of n-1 will be even. Thus, any multiple of ...
- 94.1k
Top 50 recent answers are included
Related Tags
development × 447bitcoin-core × 47
transactions × 46
protocol × 46
wallet × 34
blockchain × 32
bitcoind × 31
client × 28
api × 28
script × 23
address × 20
json-rpc × 20
mining-pools × 19
bitcoin-core-development × 17
altcoin × 16
testnet × 13
mining-theory × 11
multi-signature × 11
python × 11
private-key × 10
exchanges × 10
website-integration × 10
currencies × 9
block × 8
ecdsa × 8