Question and Answers Forum
LogicQuestion and Answers: Page 6
|
Question and Answers Forum |
|
LogicQuestion and Answers: Page 6 |
| Consider n red and n blue points in the plane, no three of them being collinear. Prove that one can connect each red point to a blue one with a segment such that no two segments intersect. |
| pl show me app? |
| let set S=R let nS={R, R, ..., R_(n sets of R) } n∈Z^+ is ∣S∣<∣nS∣? what if n=∣S∣? |
|
|
| A ticket contains 9 digits serial number, which only composed from number 1, 2, or 3 Ticket can be colored red, blue, or green. If 2 different tickets have different serial numbers, they have different color too John has a blue ticket with serial number 311111111 Ann has a red ticket with serial number 111111111 You have 2 another tickets with serial number 312312312 and 131131131. What color should your tickets have? |
| 18:48 :: 180:? Answer optioms a. 392 b. 294 c.230 |
| if p is prima show that (√p) irasional |
| “In a great reunion each person knows at least two different persons in there”. Show that this statement implies that exists one person who has to know everyone. |
| eqution |
| Function Γ is a+b a+b=AB a≠b−4 b−4=4+b b=a−1 a−1=2 b=2 a=3 Function Γ is (a/b)+sin a+b Γ=(a/b)+sin a+b a=b−1 b=5 a=4 9−a=b 9−b=a Funcion Γ is ((sin a+sin b)/(sin^(−1) a+sin^(−1) b))×(a+b) sin a+sin b<c_1 c_1 =a×3 a=b+3 b=2 b+3=2+3 2+3=5 a=5 a×3=15 c_1 =15 c_2 =c_1 ÷5 c_1 ÷5=3 c_2 =3 c_1 +c_2 =c_3 c_3 =18 c_3 ≈sin a+b a×b×2=20 sin 20=sin a+b c_3 ≈20 |
| Prove or disprove that , as time goes by, the influence of the past on the present diminishes. (I met this idea in an informal analysis of the origins of equilibrium probabilities found for the transition matrix of a Markov chain scenario.) |
| Q#4140 is again asked with following changes: a always moves towards b′ (instead of b), b always moves towards c′ (instead of c), c always moves towards d′ (instead of d), d always moves towards a′ (instead of a), where a′,b′,c′ and d′ are midpoints of line segments ab, bc, cd and da respectively. |
| if p and q are two afirmation ∼(p→q)=? ∼(p←q)=? ∼(p⇔q)=? |
| Let A,B and C are three statments. (A⇒B⇒C⇒A) ⇒^(?) (C⇒B) (A⇒B⇒C⇒A) ⇒^(?) (B⇒A) Prove or disprove. |
| Simplify the following expression using the laws of Boolean algebra: (x∧∽y)∨(∽y∧∽z)∨(∽x∧∽z) . |
| [{8+4×3+(7÷7×3)}]_ |
| X is a person that can only one of these a.only tell truth b.only tell lie using a minimal number of question how to discover what type of people are X? |
| there a room with 3 doors, only one to exit, there are one people, you can talk to her 3 question and he only will answer you truth in only one question talking a lie in the other two question, but you dont know what the question wich he sayed the truth, how a people exit this room if possible? |
| in a street was two way road that leads to city A and city B, at the street you find two people, one lie and one tell truth if you can talk one question to each people only, how you go to city A? |
| There are 2 doors in a room and only one of them leads to exit. There is one watchman who tosses a coin when you ask a question and speaks truly or falsely based on the toss. Also watchman gives answer ′da′ or ′ja′ one of which means yes (you don′t know which one means yes). You are allowed to ask only one question to find which door leads to exit. What question will you ask? |
| can you solve the hardest logic puzzle in the world |
| A:C is false B:C∨A is false C:B is truth then if possible F is truth or false? F:(A∧B)∨(A∧C)∨(B∧C) |