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 3229984
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 17, 20262026-05-17T16:52:27+00:00 2026-05-17T16:52:27+00:00

I am trying to wrap my mind around how to do this. For what

  • 0

I am trying to wrap my mind around how to do this.
For what i understand is that a set of logic gates is called “functionally complete” if some combination of the gates can be used to do each of the basic logic operations AND, OR, and NOT. The claim is the NAND gate is functionally complete.

What i dont understand is how to build a OR gate as a nand gate. build a AND gate from a NAND gate etc.. would the formula i come up with have to have the same output?

 X' = X NAND 1
 X + Y = ?
 X * Y = ?

using a truth table how is X’ = X NAND 1?

I am not sure what X NAND 1 means.. I understand 1 is fixed as y?

I get confused when i see the gate inbetween 2 inputs like x NAND y

How can i construct a truth table for x+y = NAND?

or should i do it a different way?

  • 1 1 Answer
  • 1 View
  • 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-17T16:52:28+00:00Added an answer on May 17, 2026 at 4:52 pm

    Just go by definition:

    X NAND Y = ~ (X AND Y) = ~X OR ~Y

    Substitute Y = 1 and see you will get

    X NAND 1 = ~X OR ~1 = ~X OR 0 = ~X = X’

    Edit:

    Just so that you get a sense on how to build other gates using NAND gate, this wikipedia article is very good and informative. Hope it helps.

    http://en.wikipedia.org/wiki/NAND_logic

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

Sidebar

Related Questions

I'm trying to wrap my mind around the MVP pattern used in a C#/Winforms
I have spent the afternoon trying to wrap my mind around how to translate
Im trying to wrap my head around MVVM. I understand a lot of it,
I'm trying to wrap my head around Object Oriented programming. But I'm having some
I am trying to wrap my head around database normalization. This is my first
I'm trying to wrap my mind around css3's varying styles for different screen widths
I am still trying to wrap my mind around the workings of OAuth/OpenID, as
I'm trying to wrap my mind around MEF. There is one thing I don't
I am currently trying to wrap my mind around Java EE 5. What I'd
I'm trying to wrap my mind around the MVC framework of Sencha Touch, but

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.