HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /An electrician finds a lamp wired through three branches in parallel…
AdvancedMathematicsHigh School (11–12)Mathematical ReasoningNumerical

An electrician finds a lamp wired through three branches in parallel…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

An electrician finds a lamp wired through three branches in parallel. The first branch has switches PPP and QQQ in series. The second branch has PPP and Q′Q'Q′ in series, where Q′Q'Q′ is open whenever QQQ is closed and closed whenever QQQ is open. The third branch has P′P'P′ and RRR in series, where P′P'P′ always does the opposite of PPP. Write the statement of the circuit, with ppp for "PPP is closed" and so on. Simplify it. How many independent switches does an equivalent circuit need? In how many of the 888 settings of PPP, QQQ and RRR does the lamp glow?

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

A tautology is always true and a contradiction always false. De Morgan: ∼(p∧q)≡∼p∨∼q\sim(p \wedge q) \equiv \sim p \vee \sim q∼(p∧q)≡∼p∨∼q and ∼(p∨q)≡∼p∧∼q\sim(p \vee q) \equiv \sim p \wedge \sim q∼(p∨q)≡∼p∧∼q. Distributive, complement, identity and absorption laws simplify a statement. Series is ∧\wedge∧, parallel is ∨\vee∨.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Given. Three branches in parallel: p∧qp \wedge qp∧q, p∧∼qp \wedge \sim qp∧∼q and ∼p∧r\sim p \wedge r∼p∧r.

Plan. Write the statement, simplify it, then count.

Step 1. The statement. S=(p∧q)∨(p∧∼q)∨(∼p∧r)S = (p \wedge q) \vee (p \wedge \sim q) \vee (\sim p \wedge r)S=(p∧q)∨(p∧∼q)∨(∼p∧r).

Step 2. The first two branches. (p∧q)∨(p∧∼q)≡p∧(q∨∼q)≡p∧T≡p(p \wedge q) \vee (p \wedge \sim q) \equiv p \wedge (q \vee \sim q) \equiv p \wedge \mathrm{T} \equiv p(p∧q)∨(p∧∼q)≡p∧(q∨∼q)≡p∧T≡p.

Step 3. Join the third. p∨(∼p∧r)≡(p∨∼p)∧(p∨r)≡T∧(p∨r)≡p∨rp \vee (\sim p \wedge r) \equiv (p \vee \sim p) \wedge (p \vee r) \equiv \mathrm{T} \wedge (p \vee r) \equiv p \vee rp∨(∼p∧r)≡(p∨∼p)∧(p∨r)≡T∧(p∨r)≡p∨r.

Step 4. The simple circuit. p∨rp \vee rp∨r is two switches, PPP and RRR, in parallel. So 222 switches do the job, and QQQ is not needed at all.

Step 5. Count. p∨rp \vee rp∨r is false only when PPP and RRR are both open. That is 222 of the 888 settings (QQQ open or closed). So the lamp glows in 8−2=68 - 2 = 68−2=6 settings.

Check. Setting PPP open, QQQ closed, RRR closed: only the third branch passes current, and p∨rp \vee rp∨r is true.

Answer: the circuit is equivalent to PPP and RRR in parallel, 222 switches, and the lamp glows in 666 settings.

Log in to save this for later
← All Problems
← Classify each statement as a tautology, a contradiction or a contingency…Prove, using the laws of the algebra of statements and not a truth table, that ∼big(p vee (∼ p… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Tautologies, equivalence and switching circuitsStatements, Connectives and Truth Tables

More on this topic

  1. Prove by cases that for every integer n, n² leaves remainder 0 or 1 when divided by 3…Advanced
  2. Prove by contradiction that there are no integers a and b with 6a + 9b = 100…Advanced
  3. Prove by contradiction that √3 is irrational…Hard
Prove by exhaustion that no perfect square ends in the digit 2, 3, 7 or 8…Advanced
  • The formula f(n) = n² + n + 41 gives a prime for n = 0, 1, 2, … for a long time…Advanced
  • All problems on this topic →