Problem 34. Binary numbers

• Created by Cody Team
• Appears in 3 groups

×

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

Magic Numbers II

• 14 Problems
• 70 Finishers

Project Euler I

• 10 Problems
• 852 Finishers

Number theory

• 44 Problems
• 21 Finishers

Like (48)

Difficulty:

(771)

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.94% Correct | 58.06% Incorrect

• 12120 Solutions
• 4558 Solvers

Last Solution submitted on Mar 27, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Who Deserves Your Praise? Discover the New Contribution Widget!

We are excited to announce another update to our Discussions area: the...

Problem Recent Solvers4558

Suggested Problems

• Determine if a Given Number is a Triangle Number

  383 Solvers

• Back to basics 12 - Input Arguments

  605 Solvers

• Back to basics 20 - singleton dimensions

  270 Solvers

• Who invented zero?

  581 Solvers

• Return fibonacci sequence do not use loop and condition

  688 Solvers

More from this Author96

• Most nonzero elements in row

  7356 Solvers

• Nearest Numbers

  4715 Solvers

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

  655 Solvers

• Get the area codes from a list of phone numbers

  1062 Solvers

• The Goldbach Conjecture

  5777 Solvers