Question and Answers Forum

All Questions Topic List

AllQuestion and Answers: Page 30

Question Number 221117 Answers: 3 Comments: 1

Question Number 221112 Answers: 0 Comments: 2

Question Number 221102 Answers: 3 Comments: 0

Question Number 221103 Answers: 0 Comments: 0

Prove : ∀x∈IR, ∀n∈IN^∗ ∫^( (π/2)) _( 0) ch(2xt)cos^(2n) (t) dt ≤ e^(x^2 /n) ∫^( (π/2)) _( 0) cos^(2n) (t) dt

$$\mathrm{Prove}\::\:\:\:\:\:\forall\mathrm{x}\in\mathrm{IR},\:\forall\mathrm{n}\in\mathrm{IN}^{\ast} \: \\ $$$$\underset{\:\mathrm{0}} {\int}^{\:\frac{\pi}{\mathrm{2}}} \mathrm{ch}\left(\mathrm{2xt}\right)\mathrm{cos}^{\mathrm{2n}} \left(\mathrm{t}\right)\:\mathrm{dt}\:\leqslant\:\mathrm{e}^{\frac{\mathrm{x}^{\mathrm{2}} }{\mathrm{n}}} \underset{\:\mathrm{0}} {\int}^{\:\frac{\pi}{\mathrm{2}}} \mathrm{cos}^{\mathrm{2n}} \left(\mathrm{t}\right)\:\mathrm{dt} \\ $$

Question Number 221100 Answers: 0 Comments: 0

Prove; ∫_0 ^( +∞) ((4∙cos x ∙ ((sinh x ))^(1/(6 )) )/(sinh x + sinh 3x + 4 sinh^2 x − 2 sinh^2 2x + 4 sinh^4 x + 4 cosh^4 x)) dx = (𝛑/( (√6) + 2))

$$ \\ $$$$\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\boldsymbol{\mathrm{Prove}}; \\ $$$$\:\:\int_{\mathrm{0}} ^{\:+\infty} \:\frac{\mathrm{4}\centerdot\boldsymbol{\mathrm{cos}}\:\boldsymbol{{x}}\:\centerdot\:\sqrt[{\mathrm{6}\:\:}]{\boldsymbol{\mathrm{sinh}}\:\boldsymbol{{x}}\:}}{\boldsymbol{\mathrm{sinh}}\:\boldsymbol{{x}}\:+\:\boldsymbol{\mathrm{sinh}}\:\mathrm{3}\boldsymbol{{x}}\:+\:\mathrm{4}\:\boldsymbol{\mathrm{sinh}}^{\mathrm{2}} \:\boldsymbol{{x}}\:−\:\mathrm{2}\:\boldsymbol{\mathrm{sinh}}^{\mathrm{2}} \:\mathrm{2}\boldsymbol{{x}}\:+\:\mathrm{4}\:\boldsymbol{\mathrm{sinh}}^{\mathrm{4}} \:\boldsymbol{{x}}\:+\:\mathrm{4}\:\boldsymbol{\mathrm{cosh}}^{\mathrm{4}} \boldsymbol{{x}}}\:\boldsymbol{\mathrm{d}{x}}\:=\:\frac{\boldsymbol{\pi}}{\:\sqrt{\mathrm{6}}\:+\:\mathrm{2}}\:\:\:\:\:\:\: \\ $$$$ \\ $$

Question Number 221099 Answers: 1 Comments: 0

Prove: ∫_( −π) ^( π) Σ_(n=0) ^∞ ((cos^(n + 1) x)/((n + 1)(1 + e^x^(2n +1) ))) dx = π ln2

$$ \\ $$$$\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\mathrm{Prove}: \\ $$$$\:\:\underset{\:−\pi} {\overset{\:\pi} {\int}}\:\underset{{n}=\mathrm{0}} {\overset{\infty} {\sum}}\:\frac{\mathrm{cos}^{{n}\:+\:\mathrm{1}} \:{x}}{\left({n}\:+\:\mathrm{1}\right)\left(\mathrm{1}\:+\:{e}^{{x}^{\mathrm{2}{n}\:+\mathrm{1}} } \right)}\:\:\mathrm{d}{x}\:=\:\pi\:\mathrm{ln2}\:\:\:\:\: \\ $$$$ \\ $$

Question Number 221095 Answers: 3 Comments: 0

Complex integral 1. ∫_(−∞) ^( +∞) (dz/((z^2 +1)^ν ))=?? 2. ∫_(−∞) ^(+∞) (e^(iπt) /(t^2 +1)) dt=?? 3. ∮_( C) (1/z) dz=?? , C;x^2 +y^2 =1

$$\mathrm{Complex}\:\mathrm{integral} \\ $$$$\mathrm{1}.\:\int_{−\infty} ^{\:+\infty} \:\:\:\frac{\mathrm{d}{z}}{\left({z}^{\mathrm{2}} +\mathrm{1}\right)^{\nu} }=?? \\ $$$$\mathrm{2}.\:\int_{−\infty} ^{+\infty} \:\:\frac{{e}^{\boldsymbol{{i}}\pi{t}} }{{t}^{\mathrm{2}} +\mathrm{1}}\:\mathrm{d}{t}=?? \\ $$$$\mathrm{3}.\:\oint_{\:{C}} \:\frac{\mathrm{1}}{{z}}\:\mathrm{d}{z}=??\:,\:{C};{x}^{\mathrm{2}} +{y}^{\mathrm{2}} =\mathrm{1} \\ $$

Question Number 221089 Answers: 2 Comments: 0

Find (1) ∫(1/x^9 )dx (2) ∫(1/(x^9 +1))dx.

$$\mathrm{Find}\: \\ $$$$\left(\mathrm{1}\right)\:\int\frac{\mathrm{1}}{{x}^{\mathrm{9}} }{dx} \\ $$$$\left(\mathrm{2}\right)\:\int\frac{\mathrm{1}}{{x}^{\mathrm{9}} +\mathrm{1}}{dx}. \\ $$

Question Number 221088 Answers: 0 Comments: 0

Question Number 221081 Answers: 0 Comments: 0

for all m,n,p∈R (g(m)+n)(g(n)+m)=p^2 (perfect square number) find function g;N→N

$$\mathrm{for}\:\mathrm{all}\:{m},{n},{p}\in\mathbb{R} \\ $$$$\left(\mathrm{g}\left({m}\right)+{n}\right)\left(\mathrm{g}\left({n}\right)+{m}\right)={p}^{\mathrm{2}} \left(\mathrm{perfect}\:\mathrm{square}\:\mathrm{number}\right) \\ $$$$\mathrm{find}\:\mathrm{function}\:\mathrm{g};\mathbb{N}\rightarrow\mathbb{N} \\ $$

Question Number 221078 Answers: 0 Comments: 0

There is a widely circulated number game among the people called "Making Zero". The rules of a simplified version of the game are as follows: Two players, A and B, each extend one hand. At the beginning, both players use this hand to represent a number (each number is an integer from 1 to 9 and can be chosen arbitrarily) as the initial state. Then, one side is chosen as the first player, who uses his hand to touch the other player's hand. The number represented by his hand is changed to the sum of "the number originally represented by his hand" and "the number represented by the other player's hand", and only the units digit is kept as the new number, while the other player's number remains unchanged. Subsequently, the other side repeats this process. Generally, the game continues until one side "makes zero", at which point that side is declared the winner. Specifically, if after several rounds, neither side can "make zero", that is, the situation enters a "dead loop", we call this situation a "singular situation". For example, if the initial states of A and B are "2" and "4" respectively, and A is the first player, after one round, A and B become "6" and "4", and after another round, they become "6" and "0". At this point, B "makes zero" and wins. We can represent any situation formed by both sides at any moment in the game as an ordered array (a, b), which means: at this moment, the number represented by the first player's hand is a, and the number represented by the second player's hand is b. For example, in the previous example, the game process can be represented as (2, 4) → (6, 4) → (6, 0), with the second player winning. Or, in another game, it can be represented as (5, 3) → (8, 3) → (8, 1) → (9, 1) → (9, 0), with the second player winning. For any situation (a, b), what conditions should a and b meet for the first player to win; what conditions should a and b meet for the second player to win; what conditions should a and b meet for (a, b) to be a "singular situation"? (Analyze the relationship between a and b)

$$ \\ $$There is a widely circulated number game among the people called "Making Zero". The rules of a simplified version of the game are as follows: Two players, A and B, each extend one hand. At the beginning, both players use this hand to represent a number (each number is an integer from 1 to 9 and can be chosen arbitrarily) as the initial state. Then, one side is chosen as the first player, who uses his hand to touch the other player's hand. The number represented by his hand is changed to the sum of "the number originally represented by his hand" and "the number represented by the other player's hand", and only the units digit is kept as the new number, while the other player's number remains unchanged. Subsequently, the other side repeats this process. Generally, the game continues until one side "makes zero", at which point that side is declared the winner. Specifically, if after several rounds, neither side can "make zero", that is, the situation enters a "dead loop", we call this situation a "singular situation". For example, if the initial states of A and B are "2" and "4" respectively, and A is the first player, after one round, A and B become "6" and "4", and after another round, they become "6" and "0". At this point, B "makes zero" and wins. We can represent any situation formed by both sides at any moment in the game as an ordered array (a, b), which means: at this moment, the number represented by the first player's hand is a, and the number represented by the second player's hand is b. For example, in the previous example, the game process can be represented as (2, 4) → (6, 4) → (6, 0), with the second player winning. Or, in another game, it can be represented as (5, 3) → (8, 3) → (8, 1) → (9, 1) → (9, 0), with the second player winning. For any situation (a, b), what conditions should a and b meet for the first player to win; what conditions should a and b meet for the second player to win; what conditions should a and b meet for (a, b) to be a "singular situation"? (Analyze the relationship between a and b)

Question Number 221060 Answers: 1 Comments: 0

Please what’s TSA of a frustrum of a cone? Any easy method?

Question Number 221057 Answers: 2 Comments: 1