The above identity generates very large integers for even relatively small values of x and y. Consequently, we are here presented with another opportunity to use a programming language that provides big number facilities, not to prove Wilke's Identity, but to simply check it for specific values.
Exercise: write a Python program which verifies the above identity. Use long integers.
Note: even with long integers, you may well over-tax your computer if x and y are more than 2-digits apiece. For example, click here for the value of a, b when x=210, y=11.
