A function to find Greatest Common Divisor of two integer input
E.G. x=-18 y=96
output should be +6
Number of 1s in a binary string
Output any real number that is neither positive nor negative
ASCII code of a leter.
iteration of N blank spot
Prime number removal
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office