- #1

maxfails

- 11

- 0

(d)(13) mod (2436) = 1.

d times 13 mod 2436 should be equal to 1.

Is there a process I can use to find out the value of d.

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter maxfails
- Start date

- #1

maxfails

- 11

- 0

(d)(13) mod (2436) = 1.

d times 13 mod 2436 should be equal to 1.

Is there a process I can use to find out the value of d.

- #2

tiny-tim

Science Advisor

Homework Helper

- 25,838

- 256

hi maxfails! smile:

hint: divide 2436 by 13

hint: divide 2436 by 13

- #3

Mark44

Mentor

- 36,852

- 8,885

2436 isn't a multiple of 13. Maybe I'm missing the point.hi maxfails! smile:

hint: divide 2436 by 13

- #4

HallsofIvy

Science Advisor

Homework Helper

- 43,021

- 973

That "2435 isn't a multiple of 13" **is** the point! If it were, there would be no answer to this problem. "Modulus" problems are all about **remainders**. You are trying to find a number, n, such that some multiple of 2436, divided by 13n, has remainder 1, that is, such that [itex]13n= 1+ 2436k[/itex] for some integer k. That is the same as [itex]13n- 2436k= 1[/itex].

Euclidean division algorithm:

13 divides into 2436 187 times with remainder 5- that is, 2436- (187)(13)= 5.

5 divides into 13 twice with remainder 3- that is, 13- (2)(5)= 3.

3 divides into 5 once with remainder 2- that is 5- 1(3)= 2.

2 divides into 3 once with remainder 1- that is, 3- 1(2)= 1.

Replace that "2" by 5- 1(3) from the previous equation: 3- 1(5- 1(3))= 2(3)- 5= 1. Replace the "3" in that with 13- 2(5): 2(13- 2(5))- 5= 2(13)- 5(5)= 1.

Replace the "5" in that by 2436- 187(13): 2(13)- 5(2436- 187(13))= 937(13)- 5(2436)= 1.

Now that I used 2436 rather than the mistaken 2435, I get the same result as Mensenator.

Euclidean division algorithm:

13 divides into 2436 187 times with remainder 5- that is, 2436- (187)(13)= 5.

5 divides into 13 twice with remainder 3- that is, 13- (2)(5)= 3.

3 divides into 5 once with remainder 2- that is 5- 1(3)= 2.

2 divides into 3 once with remainder 1- that is, 3- 1(2)= 1.

Replace that "2" by 5- 1(3) from the previous equation: 3- 1(5- 1(3))= 2(3)- 5= 1. Replace the "3" in that with 13- 2(5): 2(13- 2(5))- 5= 2(13)- 5(5)= 1.

Replace the "5" in that by 2436- 187(13): 2(13)- 5(2436- 187(13))= 937(13)- 5(2436)= 1.

Now that I used 2436 rather than the mistaken 2435, I get the same result as Mensenator.

Last edited by a moderator:

- #5

Mensanator

- 105

- 0

(d)(13) mod (2436) = 1.

d times 13 mod 2436 should be equal to 1.

Is there a process I can use to find out the value of d.

Yes, find the modular imverse of 13 & 2436.

the answer is then invert(13,2436) * 1 % 2436.

Should be 937.

- #6

Raza

- 203

- 0

lol, you are in my security class.

prolly Ian.

prolly Ian.

Share:

- Replies
- 4

- Views
- 452

- Replies
- 4

- Views
- 109

- Last Post

- Replies
- 1

- Views
- 509

- Last Post

- Replies
- 10

- Views
- 395

- Replies
- 4

- Views
- 909

- Replies
- 1

- Views
- 313

- Replies
- 1

- Views
- 314

- Replies
- 10

- Views
- 394

- Last Post

- Replies
- 1

- Views
- 195

- Last Post

- Replies
- 7

- Views
- 400