Problem 34. Binary numbers

• Created by Cody Team
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Project Euler I

• 10 Problems
• 853 Finishers

Basics - Prime Numbers

• 10 Problems
• 436 Finishers

Like (48)

Difficulty:

(3002)

Rate

• Solve Later   
• Add To GroupÂ

Given a positive, scalar integer n, create a (2^n)-by-n double-precision matrix containing the binary numbers from 0 through 2^n-1. Each row of the matrix represents one binary number. For example, if n = 3, then your code could return

>> binary_numbers(3)

ans =

     1     1     1
     0     0     0
     0     1     1
     0     1     0
     0     0     1
     1     0     0
     1     1     0
     1     0     1

The order of the rows does not matter.

Solve

Solution Stats

41.98% Correct | 58.02% Incorrect

• 12131 Solutions
• 4566 Solvers

Last Solution submitted on Apr 17, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers4566

Suggested Problems

• Remove the polynomials that have positive real elements of their roots.

  1705 Solvers

• Who knows the last digit of pi?

  673 Solvers

• Back to basics 20 - singleton dimensions

  270 Solvers

• Make a vector of prime numbers

  801 Solvers

• There are 10 types of people in the world

  1156 Solvers

More from this Author96

• Read a column of numbers and interpolate missing data

  2317 Solvers

• Summing Digits within Text

  2546 Solvers

• What is the next step in Conway's Life?

  655 Solvers

• Duplicates

  2355 Solvers

• Find state names that start with the letter N

  1321 Solvers