Fdtxjr

How dangerous is XSS?

What is the most common color to indicate the input-field is disabled?

Should I tell management that I intend to leave due to bad software development practices?

Why is this clock signal connected to a capacitor to gnd?

Watching something be piped to a file live with tail

Do UK voters know if their MP will be the Speaker of the House?

Im going to France and my passport expires June 19th

Ambiguity in the definition of entropy

Examples of smooth manifolds admitting inbetween one and a continuum of complex structures

Can I run a new neutral wire to repair a broken circuit?

Why was the shrinking from 8″ made only to 5.25″ and not smaller (4″ or less)?

A category-like structure without composition?

What about the virus in 12 Monkeys?

I would say: "You are another teacher", but she is a woman and I am a man

How do I handle a potential work/personal life conflict as the manager of one of my friends?

How can saying a song's name be a copyright violation?

Determining Impedance With An Antenna Analyzer

How to prevent "they're falling in love" trope

Mathematica command that allows it to read my intentions

Why didn't Miles's spider sense work before?

What method can I use to design a dungeon difficult enough that the PCs can't make it through without killing them?

All in one piece, we mend holes in your socks

How badly should I try to prevent a user from XSSing themselves?

What does “the session was packed” mean in this context?

Find $438^87493 equiv ~? pmod11$ [closed]

How do I compute $a^b,bmod c$ by hand?How to divide $2x equiv 4 pmod 7$ to get just $x equiv Box pmod7$Solving $x^5 equiv 7 mod 13$Infinite exponentiation $n^n^n^…^n equiv m pmod q$ , find m?Modular arithmetic system $x equiv 2 pmod7$ and $x equiv -5 pmod22$How do I find the smallest positive integer $a$ for which $a^n equiv x pmod2^w$?Modular arithmetic problem: $7^x equiv 1 pmod26$Find $6^273 + 8^273pmod49$If $a^2 equiv 4 pmod5$, then $a equiv 2 pmod5$.Solve $x^2 equiv 1 pmod30$ and generalize.Solving $m^3 equiv n^6 pmod19$

-1

1

$begingroup$

How to find the value of '?'

a mod m = b mod m , will this formula be used?

I am taking discrete maths course for CS. And this question is from one of its chapter

modular-arithmetic

share|cite|improve this question

edited Mar 21 at 6:51

rdr2

asked Mar 21 at 6:32

rdr2rdr2

12

$endgroup$

closed as off-topic by José Carlos Santos, Saad, Cesareo, Arnaud D., Javi Mar 21 at 12:46

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Saad, Cesareo

If this question can be reworded to fit the rules in the help center, please edit the question.

• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  $begingroup$
  What is $438 (mod 11)$? And what is the order of $(Bbb Z / 11 Bbb Z)^*$?
  $endgroup$
  – Robert Shore
  Mar 21 at 6:39
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  438 mod 11 would be 9 And I don't know what you mean by order of (Z/11Z)
  $endgroup$
  – rdr2
  Mar 21 at 6:43
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  For us to be able to help you effectively, you need to provide more background. Why is this problem of interest to you? How have you tried to solve it?
  $endgroup$
  – Robert Shore
  Mar 21 at 6:44
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  I am taking discrete maths course for CS. And this question is from one of its chapter
  $endgroup$
  – rdr2
  Mar 21 at 6:47
  
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  Possible duplicate of How do I compute $a^b,bmod c$ by hand?
  $endgroup$
  – Arnaud D.
  Mar 21 at 10:47
  

  
  
  
  

 | 
show 7 more comments

-1

1

$begingroup$

How to find the value of '?'

a mod m = b mod m , will this formula be used?

I am taking discrete maths course for CS. And this question is from one of its chapter

modular-arithmetic

share|cite|improve this question

edited Mar 21 at 6:51

rdr2

asked Mar 21 at 6:32

rdr2rdr2

12

$endgroup$

closed as off-topic by José Carlos Santos, Saad, Cesareo, Arnaud D., Javi Mar 21 at 12:46

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Saad, Cesareo

If this question can be reworded to fit the rules in the help center, please edit the question.

• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  $begingroup$
  What is $438 (mod 11)$? And what is the order of $(Bbb Z / 11 Bbb Z)^*$?
  $endgroup$
  – Robert Shore
  Mar 21 at 6:39
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  438 mod 11 would be 9 And I don't know what you mean by order of (Z/11Z)
  $endgroup$
  – rdr2
  Mar 21 at 6:43
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  For us to be able to help you effectively, you need to provide more background. Why is this problem of interest to you? How have you tried to solve it?
  $endgroup$
  – Robert Shore
  Mar 21 at 6:44
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  I am taking discrete maths course for CS. And this question is from one of its chapter
  $endgroup$
  – rdr2
  Mar 21 at 6:47
  
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  Possible duplicate of How do I compute $a^b,bmod c$ by hand?
  $endgroup$
  – Arnaud D.
  Mar 21 at 10:47
  

  
  
  
  

 | 
show 7 more comments

$begingroup$

How to find the value of '?'

a mod m = b mod m , will this formula be used?

I am taking discrete maths course for CS. And this question is from one of its chapter

modular-arithmetic

share|cite|improve this question

edited Mar 21 at 6:51

rdr2

asked Mar 21 at 6:32

rdr2rdr2

12

$endgroup$

share|cite|improve this question

edited Mar 21 at 6:51

rdr2

asked Mar 21 at 6:32

rdr2rdr2

12

share|cite|improve this question

edited Mar 21 at 6:51

rdr2

asked Mar 21 at 6:32

rdr2rdr2

12

asked Mar 21 at 6:32

rdr2rdr2

12

asked Mar 21 at 6:32

rdr2rdr2

12

1 Answer
1

active

oldest

votes

2

$begingroup$

Observe that $text gcd (11,438) = 1.$ So by Euler's theorem $438^10 equiv 1 (text mod 11).$ So $438^87490 equiv 1 (text mod 11).$ Also $438 equiv -2 (text mod 11) implies 438^3 equiv -8 equiv 3 (text mod 11).$ Therefore $$438^87493 equiv 3 (text mod 11).$$

If you don't know Euler's theorem or Fermat's little theorem then observe from my above calculation that $438^3 equiv 3 (text mod 11).$ So $438^6 equiv 9 equiv -2 (text mod 11) implies 438^30 equiv (-2)^5 equiv -32 equiv 1 (text mod 11).$

Observe that $87493 = 87480 + 13.$ Since $30 mid 87480$ so $438^87480 equiv 1 (text mod 11).$ Since $438^6 equiv -2 (text mod 11)$ so $438^12 equiv 4 (text mod 11).$ Again $438 equiv -2 (text mod 11).$ So $438^13 equiv 438^12 cdot 438 equiv 4 cdot (-2) equiv -8 equiv 3 (text mod 11).$ Thus we get

$(1)$ $438^87480 equiv 1 (text mod 11).$

$(2)$ $438^13 equiv 3 (text mod 11).$

Therefore what is $438^87493 equiv ~? (text mod 11)$?

$$438^87493 equiv 438^87480+13 equiv 438^87490 cdot 438^13 equiv 1 cdot 3 equiv 3 (text mod 11).$$

share|cite|improve this answer

edited Mar 21 at 8:03

answered Mar 21 at 6:45

Dbchatto67Dbchatto67

2,445522

$endgroup$

add a comment | 

2

$begingroup$

Observe that $text gcd (11,438) = 1.$ So by Euler's theorem $438^10 equiv 1 (text mod 11).$ So $438^87490 equiv 1 (text mod 11).$ Also $438 equiv -2 (text mod 11) implies 438^3 equiv -8 equiv 3 (text mod 11).$ Therefore $$438^87493 equiv 3 (text mod 11).$$

If you don't know Euler's theorem or Fermat's little theorem then observe from my above calculation that $438^3 equiv 3 (text mod 11).$ So $438^6 equiv 9 equiv -2 (text mod 11) implies 438^30 equiv (-2)^5 equiv -32 equiv 1 (text mod 11).$

Observe that $87493 = 87480 + 13.$ Since $30 mid 87480$ so $438^87480 equiv 1 (text mod 11).$ Since $438^6 equiv -2 (text mod 11)$ so $438^12 equiv 4 (text mod 11).$ Again $438 equiv -2 (text mod 11).$ So $438^13 equiv 438^12 cdot 438 equiv 4 cdot (-2) equiv -8 equiv 3 (text mod 11).$ Thus we get

$(1)$ $438^87480 equiv 1 (text mod 11).$

$(2)$ $438^13 equiv 3 (text mod 11).$

Therefore what is $438^87493 equiv ~? (text mod 11)$?

$$438^87493 equiv 438^87480+13 equiv 438^87490 cdot 438^13 equiv 1 cdot 3 equiv 3 (text mod 11).$$

share|cite|improve this answer

edited Mar 21 at 8:03

answered Mar 21 at 6:45

Dbchatto67Dbchatto67

2,445522

$endgroup$

add a comment | 

2

$begingroup$

Observe that $text gcd (11,438) = 1.$ So by Euler's theorem $438^10 equiv 1 (text mod 11).$ So $438^87490 equiv 1 (text mod 11).$ Also $438 equiv -2 (text mod 11) implies 438^3 equiv -8 equiv 3 (text mod 11).$ Therefore $$438^87493 equiv 3 (text mod 11).$$

If you don't know Euler's theorem or Fermat's little theorem then observe from my above calculation that $438^3 equiv 3 (text mod 11).$ So $438^6 equiv 9 equiv -2 (text mod 11) implies 438^30 equiv (-2)^5 equiv -32 equiv 1 (text mod 11).$

Observe that $87493 = 87480 + 13.$ Since $30 mid 87480$ so $438^87480 equiv 1 (text mod 11).$ Since $438^6 equiv -2 (text mod 11)$ so $438^12 equiv 4 (text mod 11).$ Again $438 equiv -2 (text mod 11).$ So $438^13 equiv 438^12 cdot 438 equiv 4 cdot (-2) equiv -8 equiv 3 (text mod 11).$ Thus we get

$(1)$ $438^87480 equiv 1 (text mod 11).$

$(2)$ $438^13 equiv 3 (text mod 11).$

Therefore what is $438^87493 equiv ~? (text mod 11)$?

$$438^87493 equiv 438^87480+13 equiv 438^87490 cdot 438^13 equiv 1 cdot 3 equiv 3 (text mod 11).$$

share|cite|improve this answer

edited Mar 21 at 8:03

answered Mar 21 at 6:45

Dbchatto67Dbchatto67

2,445522

$endgroup$

add a comment | 

$begingroup$

Observe that $text gcd (11,438) = 1.$ So by Euler's theorem $438^10 equiv 1 (text mod 11).$ So $438^87490 equiv 1 (text mod 11).$ Also $438 equiv -2 (text mod 11) implies 438^3 equiv -8 equiv 3 (text mod 11).$ Therefore $$438^87493 equiv 3 (text mod 11).$$

If you don't know Euler's theorem or Fermat's little theorem then observe from my above calculation that $438^3 equiv 3 (text mod 11).$ So $438^6 equiv 9 equiv -2 (text mod 11) implies 438^30 equiv (-2)^5 equiv -32 equiv 1 (text mod 11).$

Observe that $87493 = 87480 + 13.$ Since $30 mid 87480$ so $438^87480 equiv 1 (text mod 11).$ Since $438^6 equiv -2 (text mod 11)$ so $438^12 equiv 4 (text mod 11).$ Again $438 equiv -2 (text mod 11).$ So $438^13 equiv 438^12 cdot 438 equiv 4 cdot (-2) equiv -8 equiv 3 (text mod 11).$ Thus we get

$(1)$ $438^87480 equiv 1 (text mod 11).$

$(2)$ $438^13 equiv 3 (text mod 11).$

Therefore what is $438^87493 equiv ~? (text mod 11)$?

$$438^87493 equiv 438^87480+13 equiv 438^87490 cdot 438^13 equiv 1 cdot 3 equiv 3 (text mod 11).$$

share|cite|improve this answer

edited Mar 21 at 8:03

answered Mar 21 at 6:45

Dbchatto67Dbchatto67

2,445522

$endgroup$

share|cite|improve this answer

edited Mar 21 at 8:03

answered Mar 21 at 6:45

Dbchatto67Dbchatto67

2,445522

answered Mar 21 at 6:45

Dbchatto67Dbchatto67

2,445522

answered Mar 21 at 6:45

Dbchatto67Dbchatto67

2,445522