Problem 46630. Find R*Rp-N*Np=1 given gcd(R,N)=1

• Created by David Hill
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Strings III

• 23 Problems
• 22 Finishers

Algorithm I

• 17 Problems
• 5 Finishers

Like (1)

Difficulty:

(11)

Rate

• Solve Later   
• Add To GroupÂ

Find Rp and Np, such that R*Rp-N*Np=1, given gcd(R,N)=1.

0<=Rp<N

0<=Np<R

Solve

Solution Stats

45.83% Correct | 54.17% Incorrect

• 48 Solutions
• 12 Solvers

Last Solution submitted on Jul 14, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers12

Suggested Problems

• Remove any row in which a NaN appears

  8657 Solvers

• Calculate the Levenshtein distance between two strings

  1461 Solvers

• Check if number exists in vector

  12496 Solvers

• Evil Number

  261 Solvers

• Find my daddy long leg (No 's')

  2500 Solvers

More from this Author57

• B-Zuckerman Numbers

  3 Solvers

• Evaluate Poker Hand

  4 Solvers

• All flights lead to Idaho Falls

  4 Solvers

• AES MixColumns() Transformation

  2 Solvers

• RSA encryption using public key

  6 Solvers