CameraIcon

SearchIcon

MyQuestionIcon

9

You visited us 9 times! Enjoying our articles? Unlock Full Access!

Method of Finding HCF

A positive in...

Question

A positive integer n when divided by 9 leaves remainder 7.What will be the remainder when 3n-1 is divided by 9?

Open in App

Solution

$Using Euclid' s Division lemma n = 9 p + 7 On multiplying both sides by 3, we get 3 n = 3 (9 p) + 21 3 n = 9 q + 21 (Say q = 3 p) Subtracting 1 from both sides, we get 3 n - 1 = 9 q + 20 3 n - 1 = 9 q + 18 + 2 3 n - 1 = 9 (q + 2) + 2 3 n - 1 = 9 m + 2 (Say m = q + 2) Comparing it with Euclid' s division lemma, We get the reminder = 2 . ANS . . .$

Suggest Corrections

thumbs-up

0

Similar questions

Q. On dividing a positive integer

n

9

7

as remainder. What will be the remainder when

(3 n - 1)

9

Q. A positive integer n, when divided by 9, gives 7 as remainder. What will be the remainder when (3n − 1) is divided by 9?

(a) 1
(b) 2
(c) 3
(d) 4

On dividing a positive integer $n$ by $9$ we get $7$ as remainder. What will be the remainder if $(3 n - 1)$ is divided by $9$ ?

Q. On dividing a positive integer n by 9, we get 7 as remainder. What will be the remainder if (3n − 1) is divided by 9?

(a) 1
(b) 2
(c) 3
(d) 4

Q. A number which when divided by

10

leaves a remainder of

9

, when divided by

9

leaves remainder of

8

, and when divided by

8

leaves a remainder of

7

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

The Fundamental Theorem of Arithmetic

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Method of Finding HCF

Standard X Mathematics

Join BYJU'S Learning Program

CrossIcon