solve both............
Attachments:

smile10888:
hii
Answers
Answered by
1
29] If the HCF of 408 and 1032 can be written as
By Euclid 's division algorithm,
1032 = 408×2 + 216
408 = 216×1 + 192
216 = 192×1 + 24
192 = 24×8 + 0
Since the remainder becomes 0 here, so HCF of 408 and 1032 is 24
Now,
1032p - 408*5 = HCF of these numbers
=> 1032p - 2040 = 24
=> 1032p = 24+2040
=> p = 2064/1032
=> p = 2
So value of p is 2.
Answered by
5
Hiiiii........friend
The answer is here,


HCF of the numbers,

=> 24.
The HCF is in the form => 1032p-408×5 .
=> 1032p-2040 =24.
=> 1032p=2040+24 = 2064.
=> p =2064/1032.
=> p =2.
30) The remainder of (5m+1)(5m+3)(5m+4)/5 is a natural number.
There are two Methods to find remainder .
1st Method:-
Remainder of (5m+1)(5m+3)(5m+4)/5 is,
=> Rem of (5m+1)/5 ×Rem of (5m+3)/5×Rem of (5m+4)/5.
=> 1×3×4.
=> 12.
12 is greater than the divisor (5).
So, Again Divide it by 5.
=> 12/5.
Remainder => 2.
2nd Method:-
=> (5m+1)(5m+3)(5m+4)




So, If we divide the polynomial we, Get 2 as remainder.
Verification:-
Substitute m =1.
=> (5×1+1)(5×1+3)(5×1+4)
=> 6×8×9.
=> 432.
If we divide 432 , We get remainder 2.
Hence The remainder is 2.
:-)Hope it helps u.
The answer is here,
HCF of the numbers,
=> 24.
The HCF is in the form => 1032p-408×5 .
=> 1032p-2040 =24.
=> 1032p=2040+24 = 2064.
=> p =2064/1032.
=> p =2.
30) The remainder of (5m+1)(5m+3)(5m+4)/5 is a natural number.
There are two Methods to find remainder .
1st Method:-
Remainder of (5m+1)(5m+3)(5m+4)/5 is,
=> Rem of (5m+1)/5 ×Rem of (5m+3)/5×Rem of (5m+4)/5.
=> 1×3×4.
=> 12.
12 is greater than the divisor (5).
So, Again Divide it by 5.
=> 12/5.
Remainder => 2.
2nd Method:-
=> (5m+1)(5m+3)(5m+4)
So, If we divide the polynomial we, Get 2 as remainder.
Verification:-
Substitute m =1.
=> (5×1+1)(5×1+3)(5×1+4)
=> 6×8×9.
=> 432.
If we divide 432 , We get remainder 2.
Hence The remainder is 2.
:-)Hope it helps u.
Similar questions