Binary Number System Homework: Counting 1s in 162*9+162*7+16*5+3

  • Thread starter Thread starter RajChakrabrty
  • Start date Start date
  • Tags Tags
    Binary System
Click For Summary
SUMMARY

The discussion centers on determining the number of 1s in the binary representation of the expression 162*9 + 162*7 + 16*5 + 3. Participants highlight that the expression can be simplified to 167*16 + 5, making conversion to binary more straightforward. A key insight is that since all products involve even numbers, the sum results in an even number, indicating that the least significant bit (LSB) is 0. The focus is on understanding the binary representation rather than calculating the decimal value.

PREREQUISITES
  • Understanding of binary number representation
  • Familiarity with basic arithmetic operations
  • Knowledge of even and odd number properties
  • Basic skills in hexadecimal conversion
NEXT STEPS
  • Learn binary number representation techniques
  • Study the properties of even and odd integers in binary
  • Explore hexadecimal to binary conversion methods
  • Practice problems involving counting bits in binary numbers
USEFUL FOR

Students in mathematics or computer science, educators teaching binary systems, and anyone interested in number theory and binary arithmetic.

RajChakrabrty
Messages
27
Reaction score
0

Homework Statement



Number of 1 in the binary representation of the expression 162*9+162*7+16*5+3

Homework Equations





The Attempt at a Solution



obviously, anyone can add these numbers up and then convert to binary
but what is the actual procedure for this type of format?
 
Physics news on Phys.org
Notice that 162*9+162*7+16*5+3 can be rewritten as 162*16+16*5+3=167*16+5. Converting this to hexademical, then to binary, should be much easier than computing the decimal result and converting that to binary.
 
wonderful.
Thanks a lot.
 
UH ... I think you've missed the point here. The solution is obvious without doing ANY calcs.

Just notice that each of the products has an even term in it, and the product of any even integer with ANY integer is an even number, so you have the sum of 3 even numbers and THAT is an even number, so what's the low-order bit in a binary representation of ANY even number? I think that's the point of the exercise because if you understand that, then the answer is trivial.
 
I read this problem statement as "Find the number of ones in the binary representation..."--not "what is the value of the LSB". Maybe OP can clarify.
 
lewando said:
I read this problem statement as "Find the number of ones in the binary representation..."--not "what is the value of the LSB". Maybe OP can clarify.

Yeah, now you mention it and I re-read it, I see your point. I just glossed over the problem statement so quickly that my brain said "value of the 1 bit", which is NOT, as you point out, quite what it says and your interpretation seems more likely.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 11 ·
Replies
11
Views
3K
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
11K