Question

When $A$ and $B$ are divided by $173$, the remainder is $33$ and $17$ respectively. Find the remainder when $2A+B$ is divided by $173.$

score 158 · Answer 1 · 2018-03-03 00:56:06

158

Views

When $A$ and $B$ are divided by $173$, the remainder is $33$ and $17$ respectively. Find the remainder when $2A+B$ is divided by $173.$

Published on 03 Mar 2018 - 0:56

score 77 · Answer 2 · 2018-03-03 08:17:41

77

Views

Given total number of hours, how to find the working hours per day so as to finish the work with the total number of days?

Published on 03 Mar 2018 - 8:17

score 151 · Answer 3 · 2026-03-25 12:55:13

151

Views

What is $5^{250} \bmod{26}$, step by step?

Published on 25 Mar 2026 - 12:55

score 98 · Answer 4 · 2018-03-04 05:06:23

98

Views

Summation Problem and finding its Modulus, how could I tackle it?

Published on 04 Mar 2018 - 5:06

score 164 · Answer 5 · 2026-03-25 16:08:06

164

Views

if $d$ divides $n$, why is $d^{n-1} \not\equiv 1 \pmod n$?

Published on 25 Mar 2026 - 16:08

score 531 · Answer 6 · 2018-03-04 19:04:45

531

Views

Having trouble understanding a property of modular congruence

Published on 04 Mar 2018 - 19:04

score 660 · Answer 7 · 2018-03-04 22:38:34

660

Views

Prove that if $a\equiv b \pmod {p^{2}-p}$, then $a^{a}\equiv b^{b} \pmod{p}$ where $p$ is any prime and $a$ and $b$ are nonzero integers.

Published on 04 Mar 2018 - 22:38

score 50 · Answer 8 · 2026-03-25 04:54:38

50

Views

Modular exponentiation confusion

Published on 25 Mar 2026 - 4:54

score 260 · Answer 9 · 2018-03-06 02:57:43

260

Views

1. if a * 133 – m * 277 = 1, does this guarantee that a has an inverse mod m? If so, what is it? If not, why not?

Published on 06 Mar 2018 - 2:57

score 16.4k · Answer 10 · 2018-03-06 05:25:11

16.4k

Views

Function which creates the sequence 1, 2, 3, 1, 2, 3, ...

Published on 06 Mar 2018 - 5:25

score 43 · Answer 11 · 2018-03-06 17:03:52

43

Views

Basic property of modular arithmetic equations

Published on 06 Mar 2018 - 17:03

score 170 · Answer 12 · 2018-03-06 17:23:20

170

Views

How can I solve this find the digits problem more rigorously?

Published on 06 Mar 2018 - 17:23

score 24 · Answer 13 · 2018-03-07 01:44:28

24

Views

Prove: x = a^(d/2) satisfies x^2 ≡ 1mod(n)

Published on 07 Mar 2018 - 1:44

score 1.2k · Answer 14 · 2018-03-07 05:27:01

1.2k

Views

Use the fact that $2$ is a primitive root modulo $101$ to find all solutions to $x^7\equiv-2\pmod{101}$

Published on 07 Mar 2018 - 5:27

score 540 · Answer 15 · 2026-03-25 11:09:32

540

Views

Is regression on a modular equation possible?

Published on 25 Mar 2026 - 11:09

List Question

When $A$ and $B$ are divided by $173$, the remainder is $33$ and $17$ respectively. Find the remainder when $2A+B$ is divided by $173.$

Given total number of hours, how to find the working hours per day so as to finish the work with the total number of days?

What is $5^{250} \bmod{26}$, step by step?

Summation Problem and finding its Modulus, how could I tackle it?

if $d$ divides $n$, why is $d^{n-1} \not\equiv 1 \pmod n$?

Having trouble understanding a property of modular congruence

Prove that if $a\equiv b \pmod {p^{2}-p}$, then $a^{a}\equiv b^{b} \pmod{p}$ where $p$ is any prime and $a$ and $b$ are nonzero integers.

Modular exponentiation confusion

1. if a * 133 – m * 277 = 1, does this guarantee that a has an inverse mod m? If so, what is it? If not, why not?

Function which creates the sequence 1, 2, 3, 1, 2, 3, ...

Basic property of modular arithmetic equations

How can I solve this find the digits problem more rigorously?

Prove: x = a^(d/2) satisfies x^2 ≡ 1mod(n)

Use the fact that $2$ is a primitive root modulo $101$ to find all solutions to $x^7\equiv-2\pmod{101}$

Is regression on a modular equation possible?

Trending Questions

Popular # Hahtags

Popular Questions