Let set S contains the numbers from 1 to 160 which are divisible by 6, and set T contain all alphabets, then what is the number of onto functions possible from set S to set T ? code example

Example: Write a JAVA method that expands a given binomial (ax + by)n, where integers a, b, n are user inputs. For example, if a = 2, b = -12, n = 4 are entered the method should print or return

Write a JAVA method that expands a given binomial (ax + by)n, where integers a, b, n are user inputs.  For example, if a = 2, b = -12, n = 4 are entered the method should print or return