How many sets of three distinct factors of the number N = 2^6 — 3^4 — 5^2 can be made such that the factors in each set has a highest common factor of 1 with respect to every other factor in that set?
How many sets of three distinct factors of the number N = 2^6 — 3^4 — 5^2 can be made such that the factors in each set has a highest common factor of 1 with respect to every other factor in that set?
How many sets of three distinct factors of the number N = 2^6 — 3^4 — 5^2 can be made such that the factors in each set has a highest common factor of 1 with respect to every other factor in that set?
How many sets of three distinct factors of the number N = 2^6 — 3^4 — 5^2 can be made such that the factors in each set has a highest common factor of 1 with respect to every other factor in that set?
I am afraid to say that this is incorrect.It'd be better to post your approach so that it might be possible to help.Team BV - Kamal Lohia
the would reach the starting point when A(3kmph) and B(5kmph) cover 3 and 5 complete to and fro motion with distance d=120(assumed) So they together travel 240*3+240*5=1920 They woulld meet for the first time when they together cover a distance of d
the next meeting would happen when they cover a distance of 2d together.. hence there would be total 8 meetings. Goes by my analysis there would be one instance when they would meet travelling in the same direction.. hence they would exchange 8-2=6 flowers
why don't you want to solve it further where I left it.Anyways..f(k) has to be greater than 19 and has sum of digits 19. So smallest value of f(k) is 199.Similarly k has to be greater than 199 but has sum of digits 199, so smallest value of k is 1 followed by 22 9's i.e. a 23 digit number. Team BV - Kamal Lohia
i understood the logic after reading ur post..thanks...