Given a string, convert it using UTF-8 into a binary array where each character or byte is arraigned low to high. For example:
Input: 'abc', goes to [97 98 99], and then
Ouput: [1 0 0 0 0 1 1 0 1 0 0 0 1 1 1 1 0 0 0 1 1];
Which doors are open?
So many choices
Project Euler: Problem 2, Sum of even Fibonacci
Multiply 2 numbers
Fermat's Last Theorem - Fermat's conjecture
Optimal Asymmetric Encryption Padding of message for RSA Cryptography
Binary Array to Hex Representation
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