Help in Bitwise and Operator

Find all natural numbers \(n\) that satisfy condition n&x = n ? Where x is a Any constant Positive Integer.

Note by Rishabh Deep Singh
8 months, 2 weeks ago

No vote yet
1 vote

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

Sir are you CSE IITKGP?

Ayaen Shukla - 6 months ago

Log in to reply

I am a Mechanical Student At IIT Kharagpur.

Rishabh Deep Singh - 5 months, 2 weeks ago

Log in to reply

Okay! I am CSE at IIT Patna.

Ayaen Shukla - 5 months, 2 weeks ago

Log in to reply

@Ayaen Shukla pm me on facebook

Rishabh Deep Singh - 5 months, 2 weeks ago

Log in to reply

@Agnishom Chattopadhyay @Chew-Seong Cheong

Rishabh Deep Singh - 8 months, 2 weeks ago

Log in to reply

I Found a Blog about it on Codeforces as SOS Dynamic Programming @Agnishom Chattopadhyay

Rishabh Deep Singh - 7 months, 1 week ago

Log in to reply

That's cool. Send me the link.

Agnishom Chattopadhyay Staff - 7 months, 1 week ago

Log in to reply

Log in to reply

By next number, do you mean keeping x fixed, you want to search for the next such n?

Agnishom Chattopadhyay Staff - 8 months, 2 weeks ago

Log in to reply

I have edited the Problem a little bit.

Rishabh Deep Singh - 8 months, 2 weeks ago

Log in to reply

@Rishabh Deep Singh Well, for the bits where x has a 1, n can have anything, and for the places where x has a 0, n must have a 0 too. Does that answer your question?

Agnishom Chattopadhyay Staff - 8 months, 2 weeks ago

Log in to reply

@Agnishom Chattopadhyay Can u write code for that ? to print all numbers Please?

Rishabh Deep Singh - 8 months, 2 weeks ago

Log in to reply

@Rishabh Deep Singh That's an interesting exercise. If you are stuck on this, I'd urge you to consider writing your code recursively. That might help. Or if you are not concerned about efficiency, you may loop over all the values and check if it satisfies the condition.

Agnishom Chattopadhyay Staff - 8 months, 2 weeks ago

Log in to reply

@Agnishom Chattopadhyay Efficiency is More important, Can u help me with code?

Rishabh Deep Singh - 8 months, 2 weeks ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...