Use algebraic manipulation to find the minimum product of-sums expression for the function:(A + C + D) (A + B! + C)(A + B! + C! + D)

What am I doing wrong??

Here is what I have so far...

1) I need each expression to have all of the terms.
2) so I said okay the first term is missing a B, and the second term is missing a D so I did...

(A + B + C + D)(A + B! + C + D!)(A + B! + C + D)(A + B!

Hi there i saw you guys did have a thread about these 2 questions but didnt finish it i am busy with a subject called foundations of computer science and cant seem to figure out how to do this please help

Question 1
Use only Boolean algebra to simplify the Boolean expression F. (First simplify F
1 and F2, then simplify
F1 · F2, showing all the steps.

I have been doing research on the Boolean Satifiability problem, and I found two new and interesting (If you can nerd out on Boolean Algebra like me) way of tackling the problem. I am currently writing an article about my new Algorithms.

What is the best way for sharing the code for my little proof of concept version.

I have been working on an app and is live on google Play. This app consist of in app products which uses IAB v3 . In the new update I want that the user may buy the product from our website and get a encrypted code from our website (exclusive for each product) and directly use it in the app to buy the products.

CafePress.com, a website where users can create and sell products using their own custom designs, is announcing a redesign today that President Sumant Sridharan said will simplify the product creation process.
There are actually a number of recent changes that the company has been rolling out on its website, but the launch of the “Smart Product Engine” may be the most significant.

So I'm a programming student, but we have a computer architecture module. Just recently we started working with Proteus. Up to that point we had been discussing truth tables, binary conversions and k maps. So the jump to logic circuits was pretty fast.

So as part of our homework we were supposed to simplify truth table binary results to boolean algebra via k-map. Which I have done.

I'm trying to get the list of all the in-app products for my android application so I can check if the product has been already purchased or not, in order to update my User Interface the problem is that I always got a null pointer when using getSkuDetails.

I have a couple questions on my homework that I have been stumped on for the longest time. If someone could help me out, it would be greatly appreciated. BTW, the subject is boolean algebra

Question 1:
Give a logical expression with variables p,q, and r that is true if p and q are false and r is true.

In an app we are developing, it is possible to browse products (by tag or department) or search for specific products using search. When a browse or search request is made by the user, we return a JSON Array that contains SOME details about the products (name, manufacturer, price, image, etc).