Question and Answers Forum

LogicQuestion and Answers: Page 6

Question Number 11801 Answers: 0 Comments: 1

pl show me app?

$$\mathrm{pl}\:\mathrm{show}\:\mathrm{me}\:\mathrm{app}? \\ $$

Question Number 11145 Answers: 0 Comments: 1

let set S=R let nS={R, R, ..., R_(n sets of R) } n∈Z^+ is ∣S∣<∣nS∣? what if n=∣S∣?

$$\mathrm{let}\:\mathrm{set}\:{S}=\mathbb{R} \\ $$$$\mathrm{let}\:{nS}=\left\{\underset{{n}\:\mathrm{sets}\:\mathrm{of}\:\mathbb{R}} {\mathbb{R},\:\mathbb{R},\:...,\:\mathbb{R}}\right\}\:\:\:\:\:\:\:\:\:{n}\in\mathbb{Z}^{+} \\ $$$$\mathrm{is}\:\mid{S}\mid<\mid{nS}\mid? \\ $$$$\: \\ $$$$\mathrm{what}\:\mathrm{if}\:{n}=\mid{S}\mid? \\ $$

Question Number 10517 Answers: 0 Comments: 0

Question Number 9487 Answers: 0 Comments: 0

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?

$$\mathrm{A}\:\mathrm{ticket}\:\mathrm{contains}\:\mathrm{9}\:\mathrm{digits}\:\mathrm{serial}\:\mathrm{number}, \\ $$$$\mathrm{which}\:\mathrm{only}\:\mathrm{composed}\:\mathrm{from}\:\mathrm{number}\:\mathrm{1},\:\mathrm{2},\:\mathrm{or}\:\mathrm{3} \\ $$$$\mathrm{Ticket}\:\mathrm{can}\:\mathrm{be}\:\mathrm{colored}\:\mathrm{red},\:\mathrm{blue},\:\mathrm{or}\:\mathrm{green}. \\ $$$$\mathrm{If}\:\mathrm{2}\:\mathrm{different}\:\mathrm{tickets}\:\mathrm{have}\:\mathrm{different}\:\mathrm{serial}\:\mathrm{numbers}, \\ $$$$\mathrm{they}\:\mathrm{have}\:\mathrm{different}\:\mathrm{color}\:\mathrm{too} \\ $$$$ \\ $$$$\mathrm{John}\:\mathrm{has}\:\mathrm{a}\:\mathrm{blue}\:\mathrm{ticket}\:\mathrm{with}\:\mathrm{serial}\:\mathrm{number}\:\mathrm{311111111} \\ $$$$\mathrm{Ann}\:\mathrm{has}\:\mathrm{a}\:\mathrm{red}\:\mathrm{ticket}\:\mathrm{with}\:\mathrm{serial}\:\mathrm{number}\:\mathrm{111111111} \\ $$$$\mathrm{You}\:\mathrm{have}\:\mathrm{2}\:\mathrm{another}\:\mathrm{tickets}\:\mathrm{with}\:\mathrm{serial}\:\mathrm{number}\:\mathrm{312312312}\:\mathrm{and}\:\mathrm{131131131}. \\ $$$$\mathrm{What}\:\mathrm{color}\:\mathrm{should}\:\mathrm{your}\:\mathrm{tickets}\:\mathrm{have}? \\ $$

Question Number 8545 Answers: 0 Comments: 1

18:48 :: 180:? Answer optioms a. 392 b. 294 c.230

$$\mathrm{18}:\mathrm{48}\:::\:\mathrm{180}:? \\ $$$$\mathrm{Answer}\:\mathrm{optioms} \\ $$$$\mathrm{a}.\:\mathrm{392}\:\mathrm{b}.\:\mathrm{294}\:\mathrm{c}.\mathrm{230} \\ $$

Question Number 8164 Answers: 1 Comments: 2

if p is prima show that (√p) irasional

$${if}\:\boldsymbol{{p}}\:{is}\:{prima}\:{show}\:{that}\:\sqrt{\boldsymbol{{p}}}\:{irasional} \\ $$

Question Number 6464 Answers: 0 Comments: 3

“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.

$$``{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}. \\ $$

Question Number 5450 Answers: 1 Comments: 0

eqution

$${eqution} \\ $$

Question Number 4790 Answers: 0 Comments: 0

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

$${Function}\:\Gamma\:{is}\:{a}+{b} \\ $$$${a}+{b}={AB} \\ $$$${a}\neq{b}−\mathrm{4} \\ $$$${b}−\mathrm{4}=\mathrm{4}+{b} \\ $$$${b}={a}−\mathrm{1} \\ $$$${a}−\mathrm{1}=\mathrm{2} \\ $$$${b}=\mathrm{2} \\ $$$${a}=\mathrm{3} \\ $$$${Function}\:\Gamma\:{is}\:\frac{{a}}{{b}}+\mathrm{sin}\:{a}+{b} \\ $$$$\Gamma=\frac{{a}}{{b}}+\mathrm{sin}\:{a}+{b} \\ $$$${a}={b}−\mathrm{1} \\ $$$${b}=\mathrm{5} \\ $$$${a}=\mathrm{4} \\ $$$$\mathrm{9}−{a}={b} \\ $$$$\mathrm{9}−{b}={a} \\ $$$${Funcion}\:\Gamma\:{is}\:\frac{\mathrm{sin}\:{a}+\mathrm{sin}\:{b}}{\mathrm{sin}^{−\mathrm{1}} {a}+\mathrm{sin}^{−\mathrm{1}} {b}}×\left({a}+{b}\right) \\ $$$$\mathrm{sin}\:{a}+\mathrm{sin}\:{b}<{c}_{\mathrm{1}} \\ $$$${c}_{\mathrm{1}} ={a}×\mathrm{3} \\ $$$${a}={b}+\mathrm{3} \\ $$$${b}=\mathrm{2} \\ $$$${b}+\mathrm{3}=\mathrm{2}+\mathrm{3} \\ $$$$\mathrm{2}+\mathrm{3}=\mathrm{5} \\ $$$${a}=\mathrm{5} \\ $$$${a}×\mathrm{3}=\mathrm{15} \\ $$$${c}_{\mathrm{1}} =\mathrm{15} \\ $$$${c}_{\mathrm{2}} ={c}_{\mathrm{1}} \boldsymbol{\div}\mathrm{5} \\ $$$${c}_{\mathrm{1}} \boldsymbol{\div}\mathrm{5}=\mathrm{3} \\ $$$${c}_{\mathrm{2}} =\mathrm{3} \\ $$$${c}_{\mathrm{1}} +{c}_{\mathrm{2}} ={c}_{\mathrm{3}} \\ $$$${c}_{\mathrm{3}} =\mathrm{18} \\ $$$${c}_{\mathrm{3}} \approx\mathrm{sin}\:{a}+{b} \\ $$$${a}×{b}×\mathrm{2}=\mathrm{20} \\ $$$$\mathrm{sin}\:\mathrm{20}=\mathrm{sin}\:{a}+{b} \\ $$$${c}_{\mathrm{3}} \approx\mathrm{20} \\ $$

Question Number 4621 Answers: 0 Comments: 1

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.)

$${Prove}\:{or}\:{disprove}\:{that}\:,\:{as}\:{time}\:{goes}\:{by}, \\ $$$${the}\:{influence}\:{of}\:{the}\:{past}\:{on}\:{the}\: \\ $$$${present}\:{diminishes}.\: \\ $$$$\left({I}\:{met}\:{this}\:{idea}\:{in}\:{an}\:{informal}\right. \\ $$$${analysis}\:{of}\:{the}\:{origins}\:{of}\:{equilibrium}\: \\ $$$${probabilities}\:{found}\:{for}\:{the}\:{transition} \\ $$$$\left.{matrix}\:{of}\:{a}\:{Markov}\:{chain}\:{scenario}.\right) \\ $$

Question Number 4196 Answers: 0 Comments: 4

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.

Question Number 1689 Answers: 1 Comments: 0

if p and q are two afirmation ∼(p→q)=? ∼(p←q)=? ∼(p⇔q)=?

$$\mathrm{if}\:{p}\:\mathrm{and}\:{q}\:\mathrm{are}\:\mathrm{two}\:\mathrm{afirmation} \\ $$$$\sim\left({p}\rightarrow{q}\right)=? \\ $$$$\sim\left({p}\leftarrow{q}\right)=? \\ $$$$\sim\left({p}\Leftrightarrow{q}\right)=? \\ $$

Question Number 1656 Answers: 0 Comments: 12

Let A,B and C are three statments. (A⇒B⇒C⇒A) ⇒^(?) (C⇒B) (A⇒B⇒C⇒A) ⇒^(?) (B⇒A) Prove or disprove.

$$\mathrm{Let}\:\mathrm{A},\mathrm{B}\:\mathrm{and}\:\mathrm{C}\:\mathrm{are}\:\mathrm{three}\:\mathrm{statments}.\: \\ $$$$\left(\mathrm{A}\Rightarrow\mathrm{B}\Rightarrow\mathrm{C}\Rightarrow\mathrm{A}\right)\:\overset{?} {\Rightarrow}\left(\mathrm{C}\Rightarrow\mathrm{B}\right)\: \\ $$$$\left(\mathrm{A}\Rightarrow\mathrm{B}\Rightarrow\mathrm{C}\Rightarrow\mathrm{A}\right)\:\overset{?} {\Rightarrow}\left(\mathrm{B}\Rightarrow\mathrm{A}\right)\: \\ $$$$\mathrm{Prove}\:\mathrm{or}\:\mathrm{disprove}. \\ $$

Question Number 1047 Answers: 0 Comments: 1

Simplify the following expression using the laws of Boolean algebra: (x∧∽y)∨(∽y∧∽z)∨(∽x∧∽z) .

$${Simplify}\:{the}\:{following} \\ $$$${expression}\:{using}\:{the}\:{laws}\:{of}\: \\ $$$${Boolean}\:{algebra}: \\ $$$$\left({x}\wedge\backsim{y}\right)\vee\left(\backsim{y}\wedge\backsim{z}\right)\vee\left(\backsim{x}\wedge\backsim{z}\right)\:. \\ $$$$ \\ $$

Question Number 961 Answers: 1 Comments: 0

[{8+4×3+(7÷7×3)}]_

$$\left[\left\{\mathrm{8}+\mathrm{4}×\mathrm{3}+\left(\mathrm{7}\boldsymbol{\div}\mathrm{7}×\mathrm{3}\right)\right\}\right]_{} \\ $$

Question Number 902 Answers: 1 Comments: 0

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?

$$\mathrm{X}\:\mathrm{is}\:\mathrm{a}\:\mathrm{person}\:\mathrm{that}\:\mathrm{can}\:\mathrm{only}\:\mathrm{one}\:\mathrm{of}\:\mathrm{these} \\ $$$$\mathrm{a}.\mathrm{only}\:\mathrm{tell}\:\mathrm{truth} \\ $$$$\mathrm{b}.\mathrm{only}\:\mathrm{tell}\:\mathrm{lie} \\ $$$$\mathrm{using}\:\mathrm{a}\:\mathrm{minimal}\:\mathrm{number}\:\mathrm{of}\:\mathrm{question} \\ $$$$\mathrm{how}\:\mathrm{to}\:\mathrm{discover}\:\mathrm{what}\:\mathrm{type}\:\mathrm{of}\:\mathrm{people} \\ $$$$\mathrm{are}\:\mathrm{X}? \\ $$

Question Number 854 Answers: 1 Comments: 0

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?

$$\mathrm{there}\:\mathrm{a}\:\mathrm{room}\:\mathrm{with}\:\mathrm{3}\:\mathrm{doors},\:\mathrm{only}\:\mathrm{one} \\ $$$$\mathrm{to}\:\mathrm{exit},\:\mathrm{there}\:\mathrm{are}\:\mathrm{one}\:\mathrm{people},\:\mathrm{you}\:\mathrm{can} \\ $$$$\mathrm{talk}\:\mathrm{to}\:\mathrm{her}\:\mathrm{3}\:\mathrm{question}\:\mathrm{and}\:\mathrm{he}\:\mathrm{only}\:\mathrm{will} \\ $$$$\mathrm{answer}\:\mathrm{you}\:\mathrm{truth}\:\mathrm{in}\:\mathrm{only}\:\mathrm{one}\:\mathrm{question} \\ $$$$\mathrm{talking}\:\mathrm{a}\:\mathrm{lie}\:\mathrm{in}\:\mathrm{the}\:\mathrm{other}\:\mathrm{two}\:\mathrm{question}, \\ $$$$\mathrm{but}\:\mathrm{you}\:\mathrm{dont}\:\mathrm{know}\:\mathrm{what}\:\mathrm{the}\:\mathrm{question} \\ $$$$\mathrm{wich}\:\mathrm{he}\:\mathrm{sayed}\:\mathrm{the}\:\mathrm{truth},\:\mathrm{how}\:\mathrm{a}\:\mathrm{people} \\ $$$$\mathrm{exit}\:\mathrm{this}\:\mathrm{room}\:\mathrm{if}\:\mathrm{possible}? \\ $$

Question Number 848 Answers: 2 Comments: 0

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?

$$\mathrm{in}\:\mathrm{a}\:\mathrm{street}\:\mathrm{was}\:\mathrm{two}\:\mathrm{way}\:\mathrm{road}\:\mathrm{that}\:\mathrm{leads}\:\mathrm{to} \\ $$$$\mathrm{city}\:\mathrm{A}\:\mathrm{and}\:\mathrm{city}\:\mathrm{B},\:\mathrm{at}\:\mathrm{the}\:\mathrm{street}\:\mathrm{you}\:\mathrm{find} \\ $$$$\mathrm{two}\:\mathrm{people},\:\mathrm{one}\:\mathrm{lie}\:\mathrm{and}\:\mathrm{one}\:\mathrm{tell}\:\mathrm{truth} \\ $$$$\mathrm{if}\:\mathrm{you}\:\mathrm{can}\:\mathrm{talk}\:\mathrm{one}\:\mathrm{question}\:\mathrm{to}\:\mathrm{each} \\ $$$$\mathrm{people}\:\mathrm{only},\:\mathrm{how}\:\mathrm{you}\:\mathrm{go}\:\mathrm{to}\:\mathrm{city}\:\mathrm{A}? \\ $$

Question Number 843 Answers: 1 Comments: 3

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?

$$\mathrm{There}\:\mathrm{are}\:\mathrm{2}\:\mathrm{doors}\:\mathrm{in}\:\mathrm{a}\:\mathrm{room}\:\mathrm{and}\:\mathrm{only} \\ $$$$\mathrm{one}\:\mathrm{of}\:\mathrm{them}\:\mathrm{leads}\:\mathrm{to}\:\mathrm{exit}.\:\mathrm{There}\:\mathrm{is}\:\mathrm{one} \\ $$$$\mathrm{watchman}\:\mathrm{who}\:\mathrm{tosses}\:\mathrm{a}\:\mathrm{coin}\:\mathrm{when}\:\mathrm{you} \\ $$$$\mathrm{ask}\:\mathrm{a}\:\mathrm{question}\:\mathrm{and}\:\mathrm{speaks}\:\mathrm{truly}\:\mathrm{or}\:\mathrm{falsely} \\ $$$$\mathrm{based}\:\mathrm{on}\:\mathrm{the}\:\mathrm{toss}.\:\mathrm{Also}\:\mathrm{watchman} \\ $$$$\mathrm{gives}\:\mathrm{answer}\:'\mathrm{da}'\:\mathrm{or}\:'\mathrm{ja}'\:\mathrm{one}\:\mathrm{of}\:\mathrm{which}\:\mathrm{means} \\ $$$$\mathrm{yes}\:\left(\mathrm{you}\:\mathrm{don}'\mathrm{t}\:\mathrm{know}\:\mathrm{which}\:\mathrm{one}\:\mathrm{means}\:\mathrm{yes}\right). \\ $$$$ \\ $$$$\mathrm{You}\:\mathrm{are}\:\mathrm{allowed}\:\mathrm{to}\:\mathrm{ask}\:\mathrm{only}\:\mathrm{one}\:\mathrm{question} \\ $$$$\mathrm{to}\:\mathrm{find}\:\mathrm{which}\:\mathrm{door}\:\mathrm{leads}\:\mathrm{to}\:\mathrm{exit}. \\ $$$$ \\ $$$$\mathrm{What}\:\mathrm{question}\:\mathrm{will}\:\mathrm{you}\:\mathrm{ask}? \\ $$

Question Number 831 Answers: 1 Comments: 2

can you solve the hardest logic puzzle in the world

$${can}\:{you}\:{solve}\:{the}\:\:{hardest}\:{logic}\:{puzzle}\:{in}\:{the}\:{world} \\ $$

Question Number 247 Answers: 1 Comments: 0

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)

$$\mathrm{A}:\mathrm{C}\:\mathrm{is}\:\mathrm{false} \\ $$$$\mathrm{B}:\mathrm{C}\vee\mathrm{A}\:\mathrm{is}\:\mathrm{false} \\ $$$$\mathrm{C}:\mathrm{B}\:\mathrm{is}\:\mathrm{truth} \\ $$$$\mathrm{then}\:\mathrm{if}\:\mathrm{possible}\:\mathrm{F}\:\mathrm{is}\:\mathrm{truth}\:\mathrm{or}\:\mathrm{false}? \\ $$$$\mathrm{F}:\left(\mathrm{A}\wedge\mathrm{B}\right)\vee\left(\mathrm{A}\wedge\mathrm{C}\right)\vee\left(\mathrm{B}\wedge\mathrm{C}\right)\: \\ $$

Pg 1 Pg 2 Pg 3 Pg 4 Pg 5 Pg 6 Pg 7

Contact: info@tinkutara.com