You might start by considering the case k=2. What does it state, and how might you prove it?Prove that ifa,b1,b2,...,bk∈Z,bi∣afori=1,...,kandgcd(bi,bj)=1for all1≤i<j≤kthenb1⋅...⋅bk∣a.can someone give me some hint how to even touch it?
Please correct what you wrote by stating exactly what you are proving (with the conditions clear), and then using those correct conditions.sorry there isn't information that gcd(a,b_i)=1![]()
Now try extending it to k=3, and see if that gives you a way to generalize it.and how does it help us to solve the main problem?