Q.7: How many multipliers of 3 are there between 1 and 100? Write a program to find that.

Write code for.  Computes the smallest x that satisfies the chinese remainder theorem    for a system of equations.    The system of equations has the form:    x % nums[0] = rems[0]    x % nums[1] = rems[1]    ...    x % nums[k - 1] = rems[k - 1]    Where k is the number of elements in nums and rems, k > 0.    All numbers in nums needs to be pariwise coprime otherwise an exception is raised    returns x: the smallest value for x that satisfies the system of equations.

I want solution with steps

Start with a pile of n stones and successively split a pile into two smaller piles until each pile has only one Each time a split happens, multiply the number of stones in each of the two smaller piles. (For example, if a pile has 15 stones and you split it into a pile of 7 and another pile of 8 stones, multiply 7 and 8.)  The goal of this problem is to show that no matter how the  pile of n  stones are split, the sum of the products computed at each split is equal to n(n - 1)/2. Using strong mathematical induction, prove that no matter how the pile of n stones are split, the sum of the products computed at each split is equal to n(n - 1)/2.