Number Theory or Algebra? Part 3

Find the remainder left when ( 14 9 3 ) ( 15 2 2 ) (149^{3})(152^{2}) is divided by 5 5


The answer is 1.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

5 solutions

149 1 ( m o d 5 ) 149 \equiv -1\pmod5

14 9 3 ( 1 ) 3 ( m o d 5 ) 149^{3} \equiv (-1)^{3}\pmod5

14 9 3 1 ( m o d 5 ) 149^{3} \equiv -1\pmod5

14 9 3 4 ( m o d 5 ) \boxed{149^{3} \equiv 4\pmod5}

152 2 ( m o d 5 ) 152 \equiv 2\pmod5

15 2 2 2 2 ( m o d 5 ) 152^{2} \equiv 2^{2}\pmod5

15 2 2 4 ( m o d 5 ) \boxed{152^{2} \equiv 4\pmod5}

( 14 9 3 ) ( 15 2 2 ) 16 ( m o d 5 ) \therefore (149^{3})(152^{2}) \equiv 16 \pmod5

( 14 9 3 ) ( 15 2 2 ) 1 ( m o d 5 ) \therefore \boxed{(149^{3})(152^{2}) \equiv \boxed{1} \pmod5}

Unit's digit of 9^3 = 9 Unit's digit of 2^2 = 4 9*4 = 36 36 mod 5 = 1

Kamala Ramakrishnan - 6 years, 10 months ago

Is the first sentence 149 1 ( m o d 5 ) 149\equiv -1(mod5) correct? a = b ( m o d c ) a=b(modc) generally represents the remainder when a a is divided by c c and the remainder is generally considered positive, i.e., 15 = 3 ( m o d 4 ) 1 ( m o d 4 ) 15=3(mod4)\neq -1(mod4) . This is what I think but I actually suck at Number Theory and might be wrong. It would be appreciated if you correct me if I am wrong.

Prasun Biswas - 7 years, 1 month ago

Log in to reply

I'm not really sure about this too. But what I learned is when a b ( m o d c ) a \equiv b (mod c) , then c a b c | a - b .

So I think it's slightly easier in this case to use 1 -1 rather than 4 -4 , but both give same results.

Sanchayapol Lewgasamsarn - 7 years, 1 month ago

Prasun, one can also use a negative modulo. It is sometimes extremely useful in solving advanced number theory problems.

Krishna Ar - 7 years ago

I had the same solution.

Bao Tran Tong - 6 years, 11 months ago

I cleaned up your mods a little.

Daniel Liu - 6 years, 11 months ago
Shaun Loong
Apr 28, 2014

Without modulo, simply multiply all the last digits together. With that, we get 9 × 9 × 9 × 2 × 2 9\times9\times9\times2\times2 . Considering only the last digit, obviously that multiplication results in a last digit of 6 6 . Hence, the remainder when divided by 5 5 is 1 \boxed{1} .

Nice I thought of same

Ishan Dixit - 7 years ago
Rahul Kumar
Jul 19, 2014

9^3=9 as a unit place and 2^2=4 as a unit place. so, 9*4=36 and divided by 5 is 1

Kenny Lau
Feb 19, 2017

Level 0: Bashing

14 9 3 × 15 2 2 = 76426853696 1 ( m o d 5 ) 149^3 \times 152^2 = 76426853696 \equiv 1 \pmod 5

  • Advantage: no brain needed
  • Disadvantage: get one digit wrong and you're finished

Level 1: Clever bashing

Let x = 150 x=150 .

14 9 3 × 15 2 2 = ( x 1 ) 3 ( x + 2 ) 2 = ( x 3 3 x 2 + 3 x 1 ) ( x 2 + 4 x + 4 ) = x 5 + x 4 5 x 3 x 2 + 8 x 4 4 1 ( m o d 5 ) 149^3 \times 152^2 = (x-1)^3(x+2)^2 = (x^3-3x^2+3x-1)(x^2+4x+4) = x^5+x^4-5x^3-x^2+8x-4 \equiv -4 \equiv 1 \pmod 5

  • Advantage: seems pro because of x x
  • Disadvantage: too complicated

Level 2: Pro

14 9 3 × 15 2 2 4 3 × 2 2 = 64 × 4 4 × 4 = 16 1 ( m o d 5 ) 149^3 \times 152^2 \equiv 4^3 \times 2^2 = 64 \times 4 \equiv 4 \times 4 = 16 \equiv 1 \pmod 5

  • Advantage: quick
  • Disadvantage: see next level

Level 3: Master

14 9 3 × 15 2 2 ( 1 ) 3 × 2 2 = 4 1 ( m o d 5 ) 149^3 \times 152^2 \equiv (-1)^3 \times 2^2 = -4 \equiv 1 \pmod 5

  • Advantage: you can actually mentally calculate this (I did), using negative numbers like a master
  • Disadvantage: none

A s s u m e ρ t o b e t h e r i g h t a n s w e r ; t h e r e f o r e , ρ . Q E D Assume\quad \rho \quad to\quad be\quad the\quad right\quad answer;\quad therefore,\quad \rho .\\ QED

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...