Search Colleges, Courses, Exams, Questions and Articles

Ask a query on 8879100846 Ask Login | Sign Up

 

 

› Ask & Answer › Question

Consider the following statements:

P : Ramu is intelligent.

Q : Ramu is rich.

R : Ramu is not honest.

The negation of the statement “Ramu is intelligent and honest if and only if Ramu is not rich” can be expressed as

Option 1 -

( ( P ∧ ( ∼ R ) ) ∧ Q ) ∧ ( ( ∼ Q ) ∧ ( ( ∼ P ) ∨ R ) )

Option 2 -

( ( P ∧ R ) ∧ Q ) ∨ ( ( ∼ Q ) ∧ ( ( ∼ P ) ∨ ( ∼ R ) ) )

Option 3 -

( ( P ∧ R ) ∧ Q ) ∧ ( ( ∼ Q ) ∧ ( ( ∼ P ) ∨ ( ∼ R ) ) )

Option 4 -

( ( P ∧ ( ∼ R ) ) ∧ Q ) ∨ ( ( ∼ Q ) ∧ ( ( ∼ P ) ∨ R ) )

0 2 Views | Posted 2 months ago
Asked by Shiksha User

  • 1 Answer

  • P

    Answered by

    Payal Gupta | Contributor-Level 10

    2 months ago
    Correct Option - 4


    Detailed Solution:

    P : Ramu is intelligent

    Q : Ramu is rich

    R : Ramu is not honest

    Give statement, “Ramu is intelligent and honest if any only if Ramu is not rich”

    = (P∧∼R)⇔∼Q

    So, negation of the statement is

    ∼ [ (P∧∼R)⇒∼Q]

    = ( (P∧∼R)∧Q)∨ (∼Q∧ (∼P∨R))

Similar Questions for you

Let Δ , ∇ ∈ { ∧ , ∨ } be such that p ∇ q ⇒ ( ( p Δ q ) ∇ r ) is a tautology. Then ( p ∇ q ) Δ   r  is logically equivalent to:
R
Raj Pandey

Case – I Δ ≡ ∇ ≡ ∧  

              ( p ∧ q ) → ( ( p ∧ q ) ∧ r )  

              it can be false if r is false,

              so not a tautology

              Case – II If Δ ≡ ∇ ≡ ∨  

              ( p ∨ q ) ?     → ( ( p ∨ q ) ∨ r ) ≡ tautology

              then ( p ∨ q ) ∨ r ≡ ( p Δ r ) ∨ q   

              Case – I

...more

Negation of the Boolean statement ( p ∨ q ) ⇒ ( ( ∼ r ) ∨ p )  is equivalent to
V
Vishal Baghel

pva ( ∼ r   v   p )

∼ ( p ∨ q ) ∨ ( ∼ r v p )

its negation as asked in question

( p ∨ q ) ∧ ( ∼ p ∧ r )

= ( p ∧ ∼ p ∧ r ) ∨ ( q ∧ r ∧ ∼ p )

= ( p ∧ r ∧ ∼ p )                   [ a s     p ∧ ∼ p     i s     f a l s e ]

The remainder when (2021)2023 is divided by 7 is:
R
Raj Pandey

2 0 2 1 ≡ − 2 mod (7)

⇒ ( 2 0 2 1 ) 2 0 2 3 ≡ ( − 2 ) 2 0 2 3 m o d ( 7 )   …… (i)

Now,   ( − 2 ) 3 ≡ − 1 m o d ( 7 )  

⇒ ( − 2 ) 2 0 2 3 ≡ ( − 2 ) m o d ( 7 ) ≡ 5 m o d ( 7 )       ……. (ii)

(i) & (ii)

⇒ ( 2 0 2 1 ) 2 0 2 3 ≡ 5 m o d ( 7 )  

∴  Remainder = 5

Let p, q, r be three logical statements. Consider the compound statements

  S 1 : ( ( ∼ p ) ∨ q ) ∨ ( ( ∼ p ) ∨ r )     a n d  

  S 2 : p → ( q ∨ r )  

 Then, which of the following is NOT true?
R
Raj Pandey

kindly consider the following Image 

 

The statement ( ∼ ( p ⇔ ∼ q ) ) ∧ q     i s :  
R
Raj Pandey

∼ ( p ⇔ ∼ q ) ∧ q = ( p ⇔ ∼ q ) ∧ q     i s :

∴ ( ∼ ( P ⇔ ∼ Q ) ) ∧ q is equivalent to ( p ⇒ q ) ∧

Get authentic answers from experts, students and alumni that you won't find anywhere else

Sign Up on Shiksha

On Shiksha, get access to

  • 65k Colleges
  • 1.2k Exams
  • 688k Reviews
  • 1800k Answers

Learn more about...

Share Your College Life Experience

Write a Review

Didn't find the answer you were looking for?

Search from Shiksha's 1 lakh+ Topics

or

Ask Current Students, Alumni & our Experts

Ask Now
Community GuidelinesUser Points System
QuestionsDiscussionsTags
×
×

This website uses Cookies and related technologies for the site to function correctly and securely, improve & personalise your browsing experience, analyse traffic, and support our marketing efforts and serve the Core Purpose. By continuing to browse the site, you agree to Privacy Policy and Cookie Policy.

Need guidance on career and education? Ask our experts

Characters 0/140

The Answer must contain atleast 20 characters.

Add more details

Characters 0/300

The Answer must contain atleast 20 characters.

Keep it short & simple. Type complete word. Avoid abusive language. Next

Your Question

Edit

Add relevant tags to get quick responses. Cancel Post