Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7575457
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 30, 20262026-05-30T16:41:41+00:00 2026-05-30T16:41:41+00:00

Can the following expression be simplified? (M == null && C == null) ||

  • 0

Can the following expression be simplified?

(M == null && C == null) ||
(M != null && C != null && D == C)

Mathematically I know this can’t be simplified and I checked on WolframAlpha to confirm this, but I was wondering if it might be possible with use of one of the boolean logical operators (&, |, ^), to make that condition shorter. I’ve tried to think of ways but I’m having a mental block… is this actually possible to shorten?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-30T16:41:42+00:00Added an answer on May 30, 2026 at 4:41 pm

    No, it can’t be shortened.

    As Ferdinand Liu observes, your expression is true in two cases:

    • Both M and C are null, or
    • Both M and C are not null, and C and D are equal.

    You need to check both M and C in both conditions, so you can’t simplify the expression.


    Interesting but only slightly-related note:

    If you didn’t need to check C and D for equality, then the expression would be

    (M != null && C != null) || (M == null && C == null)
    

    and this can be simplified to

    !((M == null) ^ (C == null))
    

    which is true when M and C have the same “null-ness.”

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Can anyone parse this following expression for me #define Mask(x) (*((int *)&(x))) I applied
I got the following Expression that can look like this (the amount of Sqrt[XXX]
Following on from this question I asked yesterday: Can I shorten this regular expression?
How can I count the number of null values using SSRS? The following expression
I am using the following Expression to select all hyperlinks //a[@href] How can I
The following simple calculator expression grammar (BNF) can be easily parsed with the a
In my repository implementation I can run the following query using a lambda expression:
The following code gives a NullReferenceException since XPathSelectElement can't navigate through the XPath expression
I have the following string: cn=abcd,cn=groups,dc=domain,dc=com Can a regular expression be used here to
For example, how can I write an expression where the following is implicitly applied:

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.