Given an fraction decimal number n, convert it to its equivalent binary number.
If it is an infinite binary fraction, keep it upto k precision point.
Similar to my Cody problem.
sorry..didn't see that
Make a Palindrome Number
Find matching parenthesis
Project Euler: Problem 9, Pythagorean numbers
Sum of diagonal of a square matrix
Switch matrix to a column vector
Yoonir - 02
Minimal Path - 04
remove numbers from a string
Check Digit - 01
Minimal Path - 03
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