Math, asked by geetarani42, 11 months ago

use euclid division algorithm to find the hcf of 256,576​

Answers

Answered by Anonymous
6

Step-by-step explanation:

I hope it would help you

Attachments:
Answered by aarti0808
4

Answer:

Please wait till I solve

Steps to solve the problem:-

1- Find the prime factorization of 256

256 = 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2

2- Find the prime factorization of 576

576 = 2 × 2 × 2 × 2 × 2 × 2 × 3 × 3

3- To find the gcf, multiply all the prime factors common to both numbers:

4- Therefore, HCF = 2 × 2 × 2 × 2 × 2 × 2

HCF = 64

PLEASE MARK ME AS THE BRAINLIEST

PLEASE MARK ME AS THE BRAINLIEST

PLEASE MARK ME AS THE BRAINLIEST

PLEASE MARK ME AS THE BRAINLIEST

PLEASE MARK ME AS THE BRAINLIEST

Similar questions