Search is not available for this dataset
url
string | text
string | date
timestamp[s] | meta
dict |
---|---|---|---|
https://gmatclub.com/forum/each-of-60-cars-is-parked-in-one-of-three-empty-parking-lots-306824.html | GMAT Question of the Day: Daily via email | Daily via Instagram New to GMAT Club? Watch this Video
It is currently 27 Jan 2020, 20:38
### GMAT Club Daily Prep
#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
we will pick new questions that match your level based on your Timer History
Track
every week, we’ll send you an estimated GMAT score based on your performance
Practice
Pays
we will pick new questions that match your level based on your Timer History
# Each of 60 cars is parked in one of three empty parking lots
Author Message
TAGS:
### Hide Tags
EMPOWERgmat Instructor
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 15994
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Each of 60 cars is parked in one of three empty parking lots [#permalink]
### Show Tags
30 Sep 2019, 20:27
00:00
Difficulty:
15% (low)
Question Stats:
89% (01:53) correct 11% (01:27) wrong based on 62 sessions
### HideShow timer Statistics
EMPOWERgmat PS Series:
Block 1, Question 5
Each of 60 cars is parked in one of three empty parking lots. After all of the cars have been parked, the largest lot holds 8 more cars than the middle lot and 16 more cars than the smallest lot. How many cars are in the largest lot?
A. 12
B. 20
C. 22
D. 28
E. 30
48 Hour Window To Win An $85 EMPOWERgmat Tuition Credit (1 Month Free!) Share your explanation! The GMAT Club member with the most verified Kudos in total on the 5 question SC Block 1 question pack will win an$85 EMPOWERgmat tuition credit, which will entitle the winner to a full month of complete access to the EMPOWERgmat system. Even if you're not sure about your answer or your rationale, share your explanation to help boost your learning and earn a chance to win.
To be eligible, your explanation must be submitted within the 48 hour window after this post was created and should explain your reasoning why the answer you chose is correct
The OA and official explanation will be held until the 48 hour window has lapsed.
_________________
Contact Rich at: [email protected]
The Course Used By GMAT Club Moderators To Earn 750+
souvik101990 Score: 760 Q50 V42 ★★★★★
ENGRTOMBA2018 Score: 750 Q49 V44 ★★★★★
VP
Joined: 20 Jul 2017
Posts: 1266
Location: India
Concentration: Entrepreneurship, Marketing
WE: Education (Education)
Re: Each of 60 cars is parked in one of three empty parking lots [#permalink]
### Show Tags
30 Sep 2019, 20:43
1
2
EMPOWERgmatRichC wrote:
EMPOWERgmat PS Series:
Block 1, Question 5
Each of 60 cars is parked in one of three empty parking lots. After all of the cars have been parked, the largest lot holds 8 more cars than the middle lot and 16 more cars than the smallest lot. How many cars are in the largest lot?
A. 12
B. 20
C. 22
D. 28
E. 30
48 Hour Window To Win An $85 EMPOWERgmat Tuition Credit (1 Month Free!) Share your explanation! The GMAT Club member with the most verified Kudos in total on the 5 question SC Block 1 question pack will win an$85 EMPOWERgmat tuition credit, which will entitle the winner to a full month of complete access to the EMPOWERgmat system. Even if you're not sure about your answer or your rationale, share your explanation to help boost your learning and earn a chance to win.
To be eligible, your explanation must be submitted within the 48 hour window after this post was created and should explain your reasoning why the answer you chose is correct
The OA and official explanation will be held until the 48 hour window has lapsed.
Let the number of cars parked in largest lot = x
--> Middle lot = x - 8 & Smallest lot = x - 16
So, x + (x - 8) + (x - 16) = 60
--> 3x - 24 = 60
--> 3x = 84
--> x = 28
IMO Option D
Senior Manager
Joined: 28 Feb 2014
Posts: 280
Location: India
GMAT 1: 570 Q49 V20
GPA: 3.97
WE: Engineering (Education)
Re: Each of 60 cars is parked in one of three empty parking lots [#permalink]
### Show Tags
30 Sep 2019, 21:25
1
EMPOWERgmatRichC wrote:
EMPOWERgmat PS Series:
Block 1, Question 5
Each of 60 cars is parked in one of three empty parking lots. After all of the cars have been parked, the largest lot holds 8 more cars than the middle lot and 16 more cars than the smallest lot. How many cars are in the largest lot?
A. 12
B. 20
C. 22
D. 28
E. 30
let a,b,c be lot size in ascending order
a+b+c=60
c=b+8
c=a+16
Substituting
c-16+c-8+c=60
c = 28
D is correct
Intern
Joined: 09 Jul 2018
Posts: 12
Re: Each of 60 cars is parked in one of three empty parking lots [#permalink]
### Show Tags
02 Oct 2019, 16:42
1
Let the number of cars parked in largest lot = L
Middle lot = M & Smallest lot = S
But M=L-8 & S=L-16
So, L + (L - 8) + (L - 16) = 60
3L - 24 = 60
3L = 84
L = 28
IMO Option D
EMPOWERgmat Instructor
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 15994
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: Each of 60 cars is parked in one of three empty parking lots [#permalink]
### Show Tags
03 Oct 2019, 11:34
OFFICIAL EXPLANATION
Hi All,
We're told that each of 60 cars is parked in one of three empty parking lots. After all of the cars have been parked, the largest lot holds 8 more cars than the middle lot and 16 more cars than the smallest lot. We're asked for the number of cars that are in the LARGEST lot. This is an example of a 'System' question; it can be solved Algebraically, but it can also be solved rather quickly by TESTing THE ANSWERS...
Based on the information that we're given, the three parking lots clearly each end up holding a different number of cars. We're asked for the LARGEST number of the three, so we should look to TEST one of the larger answers first. Let's TEST Answer D...
IF....the largest lot holds 28 cars....
then the middle lot holds 28 - 8 = 20 cars...
and the smallest lot holds 28 - 16 = 12 cars...
Total = 28 + 20 + 12 = 60 cars
This is an exact MATCH for what we were told, so this MUST be the answer!
GMAT assassins aren't born, they're made,
Rich
_________________
Contact Rich at: [email protected]
The Course Used By GMAT Club Moderators To Earn 750+
souvik101990 Score: 760 Q50 V42 ★★★★★
ENGRTOMBA2018 Score: 750 Q49 V44 ★★★★★
GMAT Club Legend
Joined: 12 Sep 2015
Posts: 4234
Re: Each of 60 cars is parked in one of three empty parking lots [#permalink]
### Show Tags
03 Oct 2019, 12:39
Top Contributor
EMPOWERgmatRichC wrote:
EMPOWERgmat PS Series:
Block 1, Question 5
Each of 60 cars is parked in one of three empty parking lots. After all of the cars have been parked, the largest lot holds 8 more cars than the middle lot and 16 more cars than the smallest lot. How many cars are in the largest lot?
A. 12
B. 20
C. 22
D. 28
E. 30
Let x = number of cars in the LARGEST lot
Given: the largest lot holds 8 more cars than the middle lot.
So, x - 8 = number of cars in the MIDDLE lot
Given: the largest lot holds 16 more cars than the smallest lot.
So, x - 16 = number of cars in the SMALLEST lot
Given: Each of 60 cars is parked in one of three empty parking lots.
We can write: (# of cars in LARGEST lot) + (# of cars in MIDDLE lot) + (# of cars in SMALLEST lot) = 60
Substitute values: (x) + (x - 8) + (x - 16) = 60
Simplify: 3x - 24 = 60
Add 24 to both sides: 3x = 84
Divide both sides by 3: x = 28
Cheers,
Brent
_________________
Test confidently with gmatprepnow.com
Senior Manager
Joined: 05 Jul 2018
Posts: 459
Location: India
Concentration: General Management, Technology
GMAT 1: 600 Q47 V26
GRE 1: Q162 V149
GPA: 3.6
WE: Information Technology (Consulting)
Re: Each of 60 cars is parked in one of three empty parking lots [#permalink]
### Show Tags
10 Oct 2019, 22:39
1
The 3 slots A + B + C total to 60 cars
The highest slot C has 8 more than B and 16 more than A
Let us look at the second-largest answer choice which says C=28
As per question A=12 (16 less than C), B=20(8 less than C) ...This gives a total of 60. Hence Correct answer is D
EMPOWERgmatRichC: This is the correct way to do TTA ...right
EMPOWERgmat Instructor
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 15994
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: Each of 60 cars is parked in one of three empty parking lots [#permalink]
### Show Tags
11 Oct 2019, 11:30
Hi saukrit,
YES - that's a perfect use of TEST THE ANSWERS. In these sorts of situations, that Tactic (and some basic Arithmetic) is almost always faster and easier that a typical Algebraic approach - so it's something to keep in mind (especially if you have a pacing problem in the Quant section).
GMAT assassins aren't born, they're made,
Rich
_________________
Contact Rich at: [email protected]
The Course Used By GMAT Club Moderators To Earn 750+
souvik101990 Score: 760 Q50 V42 ★★★★★
ENGRTOMBA2018 Score: 750 Q49 V44 ★★★★★
Board of Directors
Status: QA & VA Forum Moderator
Joined: 11 Jun 2011
Posts: 4868
Location: India
GPA: 3.5
Re: Each of 60 cars is parked in one of three empty parking lots [#permalink]
### Show Tags
12 Oct 2019, 00:09
EMPOWERgmatRichC wrote:
EMPOWERgmat PS Series:
Block 1, Question 5
Each of 60 cars is parked in one of three empty parking lots. After all of the cars have been parked, the largest lot holds 8 more cars than the middle lot and 16 more cars than the smallest lot. How many cars are in the largest lot?
A. 12
B. 20
C. 22
D. 28
E. 30
48 Hour Window To Win An $85 EMPOWERgmat Tuition Credit (1 Month Free!) Share your explanation! The GMAT Club member with the most verified Kudos in total on the 5 question SC Block 1 question pack will win an$85 EMPOWERgmat tuition credit, which will entitle the winner to a full month of complete access to the EMPOWERgmat system. Even if you're not sure about your answer or your rationale, share your explanation to help boost your learning and earn a chance to win.
To be eligible, your explanation must be submitted within the 48 hour window after this post was created and should explain your reasoning why the answer you chose is correct
The OA and official explanation will be held until the 48 hour window has lapsed.
$$L = M + 8 = S + 16$$
Again , L + M + S = 60
Now, Plug in the options and check
(A) Can be straightaway rejected as value of L must be > 16 , Since in this case if L = 12 = S + 16 , Or, S = - 4 ( Not Possible )
(B) If L = 20 , M = 12 & S = 4 , L + M + S = 36
(C) If L = 22 , M = 14 & S = 6 , L + M + S = 42
(D) If L = 28 , M = 20 & S = 12 , L + M + S = 60
(E) If L = 30 , M = 22 & S = 14 , L + M + S = 66
_________________
Thanks and Regards
Abhishek....
PLEASE FOLLOW THE RULES FOR POSTING IN QA AND VA FORUM AND USE SEARCH FUNCTION BEFORE POSTING NEW QUESTIONS
How to use Search Function in GMAT Club | Rules for Posting in QA forum | Writing Mathematical Formulas |Rules for Posting in VA forum | Request Expert's Reply ( VA Forum Only )
Intern
Joined: 06 Sep 2019
Posts: 2
Each of 60 cars is parked in one of three empty parking lots [#permalink]
### Show Tags
12 Oct 2019, 01:42
As the middle lot has 8 cars less than the larger it would be X-8
Smaller Lot is having 16 cars less than the larger that means X-16
As all the lots together having 60 it would be X+(X-8)+(X-16)=60
On solving this it becomes X= 28 Cars
Hence Option D would be apt.
Each of 60 cars is parked in one of three empty parking lots [#permalink] 12 Oct 2019, 01:42
Display posts from previous: Sort by | 2020-01-28T03:38:21 | {
"domain": "gmatclub.com",
"url": "https://gmatclub.com/forum/each-of-60-cars-is-parked-in-one-of-three-empty-parking-lots-306824.html",
"openwebmath_score": 0.2563014328479767,
"openwebmath_perplexity": 3974.236522246419,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. Yes\n2. Yes",
"lm_q1_score": 0.9759464499040092,
"lm_q2_score": 0.8856314723088733,
"lm_q1q2_score": 0.8643288913231058
} |
https://math.stackexchange.com/questions/903613/fibonacci-sequence-given-n-and-mathrmfibn-is-it-possible-to-calculate | # Fibonacci sequence: Given $n$ and $\mathrm{Fib}(n)$, is it possible to calculate $\mathrm{Fib}(n-1)$?
Given $n$ and $\newcommand{\Fib}{\mathrm{Fib}} \Fib(n)$, is it possible to calculate the previous number in the Fibonacci sequence - $\Fib(n-1)$ using integer math in constant time? In other words, I believe I'm looking for a closed form formula.
For example: Given $n=10$ and $\Fib(10)=55$, I'd like to determine that $\Fib(9)=34$ without using $\Fib(7) + \Fib(8)$.
• Even output of $F_{n-1}$ cannot be done in constant time. (The length of binary representation of $F_{n-1}$ is linear in $n$.) But based on the wording in original post I would guess that you mean using constantly many operations with integers. Aug 20 '14 at 8:14
• @Martin Sleziak - you are correct that I meant "constantly many operations with integers" Aug 20 '14 at 13:23
By Binet's Formula, we know that $$F_n = \dfrac{1}{\sqrt{5}}\left(\phi^n-(-\phi)^{-n}\right) \approx \dfrac{1}{\sqrt{5}}\phi^n$$ where $$\phi = \dfrac{1+\sqrt{5}}{2}$$.
Using this formula, we can get that $$F_{n-1}$$ is the nearest integer to $$\dfrac{1}{\phi} F_n$$ for large $$n$$
More rigorously, we have $$F_{n-1} - \dfrac{1}{\phi} F_n = \dfrac{1}{\sqrt{5}}\left(\phi^{n-1}-(-\phi)^{-(n-1)}\right) - \dfrac{1}{\phi\sqrt{5}}\left(\phi^n-(-\phi)^{-n}\right)$$ $$= -\dfrac{(-\phi)^{-(n-1)}}{\sqrt{5}} - \dfrac{(-\phi)^{-(n+1)}}{\sqrt{5}}$$ $$= \dfrac{(-\phi)^{-n}}{\sqrt{5}}\left(\phi + \phi^{-1}\right) = (-\phi)^{-n}$$.
Thus, for $$n \ge 2$$, we have $$\left|F_{n-1} - \dfrac{1}{\phi} F_n \right| = \phi^{-n} < \frac{1}{2}$$, and so, $$F_{n-1}$$ is the nearest integer to $$\dfrac{1}{\phi}F_n$$.
Dividing $$F_n$$ by $$\phi$$ and rounding the result to the nearest integer shouldn't be too computational.
• Here is a table that shows the pattern:$$\begin{array} {c|c|c} n & a_n & a_n / a_{n-1} \\ \hline 0 & 0 & \\ \hline 1 & 1 & \\ \hline 2 & 1 & 1.0000 \\ \hline 3 & 2 & 2.0000 \\ \hline 4 & 3 & 1.5000 \\ \hline 5 & 5 & 1.6667 \\ \hline 6 & 8 & 1.6000 \\ \hline 7 & 13 & 1.6250 \\ \hline 8 & 21 & 1.6154 \\ \hline 9 & 34 & 1.6190 \\ \hline 10 & 55 & 1.6176 \\ \hline 11 & 89 & 1.6182 \\ \hline 12 & 144 & 1.6180 \\ \hline 13 & 233 & 1.6181 \\ \hline 14 & 377 & 1.6180 \\ \hline \end{array}$$ Aug 20 '14 at 2:25
• @DanielV - agreed, this will work but as marty cohen points out in his anti-answer below, for large values of n simply rounding to the nearest integer will not necessarily yield the correct answer. Aug 20 '14 at 13:34
This is a dissenting note on some of these answers. I am purposly making this an answer, though it really is an anti-answer.
The problem with any answer that uses $\phi$ is that, as $n$ gets larger, $\phi$ has to be computed with increasingly great precision. This will not take constant time, either for the computation of $\phi$ or the multiplication by $\phi$.
Hint $\rm\ n\:$ is a Fibonacci number iff the interval $\rm\ [\phi\ n - 1/n,\ \phi\ n + 1/n]\$ contains a positive integer (the next Fibonacci number for $\rm\ n > 1)$. This follows from basic properties of continued fractions.
For example, $\rm\ 2 \to [2.7,\ 3.7],\ \ 3\to [4.5,\ 5.2],\ \ 5 \to [7.9,\ 8.3]\ \ldots$
For a proof see e.g. T. Komatsu: The interval associated with a fibonacci number. $\$ | 2022-01-29T02:15:37 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/903613/fibonacci-sequence-given-n-and-mathrmfibn-is-it-possible-to-calculate",
"openwebmath_score": 0.9017306566238403,
"openwebmath_perplexity": 180.5184766596439,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9759464453565514,
"lm_q2_score": 0.8856314723088732,
"lm_q1q2_score": 0.8643288872957339
} |
http://mathhelpforum.com/algebra/70782-geometric-series-problem.html | # Thread: Geometric series problem .
1. ## Geometric series problem .
A house buyer borrows RM 50000 from a bank to buy a house which costs RM 70000 .The rate of interest charged by the bank is 9% per annum ,and is calculated based on the amount outstanding at the begining of each year . The house buyer is required to repay his loan in monthly installments for a period of 15 years . Assuming that the rate of interest is fixed for the entire duration of the loan , find the amount per month he has to repay the bank ?
My attempt :
It forms a sequence as follows :
$\displaystyle 50000,50000(1.09),50000(1.09)^2,...,50000(1.09)^{n-1}$
The 15th term , $\displaystyle T_15=50000(1.09)^14=167086.35$
which is the amount he has to pay by the end of 15 years .
Thus , every month he has to pay $\displaystyle \frac{167086.35}{15\times12}=928.26$
My answer is obviously wrong . I wonder where my mistake is .. Thanks to the one who help me out ..
2. ## Repayments
Originally Posted by mathaddict
A house buyer borrows RM 50000 from a bank to buy a house which costs RM 70000 .The rate of interest charged by the bank is 9% per annum ,and is calculated based on the amount outstanding at the begining of each year . The house buyer is required to repay his loan in monthly installments for a period of 15 years . Assuming that the rate of interest is fixed for the entire duration of the loan , find the amount per month he has to repay the bank ?
My attempt :
It forms a sequence as follows :
$\displaystyle 50000,50000(1.09),50000(1.09)^2,...,50000(1.09)^{n-1}$
The 15th term , $\displaystyle T_15=50000(1.09)^14=167086.35$
which is the amount he has to pay by the end of 15 years .
Thus , every month he has to pay $\displaystyle \frac{167086.35}{15\times12}=928.26$
My answer is obviously wrong . I wonder where my mistake is .. Thanks to the one who help me out ..
Thanks for showing us your working here. What you're forgetting is that
each year he pays not only the interest owing that year, but he also pays back some of the amount borrowed.
Are you allowed to use a spreadsheet to work out this answer? It's the easiest way.
If not, you'll have to let the monthly payment be x, and then say that, at the start of each new year, the amount owing
= amount owed at the start of the last year + interest payable during that year - 12x
Then work out how much interest he'll have to pay in the coming year to cover this new amount owing. Then repeat for the following year, and so on, up to the start of year 16. Then say that at the start of year 16 he owes nothing.
This is an Amortization problem and requires a special formula.
I've seen this type of problem posted many times before.
It seem that the students are never given the formula,
. . nor are they prepared for the (very) long derivation.
Could it be that all those teachers are ignorant of the difficulties
. . involved with time-payment problems?
I'm beginning to suspect that this is so . . .
A house buyer borrows $50,000 from a bank to buy a house. The rate of interest 9% per annum. The buyer is required to repay his loan in monthly installments for 15 years. Assuming that the rate of interest is fixed for the entire duration of the loan, find the amount per month he has to repay the bank? The formula is: .$\displaystyle A \;=\;P\,\frac{i(1+i)^n}{(1+i)^n-1}$. . where: .$\displaystyle \begin{Bmatrix}P &=& \text{principal} \\ i &=& \text{periodic interst rate} \\ n &=& \text{number of periods} \\ A &=& \text{periodic payment} \end{Bmatrix}$We have: .$\displaystyle \begin{array}{ccc}P \:=\:50,\!000 \\
i \:=\:\frac{9\%}{12} \:=\:0.0075 \\ n \:=\:15\!\cdot\!12 \:=\:180 \end{array}$Hence: .$\displaystyle A \;=\;50,\!000\,\frac{0.0075(1.0075)^{180}}{1.0075^ {180}-1} \;=\;507.1332921$Therefore, the monthly payment is: .$\displaystyle \boxed{\$507.13}$
4. ## Re :
Very big thank you to both of you !!! Soroban , just out of curioscity , how did the formula come or perhaps where did it come from ?
5. Originally Posted by mathaddict
Very big thank you to both of you !!! Soroban , just out of curioscity , how did the formula come or perhaps where did it come from ?
Check this and especially this out. It is one way of deriving it. There are or course other ways.
Go through page 70 up to page 99.
Or you can just order this book if get tired of reading it online.
6. ## Repayments
In fact, the interest is calculated at the start of each year for the whole year, as if the whole amount is owing for the whole year. So you have to use the values
P = 50000
i = 0.09
n = 15
to get the total payment each year, and then divide by 12, to get a monthly payment of 516.91.
Incidentally, I don't think it's really that hard to work out the formula for yourself. After
$\displaystyle n$ years you'll find that the amount owing is
$\displaystyle P(1+i)^n - [1 + (1+i) + (1+i)^2 + ... + (1+i)^{n-1}]x$, where $\displaystyle x$ is the annual payment
Inside the square brackets, it's a GP whose sum is
$\displaystyle \frac{(1+i)^n - 1}{i}$
Set this sum equal to zero and solve for
$\displaystyle x$ to obtain the formula.
7. Thanks all but i am having some problems with the series .
[tex] [1 + (1+i) + (1+i)^2 + ... + (1+i)^{n-1}]x[/math
$\displaystyle T_1=x$
$\displaystyle T_2=xi+x=x(1+i)$
$\displaystyle T_3=[x(1+i)]\cdot{i}+x$ but this is not equal to $\displaystyle x(1+i)^2$
Why is it so ??
8. ## GP
Originally Posted by mathaddict
Thanks all but i am having some problems with the series .
[tex] [1 + (1+i) + (1+i)^2 + ... + (1+i)^{n-1}]x[/math
$\displaystyle T_1=x$
$\displaystyle T_2=xi+x=x(1+i)$
$\displaystyle T_3=[x(1+i)]\cdot{i}+x$ but this is not equal to $\displaystyle x(1+i)^2$
Why is it so ??
Set your working out like this:
At the end of year 1, the amount owed is the original sum borrowed + the interest for the year - the total payments during the year
$\displaystyle = P + Pi - x$
$\displaystyle = P(1 + i) - x$
This, then is the amount owing at the start of year 2: the 'new $\displaystyle P$' if you like. So at the end of year 2, we'll replace $\displaystyle P$ by $\displaystyle P(1+i) - x$, to get that the amount owing is:
$\displaystyle [P(1 +i) - x](1+i) - x$
$\displaystyle = P(1+i)^2 - x[1 + (1 + i)]$
Continue like this, multiplying by $\displaystyle (1+i)$ and subtracting $\displaystyle x$ each time. So at the end of the year 3, the amount owing is:
$\displaystyle P(1+i)^3 - x[1 + (1 + i) + (1 +i)^2]$
And, in a similar way, at the end of year $\displaystyle n$, it is:
$\displaystyle P(1+i)^n - x[1 + (1 + i) + ...+ (1 +i)^{n-1}]$
So, inside the square brackets, [...], we have a GP whose first term is $\displaystyle 1$, common ratio $\displaystyle (1+i)$ and number of terms = $\displaystyle n$, and whose sum is $\displaystyle \frac{(1+i)^n - 1}{(1+i) - 1}= \frac{(1+i)^n - 1}{i}$.
Now if the whole sum is paid of after $\displaystyle n$ years, this total is zero. I.e.
$\displaystyle P(1+i)^n - x\frac{(1+i)^n - 1}{i} = 0$
Hence $\displaystyle x = \frac{iP(1+i)^n}{(1+i)^n - 1}$
OK now? | 2018-03-25T05:42:55 | {
"domain": "mathhelpforum.com",
"url": "http://mathhelpforum.com/algebra/70782-geometric-series-problem.html",
"openwebmath_score": 0.9452170133590698,
"openwebmath_perplexity": 1966.3116111501001,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9759464429079201,
"lm_q2_score": 0.885631470799559,
"lm_q1q2_score": 0.8643288836541391
} |
https://math.stackexchange.com/questions/868400/showing-that-y-has-a-uniform-distribution-if-y-fx-where-f-is-the-cdf-of-contin/868405 | # Showing that Y has a uniform distribution if Y=F(X) where F is the cdf of continuous X
Let $$X$$ be a random variable with a continuous and strictly increasing c.d.f. $$F$$ (so that the quantile function $$F^{−1}$$ is well-defined). Define a new random variable $$Y$$ by $$Y = F(X)$$. Show that $$Y$$ follows a uniform distribution on the interval $$[0, 1]$$.
My initial thought is that $$Y$$ is distributed on the interval $$[0,1]$$ because this is the range of $$F$$. But how do you show that it is uniform?
• This is not true in cases where there's a discrete component. For example, suppose $X=\left.\begin{cases} 1/2 & \text{with probability }1/2, \\ W & \text{with probability }1/2,\end{cases}\right\}$ and $W$ is uniformly distributed on $[0,1]$, and that the choice between whether $X=1/2$ or not is independent of $W$. Then the cdf of $X$ has no values between $1/4$ and $3/4$, so it cannot be uniformly distributed on $[0,1]$. It is, however, true of continuous distributions. Jul 15, 2014 at 21:41
• see the text of the question. X is continuous! Jul 15, 2014 at 21:44
• By the way, it is not necessary that $F$ is a strictly increasing CDF, continuity is sufficient. Just define the quantile function the usual way as a generalized inverse via $F^-(y)=inf\{x\in\mathbb{R}: F(x)\geq y\}$. See the proof of Proposition 3.1 in Embrechts, P., Hofert, M.: A note on generalized inverses. Mathematical Methods of Operations Research 77(3), 423-432 link for a very careful and detailed explanation. Jul 16, 2014 at 14:38
• Thanks @binkyhorse - that reference is really good. Apr 5, 2015 at 22:33
• @s0ulr3aper07 By Proposition 3.1 in the paper I linked above, yes. Prop. 3.1: Let F be a distribution function and X ~ F. (a) If F is continuous, F(X)∼U[0,1]. The paper includes a detailed proof. Mar 27, 2019 at 20:10
Let $F_Y(y)$ be the CDF of $Y = F(X)$. Then, for any $y \in [0,1]$ we have:
$F_Y(y) = \Pr[Y \le y] = \Pr[F(X) \le y] = \Pr[X \le F^{-1}(y)] = F(F^{-1}(y)) = y$.
What distribution has this CDF?
• Are all CDF's of continuous densities invertible? Aug 22, 2017 at 7:43
• @tintinthong: not always completely, but enough. If you define $G(y)= \inf\{x:F_X(x) \ge y\}$ then $F_X(G(y))=y$ when $y \in (0,1)$ Aug 22, 2017 at 22:12
• Strictly increasing and continuous CDF is needed. Feb 20, 2019 at 15:36
$$Prob(Y\leq x)=P(F(X)\leq x)=P(X\leq F^{-1}(x))=x \\$$ The last equality is from the definition of the quantile function.
Let $y=g(x)$ be a mapping of the random variable $x$ distributed according to $f(x)$. In the mapping $y=g(x)$ you preserve the condition of probability density (namely you counts the same number of events in the respective bins)
$$h(y)dy=f(x)dx$$
where h(y) is the probability distribution of $y$
if $h(y)=1$ (uniform distribution) we have
$$dy=g'(x)dx=f(x)dx$$
This means that $$g(x)=\int f(x)dx$$
namely the function $g(x)$ that maps the random variable $x$ distributed according $f(x)$, into a random variable $y$ distributed uniformly is his own cumulative distribution function $\int f(x) dx$.
Here is an approach that does not use the quantile function whatsoever - the only property used is that independent copies of $$X$$ have zero probability of being equal. (The main ingredient in my argument is conditional expectation.)
Consider the cumulative distribution function of $$X$$, namely $$F(t)=\mathbb P(X\leq t).$$ Your random variable - which I will suggestively call $$U$$ instead of $$Y$$ - can be described by starting with two independent and identically distributed random variables $$X,Z$$ and considering the conditional probability $$U=\mathbb P(X\leq Z\mid Z).$$ Then, for all integers $$n\geq 1$$, we can represent $$U^n$$ as follows. Let $$X_1,X_2,\ldots,X_n,Z$$ be independent and identically distributed. By independence, $$\mathbb P\bigl(X_1\leq Z,X_2\leq Z,\ldots, X_n\leq Z\bigm\vert Z\bigr)=U^n,$$ and thus by the tower property $$\mathbb EU^n=\mathbb P(X_1\leq Z,X_2\leq Z,\ldots, X_n\leq Z)=\mathbb P\bigl(Z=\max(X_1,X_2,\ldots,X_n,Z)\bigr).$$ Since $$X_1,\ldots,X_n,Z$$ are iid, each of them is equally likely to be the maximum and therefore $$\mathbb EU^n=\frac{1}{n+1}.$$ Thus $$U$$ has the same moments as a uniformly distributed random variable on $$[0,1]$$. Since $$U$$ is supported in $$[0,1]$$ as well, it follows (by the uniqueness of the Hausdorff moment problem) that $$U$$ is uniformly distributed, as desired.
Let $$y\in(0,1)$$. Since $$F$$ is continuous, there exists $$x\in\mathbb{R}$$ s.t. $$F(x)=y$$. Thus, $$\mathsf{P}(Y\le y)=\mathsf{P}(F(X)\le F(x))=F(x)=y,$$ i.e., $$Y\sim\text{U}[0,1]$$. In order to see the first equality we don't need continuity. Specifically, since any cdf is right-continuous, \begin{align} \{F(X)\le F(x)\}&=\{\{F(X)\le F(x)\}\cap\{X\le x\}\}\cup \{\{F(X)\le F(x)\}\cap\{X>x\}\} \\ &=\{X\le x\}\cup \{\{F(X)=F(x)\}\cap\{X>x\}\}, \end{align} and $$\mathsf{P}(\{F(X)=F(x)\}\cap\{X>x\})=0$$.
For a proof of this problem when $$F_X(x)$$ is strictly increasing, refer to JimmyK4542's answer. Let's assume $$F_X(x)$$ is just non-decreasing (there are intervals such as $$[a,b]$$ where $$F_X(x') = c$$ for $$x'\in[a,b]$$). We define $$G(y)$$ similar to what Henry's comment suggests: $$G(y)=\inf\{x:F_X(x)\gt y\}$$ Now substituting this expression in what Jimmy has written will give us: $$F_Y(y) = \Pr[Y \le y] = \Pr[F_X(X) \le y] = \Pr[X \le G(y)] = F_X(G(y))= y \label{eq:I}\tag{I}$$
We need to show that:
1. $$F_X(x)\le y \rightarrow x \le G(y)$$
2. $$F_X(G(y))=y$$
The second argument is easier to prove. We have the following expression almost according to definitions: $$F_X(G(y))= F_X(\inf\{x:F_X(x)\gt y\})= y$$ Now for the first argument, we can still use what $$G(y)=\inf\{\cdots\}$$ implies; if $$F_X(x)\le y$$, then $$x\le \inf\{x:F_X(x)\gt y\};$$ hence $$x\le G(y)$$.
With the two arguments proved and a substitution in \ref{eq:I}, we have proved the main argument.
• I personally believe this problem is a severe case for abuse of notation, and a bad professor's problem. Feb 19 at 1:46 | 2022-06-30T14:40:05 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/868400/showing-that-y-has-a-uniform-distribution-if-y-fx-where-f-is-the-cdf-of-contin/868405",
"openwebmath_score": 0.957176685333252,
"openwebmath_perplexity": 174.14235605365812,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9759464443071381,
"lm_q2_score": 0.8856314617436727,
"lm_q1q2_score": 0.8643288760552705
} |
https://web2.0calc.com/questions/what-is-the-probability-of-winning-a-lottery-which-requires-selection-of-5-numbers-from1-to-40 | +0
# what is the probability of winning a lottery which requires selection of 5 numbers from1 to 40
0
895
7
what is the probability of winning a lottery which requires selection of 5 numbers from1 to 40
May 7, 2014
#2
+17
+8
Calculate the numerator: There is only one winning combination. So the numerator of the desired probability is 1. Calculate the denominator: There are "40 numbers, choose 5", or 40C5 possible combinations. So the denominator of the desired probability is 40C5. So the probability is 1/40C5=1/658008
May 7, 2014
#1
+1006
0
For this kind of probability problem, assuming the number is removed from play once chosen, the probability increases by one each time.
$$\left({\frac{{\mathtt{1}}}{{\mathtt{40}}}}\right){\mathtt{\,\times\,}}\left({\frac{{\mathtt{1}}}{{\mathtt{39}}}}\right){\mathtt{\,\times\,}}\left({\frac{{\mathtt{1}}}{{\mathtt{38}}}}\right){\mathtt{\,\times\,}}\left({\frac{{\mathtt{1}}}{{\mathtt{37}}}}\right){\mathtt{\,\times\,}}\left({\frac{{\mathtt{1}}}{{\mathtt{36}}}}\right)$$
The bottom five numbers multiply to 78960960, which means that the odds are 1/78960960
May 7, 2014
#2
+17
+8
Calculate the numerator: There is only one winning combination. So the numerator of the desired probability is 1. Calculate the denominator: There are "40 numbers, choose 5", or 40C5 possible combinations. So the denominator of the desired probability is 40C5. So the probability is 1/40C5=1/658008
FoxTears May 7, 2014
#3
+17
0
Mine was assuming the numbers can be reused
May 7, 2014
#4
+115418
+5
The number of 5 digit combinations (order doesn't matter) from 40 is
40C5
$${\left({\frac{{\mathtt{40}}{!}}{{\mathtt{5}}{!}{\mathtt{\,\times\,}}({\mathtt{40}}{\mathtt{\,-\,}}{\mathtt{5}}){!}}}\right)} = {\mathtt{658\,008}}$$
only one of those wins so the chance is $$\frac{1}{658008}$$
Just like FoxTears said!
Thanks Foxtears.
Foxtears, I don't think that yours was assuming that the numbers could be reused.
It was just assuming that the order they were chosen in was of no consequence.
GoldenLeaf I believe yours would have been correct if the numbers had to be chosen in a specific order.
May 7, 2014
#5
+32772
+5
GoldenLeaf's approach was almost right, but he should have had 5, 4, 3, 2 and 1 in the numerators.
There are 5 possible choices for the first number, so probability of this is 5/40. For each of these
there are 4 possible choices for the 2nd number, so probability of both 1st and 2nd is (5/40)*(4/39). For each of these ... etc. to get the overall probability as
$${\mathtt{p}} = \left({\frac{{\mathtt{5}}}{{\mathtt{40}}}}\right){\mathtt{\,\times\,}}\left({\frac{{\mathtt{4}}}{{\mathtt{39}}}}\right){\mathtt{\,\times\,}}\left({\frac{{\mathtt{3}}}{{\mathtt{38}}}}\right){\mathtt{\,\times\,}}\left({\frac{{\mathtt{2}}}{{\mathtt{37}}}}\right){\mathtt{\,\times\,}}\left({\frac{{\mathtt{1}}}{{\mathtt{36}}}}\right) \Rightarrow {\mathtt{p}} = {\mathtt{0.000\: \!001\: \!519\: \!738\: \!361\: \!8}}$$
or p≈1.52*10-6
1/p = 658008
May 7, 2014
#6
+115418
0
Yes of course - that did not occur to me. Thanks Alan.
May 7, 2014
#7
0
Calling Bertie, CPhill and Rom (Troll alert! General quarters!)
Along with Melody and Alan, we need input from Bertie, CPhill, and Rom, too.
With the top brains represented here that Troll might comeback and bite one or more.
I know he’ll bite FoxTears for saying, “Mine was assuming the numbers can be reused” (your formula (40C5) contradicts this).
The Troll will follow-up, by asking what is the probability of (something) of (five, six or seven) mathematicians getting a probability question correct.
Then he’ll say about the same as walking, blindfolded, through a large buffalo heard and stepping in four piles with both feet.
What’s annoying: he’s usually right.
CPhill might not be able to make it. He might be trying to get the “Roman Zero” from inside Sisyphus’s boulder.
Maybe he could take a break and visit. He’s not been around for a day or two. I hope he wasn’t squashed by the boulder.
No matter: cartoon physics seem to apply in that realm. If he does visit, maybe one of those angels will help him get the “Roman Zero.”
By: Troll Detector
May 7, 2014 | 2021-12-04T23:52:48 | {
"domain": "0calc.com",
"url": "https://web2.0calc.com/questions/what-is-the-probability-of-winning-a-lottery-which-requires-selection-of-5-numbers-from1-to-40",
"openwebmath_score": 0.9447340369224548,
"openwebmath_perplexity": 1798.8861039896221,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9888419690807408,
"lm_q2_score": 0.8740772236840656,
"lm_q1q2_score": 0.8643242429963786
} |
http://amicidellacattolica.it/rmev/sigma-notation-rules.html | Sigma, Σ, is the standard notation for writing long sums. 3n 3 + 6n 2 + 6000 = Θ(n 3). ” - Sincerely, Dr. Commented: Roger Stafford on 22 Oct 2014 Accepted Answer: Star Strider. It's based on the upper case Greek letter S, which indicates a sum. Some basic ideas can be applied to creating process maps that make them easier to understand and use. Clears 1, 5, and 12, and if you remember the old notation the cardinality of Z is 3 because there are three elements in z. See Figure 3. So for this series, there is 7 terms The seven terms are: when n=0 -2x. 2040 - 3 sig fig 2. Okay, welcome back everyone. Most of the following problems are average. "My TI 83+ graphing calculator arrived faster than I expected. Although it can appear scary if you've never seen it before, it's actually not very difficult. Sigma Notation. This is the currently selected item. Define Sigma notation. In chemistry, a molecular orbital (MO) is a mathematical function describing the wave-like behavior of an electron in a molecule. Free online converters. APPENDIX E SIGMA NOTATION A35 Theorem If is any constant (that is, it does not depend on ), then (a) (b) (c) Proof To see why these rules are true, all we have to do is write both sides in expanded form. The variable n is called the index of summation. When WeBWorK gives a typeset version of your answer it only uses parentheses so for example it expresses your input of 2 [3 (4+5)+6] as 2 (3 (4+5)+6) but you can use whatever you want. Multiplication by a whole number can be interpreted as successive addition. Example ∑ = = + + + +. 00, but has features that will be used throughout algebra, trigonometry, and statistics. To see why Rule 1 is true, let's start with the left hand side of this equation, n i=1 cx i. 5 Sigma Notation And The Nth Term Ppt Video Online Download Index Of Wp Content Uploads 2017 02 Summation Notation Problems & Solutions Sigma Notation Sigma Worksheet 7 Probability And Sigma Notation Solutions(1) Maths Sigma Notation Guided Notesmath With Mrs Holst Tpt Document 20. Rules of Scientific Notation. These rules can be converted and applied to many log management or SIEM systems and can even be used with grep on the command line. If the series is multiplied by a. This involves the Greek letter sigma, Σ. The "a i " in the above sigma notation is saying that you sum all of the values of "a". In this unit we look at ways of using sigma notation, and establish some useful rules. The Organic Chemistry Tutor 270,467 views. With sequences, sometimes we like to start at n = 0 and sometimes we like to start at n = 1. We often use Sigma Notation for infinite series. Properties. For example, the Schrodinger equation, which has to do with dynamics in quantum systems and predates quantum computation by decades, is written using bra-ket notation. The Example shows (at least for the special case where one random variable takes only. The Sigma symbol can be used all by itself to represent a generic sum… the general idea of a. When you're calculating the big O. Use algebra rules of sums, along with the appropriate sum formulae, to evaluate the following: (a) X12 i=1 (i2 33i) (b) X10 i=1 (i2 2 1) (c) X8 i=1 (2 i ) 6. 2 Summation notation Summation notation. Control Chart with all Control Limits Visible QI Macros offers the following option to turn on and off the 1-2 sigma lines: After you have run a chart, click on the QI Macros Chart menu and select Show/Hide Sigma Lines. Go To Problems & Solutions Return To Top Of Page. Use sigma (summation) notation to calculate sums and powers of integers. Sigma questions are not rehashing of questions from a text book, each question is unique and has a slight twist. 3 – A service desk process map example. Sigma notation provides a way to compactly and precisely express any sum, that is, a sequence of things that are all to be added together. Today we're going to make it a little bit more complicated, and we're going to go over some rules, For manipulating, Slash simplifying, Or making for complicated, if you like, sigma notation. Sigma Notation - Introduction to Summation 9:14. Write the expression 1 + 1 4 + 1 7 + 1 10 + + 1 3n+1 in P notation. These rules that make sense in simpler notation, such as or. Free algebra and math word problems. A business process model and notation diagram, or BPMN diagram for short, is used to build easy-to-read business process model flowcharts, which can be shared across organizations and industries. The concept of sigma notation means to sum up all terms and uses three parts to form math statements, like ∑ i a i. org are unblocked. In this unit we look at ways of using sigma notation, and establish some useful rules. A typical element of the sequence which is being summed appears to the right of the summation sign. Sigma Notation and Riemann Sums Sigma Notation: Notation and Interpretation of 12 3 14 1 n k nn k aaaaa a a (capital Greek sigma, corresponds to the letter S) indicates that we are to sum numbers of the form indicated by the general term. For example: 1. The Riemann sums and sigma notation exercise appears under the Integral calculus Math Mission. Binomial theorem refresher. Note how the subscripts in the FORTRAN example below exactly match the tensor notation for $$C_{ij} = A_{ik} B_{kj}$$. Posted 2/14/10 8:18 AM, 19 messages. Example of a Matrix. The sum of a series can be written in sigma notation. ) (Factor out the number 6 in the second summation. The example below shows three separate sets of control limits: Don't forget to rerun stability. ” D = { x: x is a river in a state} We should describe a certain property which all the elements. In this unit we look at ways of using sigma notation, and establish some useful rules. The resulting display string will be a string which has already been mapped according to the IDNA2003 rules. If you're seeing this message, it means we're having trouble loading external resources on our website. Contents 1 Algebra 8 1. As well as providing shorthand for mathematical ideas, this notation can aid students’ understanding of mathematics. Sigma notation. If , the series does not converge (it is a divergent series). If you want to use a different calculator, the TI-89 has an actual sigma (uses the greek sigma) that you enter the expression, variable, start, and stop values. Theorem: Sigma Notation Properties Suppose and are functions of , is any integer, and is any real number. It's based on the upper case Greek letter S, which indicates a sum. Question 486636: Expand and simplify. This calculus video tutorial provides a basic introduction into summation formulas and sigma notation. when n=2 6-2x. Summation rules Jochumzen. If x ≤ μ, then the pdf is undefined. Multiplication by a whole number can be interpreted as successive addition. In mathematical formula it is indeed the addition of many number or variable which represent to give concise expression for sum of the variable as Sigma or Summation. In Notes x4. Looking for Pi notation? Find out information about Pi notation. A series that converges has a finite limit, that is a number that is approached. The variable k is called the index of the sum. Okay, now that we've seen that fancy sigma notation let's work a really simple small example of numbers and then generalize. Geometric Series 1 - Cool Math has free online cool math lessons, cool math games and fun math activities. 106L Labs: Sums and Sigma ( ) Notation Sequences, Sums, and Sigma ( ) Notation Sequences De nition A sequence is an ordered set of numbers de ned by some rule. Similarly, we can use sigma notation starting at different values of n to write the same series. Question 1 Question 2 Question 3 Question 4 Question 5 Question 6 Question 7 Question 8 Question 9 Question 10. This is true for all tensor notation operations, not just this matrix dot product. 1, we de ne the integral R b a f(x)dx as a limit of approximations. Use Fault Tree diagrams to document business processes, including Six Sigma and ISO 9000. These tell us the starting. Digits 1 to 9 always count 2. But with sigma notation (sigma is the 18th letter of the Greek alphabet), the sum is much more condensed and efficient, and you’ve got to admit it looks pretty cool: This notation just tells you to plug 1 in for the i in 5i, then plug 2 into the i in 5i, then 3, then 4, and so on all the way up to 100. In this unit rules for using sigma notation are established. Re: sigma notation (without lists or tables) mravi1 welcome to the forum As pointed out, unfortunately your post does not comply with Rule 2 of our Forum RULES. Sigma notation is essentially a shortcut way to show addition of series or sequences of numbers. For example, we often wish to sum a number of terms such as 1+2+3+4+5 or 1+4+9+16+25+36 where there is an obvious pattern to the numbers involved. Example ∑ = = + + + +. After multiplying everything out I got, = E (i^3 + 15i^2 +54i) Then I broke everything down to = E i^3 + (15)*E i^2 + (54)*E i. In quantum mechanics, the uncertainty principle (also known as Heisenberg's uncertainty principle) is any of a variety of mathematical inequalities asserting a fundamental limit to the precision with which the values for certain pairs of physical quantities of a particle, such as position, x, and momentum, p, can be predicted from initial conditions. And S stands for S um. $$S^2\sigma$$ is frequently over analyzed to the point where it is incorrectly concluded that a high $$S^2\sigma$$ is preferable even at the expense of lower $$zT$$. is the symbol for the sample mean. Alternatively, we may use ellipses to write this as However, there is an even more powerful shorthand for sums known as sigma notation. Sigma Notation Properties/Rules. We prefer to use subscripts to indicate the control limits, but other texts and papers may use somewhat different notation (e. We often use Sigma Notation for infinite series. If you are in need of technical support, have a question about advertising opportunities, or have a general question, please contact us by phone or submit a message through the form below. LuDaCriS66 Platinum Member. Summation Notation. 5, which dealt with vector coordinate transformations. What we are about to do is to take a function and express it as the limit of a sequence of Riemann Sums over. Enter the sequence, the start value and end value from sigma notation and get a numerical sum. The matrix pictured below has two rows and three columns. (b) c k = 1 k, where 5 k < 9. Recall that the "n" on top of the Sigma (the funny looking e) is the terminal value for the index which is located under the sigma. Use sigma (summation) notation to calculate sums and powers of integers. The notation above is not too flexible because the start, stop, and term are all hard coded. The series always converges when x = 0 It will possibly converge for. The act or process of adding; addition. But polynomials truly come to shine in the work of Al-Samawal (1130-1180) The Shining Book on Calculation. Here, we prefer to set up the prior in terms of nu, mu, sigma/(nu-2) or something like that, to account for the fact that the scale of the distribution (as measured by the sd or median absolute deviation) depends on nu as well as sigma. So sum of n=1 to 20 for (3^n) + sum of n=1 to 20 for (2n-1) Then apply the geometric sum formula for the sum of n=1 to 20 for (3^n). We do this through a mixture of our automated migration tools and professional services offerings. It corresponds to “S” in our alphabet, and is used in mathematics to describe “summation”, the addition or sum of a bunch of terms (think of the starting sound of the word “sum”: Sssigma = Sssum). Presentación NEARPOD. Rules for use with sigma notation 6 1 c mathcentre July 18, 2005. The terminology from AMS-LaTeX documentation. So maybe it will help. mc-TY-sigma-2009-1 Sigma notation is a method used to write out a long sum in a concise way. In 1981 Dr. 1 (800) 561 5005 (Toll-free) or +1 (514) 737 7333 [email protected] Usually, this is used to describe a certain span or group of spans of numbers along a axis, such as an x-axis. A boolean expression consisting purely of Minterms (product terms) is said to be in canonical sum of products form. Summation notation In statistics we take summary measures of data sets. BPMN diagram symbols are categorized into four main groups: flow objects, connecting objects, swimlanes, and artifacts. Note: you can do this more than once on a chart. For example, cosx, cos x, and cos (x) are all equivalent. Loading Unsubscribe from Jochumzen? Summation Formulas and Sigma Notation - Calculus - Duration: 20:24. Gateways are used to control how the process flows. American Mathematical Society, User's Guide for the amsmath Package For all intents and purposes, the align environment is a replacement for the eqnarray environment and all its warts. This problem has been solved! See the answer. As we learn the basic integration rules, we will learn the difference between an indefinite integral and a definite integral. 'for' loop or symsum? Follow 163 views (last 30 days) Nate on 20 Oct 2014. Taylor series, convergence tests, power series convergence, sigma notation, factorial this page updated 19-jul-17 Mathwords: Terms and Formulas from Algebra I to Calculus. My matrix is the variable A, and my list is the variable Network. The precise addition rule to use is. Summation notation In statistics we take summary measures of data sets. Today we're going to make it a little bit more complicated, and we're going to go over some rules, For manipulating, Slash simplifying, Or making for complicated, if you like, sigma notation. Riemann sums, summation notation, and definite integral notation. Sigma notation provides a way to compactly and precisely express any sum, that is, a sequence of things that are all to be added together. com To create your new password, just click the link in the email we sent you. - Notice that we are adding fractions with a numerator of 1 and. 1) sigma notation: n=0; top of sigma = 4; to the right - (n^2/2) 2) sigma notation: n=1; top of sigma = 3; to the right - (1/n!). Binomial theorem refresher. These degenerate cases are usually only used when the summation notation gives a degenerate result in a special case. I can pull that constant outside and get that the sum from i=1 to 4 of 3i squared is the same thing as 3 times the same exact. That is indicated by the lower index of the letter. 1 - In the following exercises, use the rules for sums Ch. mc-TY-sigma-2009-1 Sigma notation is a method used to write out a long sum in a concise way. lar notation scheme can mystify the reader just as easily as a too casual (μ)forapopulationmean,sigma Now let us review the mathematical rules by which matrices are manipulated. Commented: Roger Stafford on 22 Oct 2014 Accepted Answer: Star Strider. Properties. Worksheet on sigma notation 1. These properties are easy to prove if we can write out the sums without the sigma notation. Summation notation is a useful way to represent the partial sum of a sequence. For these accounting rules, we describe the range of valuations that is consistent with the firm’s financial statements. 1 – Area, Distance, and Sigma Notation The Area Problem Our goal is to calculate the area of some region. Addition rules are important in probability. improve this answer. The double series. It corresponds to “S” in our alphabet, and is used in mathematics to describe “summation”, the addition or sum of a bunch of terms (think of the starting sound of the word “sum”: Sssigma = Sssum). Viewing 8 posts - 1 through 8 (of 8 total) Author. Constant multiplier. Note: you can do this more than once on a chart. Summation notation works according to the following rules. For more ways to implement derivatives, you may find our support article on Prime Notation helpful. Title: SUMMATION or SIGMA NOTATION 1 SUMMATION or SIGMA NOTATION 2 DEFINITIONS Sigma Notation for Finite Sums. These are called mathematical operators. Adding series. With a Six Sigma process even a significant shift in the process mean results in very few defects. For example, we can write which is a bit tedious. Six Sigma Diagram. Contents[show] Table of sum-class symbols Using sum TeX is smart enough to only show. In this unit rules for using sigma notation are established. Σ is the symbol for ‘the sum. $$\sum\limits_{i\, = \,{i_{\,0}}}^n {c{a_i}} = c\sum\limits_{i\, = \,{i_{\,0}}}^n {{a_i}}$$ where $$c$$ is any number. The most frequently appearing notation in the mathematical descriptions of different quantities or procedures used in data analysis involves the application of the summation "operator," represented by the upper-case Greek letter sigma, or. The number 100,000,000 for example, takes up a lot of room and takes time to write out, while 10 8 is much more efficient. 1 Sigma Notation ¶ Sigma notation is a convenient way to write large and complicated sums. Sigma Notation - Simplification Rules. Thus, Also the initial value doesn't have to be 1. Introduction Sigma notation is a concise and convenient way to represent long sums. Given a matrix M and a vector v, when we work out the first component of Mv, we dot the first row of M with v. You get to it through the calculus functions (f3 key in "normal" home). 00204 - 3 sig fig. If you need a quick refresher on summation notation see the review of summation notation in the Calculus I notes. The act or process of adding; addition. Each item in a matrix is called an entry. Binomial theorem refresher. Now notice in this Service Desk process map template, how in addition to the items mentioned above, there is even more processes and messages. The double series. Molecular Weight 251. Fractional Indices. (b) Write the sum X7 k=1 (2k+ 7) in expanded form. Go to The Equation of a Circle page. , F = 1 when any one of the input is true or 1. In either case, the images of the basis vectors form a parallelogram that represents the image of the unit square under the. 1 Steve Strand and Sean Larsen from Portland State University, US, have shown that, cognitively, the task of interpreting a given summation-notation expression differs significantly from the task of converting a longhand sum into summation notation. Greetings! I wanted to let you know that I am now offering a prorated DeltaMath Plus subscription for $20 that will last until October 1, 2020. Shows how factorials and powers of -1 can come into play. Formula for percentage. Join 90 million happy users! Sign Up free of charge:. The number on top of the summation sign tells you the last number to plug into the given expression. answered Dec 10 '13 at 23:12. Both formulas have a mathematical symbol that tells us how to make the calculations. The series 4+ 8+12 +16+20 +24 can be expressed as 6 ∑ n=14n. Consider the series. Since sigma notation is just a series of addition, you can write out each term in the series then add them all together. In general, capital letters refer to population attributes (i. TQM Diagram. We can also write N+ = {x ∈ N : x. If that region is a polygon (a shape made only of straight sides) the process is straightforward. If we like, we can go back to calling our summation index k,. Free Summation Calculator. Select a link by mouse clicking one of the music notation symbols below. The use of matrix (lin-ear) algebra can greatly simplify many of the computations. Rules of Scientific Notation. 1 Sigma Notation Welcome to Week 1 of the online version of MATH 232 for Spring 2020. Contents 1 Algebra 8 1. But many programmers don't really have a good grasp of what the notation actually means. Taylor series, convergence tests, power series convergence, sigma notation, factorial this page updated 19-jul-17 Mathwords: Terms and Formulas from Algebra I to Calculus. Math 132 Sigma Notation Stewart x4. Write out completely the sequences given by the following rules: (a) a i = i2, where 0 i 5. Zeros in front never count 3. Sigma notation of the polynomial Coefficients of the source polynomial in the form of a recursive formula Coefficients of the source polynomial function are related to its derivative at x 0 The general form or translatable form of the polynomial. 1 Sigma Notation ¶ Sigma notation is a convenient way to write large and complicated sums. You may also want to use "Post-It" notes to list possible causes but have the ability to re-arrange the notes as the diagram develops. By using this website, you agree to our Cookie Policy. An index, or a power, is the small floating number that goes next to a number or letter. Ellipses save space or remove material that is less relevant. Learn how to evaluate sums written this way. The purpose of the above sigma formula is the sum of all X data starting from the order of 1 to n. 5 Sigma Notation And The Nth Term Ppt Video Online Download Index Of Wp Content Uploads 2017 02 Summation Notation Problems & Solutions Sigma Notation Sigma Worksheet 7 Probability And Sigma Notation Solutions(1) Maths Sigma Notation Guided Notesmath With Mrs Holst Tpt Document 20. Sigma 4 Shogi Introduction. adding & subtracting. 13 Coordinate Transformation of Tensor Components This section generalises the results of §1. If we like, we can go back to calling our summation index k,. In this unit we look at ways of using sigma notation, and establish some useful rules. Indices show how many times a number or letter has. Find the value of. The dummy variable will usually show up one or more times in the expression to the right of the Greek letter sigma. The above selection rules apply only for the Electric Dipole (E1) approximation. Contents[show] Table of sum-class symbols Using sum TeX is smart enough to only show. As before, let's think about writing out these sums explicitly, without sigma notation. If we like, we can go back to calling our summation index k,. 1: Summation Notation And Formulas. The variable is called the index of the sum. (a) Write the sum X10 k=4 (2k+ 1) in expanded form. in summation notation. Now back to series. For example: This means that we are to repeatedly add ka k. So for this series, there is 7 terms The seven terms are: when n=0 -2x. Rules - note that # means a non-zero digit (123456789) 1. The numbers at the top and bottom. A key to Business Process Management, it visually depicts a detailed sequence of business activities and information flows needed to complete a process. Note: you can do this more than once on a chart. If I took it out of scientific notation, it would be 800000. In calculus, summation notation or sigma (Σ) represents adding many values together. Sigma is the greek sign for "Sum". It indicates a series. Today you can define mental math in various different ways. We do this through a mixture of our automated migration tools and professional services offerings. That is, we split the interval x 2[a;b] into n increments of size. The act or process of adding; addition. and in terms of the sigma notation When two random variables are independent, so that. For example, the Schrodinger equation, which has to do with dynamics in quantum systems and predates quantum computation by decades, is written using bra-ket notation. This, too, turns out to come down to some other properties of addition. Given any region R, then the area, A(R) is a real number;      A(R) ³ 0. (c) The above two parts show that a sum can be written in notation in di erent ways. In other words, your're adding up a series of a values: a 1, a 2, a 3 …a x. If you are in need of technical support, have a question about advertising opportunities, or have a general question, please contact us by phone or submit a message through the form below. sp 3 HYBRIDIZATION - EXAMPLE 1) Methane (CH 4) * During the formation of methane molecule, the carbon atom undergoes sp 3 hybridization in the excited state by mixing one ‘2s’ and three 2p orbitals to furnish four half filled sp 3 hybrid orbitals, which are oriented in tetrahedral symmetry in space around the carbon atom. Really clear math lessons (pre-algebra, algebra, precalculus), cool math games, online graphing calculators, geometry art, fractals, polyhedra, parents and teachers areas too. using interval notation to show intervals of increasing and decreasing and postive and negative Answers · 1 trouble spots for the domain may occur where the denominator is ? or where the expression under a square root symbol is negative. Now apply Rule 1 to the first summation and Rule 2 to the second summation. Now, just add all these terms together and set them equal. Okay, welcome back everyone. As well as providing shorthand for mathematical ideas, this notation can aid students' understanding of mathematics. This is called Sigma notation. Practice: Summation notation. In the following, $$k$$ is the index. Identities involving double sums include the following: is the floor function, and. de, the Punycode value actually used for the domain names on the wire is xn--bcher-kva. We first give proof of the Halting Problem by constructing a machine capable of solving the Halting Problem and then showing that if such a machine existed it would generate a. For example, Xn i=1 axi = ax1 +ax2 + +axn = a(x1 +x2 + +xn) = a Xn i=1 xi: In other words, you can take a constant \out of the summation". On a single line calculator, a -1 requires the button order be: 1 -. 1, we often encountered sums with many terms (up to 1000 in Table 5. 1 For a Scalar Equation All subscripts must be dealt with in each term. Sigma notation is a method used to write out a long sum in a concise way. These are equal to the value of the variable, 'm' in this case, taken in order. From the rules above, Common series - Sigma notation. Okay, welcome back everyone. Sum and Product Notation: Delimited Forms The capital Greek letter Σ (sigma) denotes summation. AS-Level Maths Questions by topic. What is the sum of all integers between 17 and 325 that are NOT divisible by either. O (2 n) denotes an algorithm whose growth doubles with each addition to the input data set. This exercise formally explores the Riemann sum and practices sigma notation. Homework Statement I'm actually asked to calculate the area under the curve 5x + x 2 over the interval [0,1] using Riemann Sums. ' As such, the expression refers to the sum of all the terms, x n where n represents the values from 1 to k. 2 Sigma Notation & Limits of Finite Sums NOTES SIGMA NOTATION a k =a 1 +a 2 +a 3 +!+a n−1 +a n k=1 n ∑ EX 1) Complete the table, given the following sums in sigma notation: The Sum in Sigma Notation The Sum Written Out, One Term for Each Value of k The Value of the Sum k k=1 5 ∑ (−1) k k k=1 3 ∑ k k=1 k+1 2 ∑ k2 k=4 k−1 5 ∑ EX. Examples of process maps: Service Desk. This is the currently selected item. i is the index of summation. What we are about to do is to take a function and express it as the limit of a sequence of Riemann Sums over. It indicates that you must sum the expression to the right of the summation symbol:. Note that index i can be replaced by any other index and the results will be the same. The double series. Sigma Notation - Terms and Indices Sigma notation allows for a great deal of variety and exibility Ex: Write down the sum of the rst 10 odd integers in 3 di erent ways. Many statistical formulas involve adding a series of numbers. Determine the sum of the series written in Sigma Notation. lets say, we have a boolean function F defined on two variables A and B. 5100 x 3300 px. Hi, I need to calculate the following sigma: n=14 Sigma (sqrt(1-2. Search this site. RULES OF INDICES (three videos) Rules of Indices. Write out the sum 5 1 2 k k = ∑ 2. Now back to series. Topics include: ~Set theory, including Venn diagrams ~Properties of the real number line ~Interval notation and algebra with inequalities ~Uses for summation and Sigma notation ~Math on the Cartesian (x,y) plane, slope and distance formulas ~Graphing and describing functions and their inverses on the x-y plane, ~The concept of instantaneous. 1 1 Section 4. They have the following general form XN i=1 x i In the above expression, the i is the summation index, 1 is the start value, N is the stop value. This exercise formally explores the Riemann sum and practices sigma notation. To express: Left end Ch. Math Summation Notation. and in terms of the sigma notation When two random variables are independent, so that. That is, we split the interval x 2[a;b] into n increments of size. " - Lorena Colin. The Greek capital sigma, P, is used as a shorthand to denote summation. can be evaluated by interchanging and and averaging, (Borwein et al. Sigma has just announced the 'fp,' the world's smallest full-frame camera and, despite owning the sensor design company Foveon, it's built around a conventional Bayer sensor. If you want to know message flow usage, please see How does BPMN message flow work? article. When preparing for technical interviews in the past, I found myself spending hours crawling the internet putting together the best, average, and worst case complexities for search and sorting algorithms so that I wouldn't be stumped when asked about them. Its 2 line display allows “visually perfect” entries; that is, you can type in the problem exactly as it looks. Multiplication by a whole number can be interpreted as successive addition. Free algebra and math word problems. In this case, the ∑ symbol is the Greek capital letter, Sigma, that corresponds to the letter 'S', and denotes to the first letter in the word 'Sum. Go back to the example I keep using: the stylesheet knows the "frameset" rules. improve this answer. By using this website, you agree to our Cookie Policy. With a Six Sigma process even a significant shift in the process mean results in very few defects. The set can be defined, where possible, by describing the elements. The numbers at the top and bottom of the sigma are called upper and lower bounds, respectively. - Notice that we are adding fractions with a numerator of 1 and. What is the sum of all integers between 17 and 325 that are NOT divisible by either. }\) Sigma notation relies on an index and expresses the terms of the sum as expression of the index. Calculations on the TI-30XIIS The TI-30XIIS calculator costs less than$20. Sigma notation Here is another useful way of representing a series. Math 132 Sigma Notation Stewart x4. Sigma Notation - Simplification Rules 7:24. They are useful in getting right to the point without delay or distraction:. The "numbers" to be summed may be natural numbers, complex numbers, matrices, or still more complicated objects. The first time we write it, we put k = 1. Businesses use the EPC for process mapping in BPMN 2. There are two ways to use invNorm (. as desired. I need to calculate other 18 different sigmas, so if you could give me a solution in general form it would be even easier. n an 1 4 2 −12 3 36. The matrix pictured below has two rows and three columns. So sum of n=1 to 20 for (3^n) + sum of n=1 to 20 for (2n-1) Then apply the geometric sum formula for the sum of n=1 to 20 for (3^n). The double series. Gateways are used to control how the process flows. If this series can converge conditionally; for example, converges conditionally if , and absolutely for. It's often convenient to discuss ^{grammatical rules} by formulating them in a special notation that was introduced about 1960 by John ^{Backus} and Peter ^{Naur}. The Greek capital sigma, P, is used as a shorthand to denote summation. Daniel Egger. In the case of IDN Bücher. Even Numbers (Integers) Odd Numbers (Integers) Divisibility Rules. from numpy import mean. What is the sum of all integers between 30 and 809 that are NOT divisible by either the number 5 or the number 13? You must use Sigma notation and the rules discussed in class to solve this problem and you must show. And internal here to the thing inside the sigma notation was an expression 3i squared that had a constant in it, namely 3. Sigma is an open standard for rules that allow you to describe searches on log data in generic form. , parameters); and lower-case letters refer to sample attributes (i. Regarding the sigma notation, it seems to have been included in a tentative draft of Nomenclature of Organic Chemistry, dating from 1973. 2in} 0 \le p 1; \sigma > 0 \). Contents [ hide] 2 Big Omega (Ω). Welcome to Treblis Software's Music Notation Reference Guide. If you want to know message flow usage, please see How does BPMN message flow work? article. And S stands for S um. Einstein Summation. i is the index of summation. Sigma notation is a method used to write out a long sum in a concise way. If you update to the most recent version of this activity, then your current progress on this activity will be erased. EXAMPLE 1 Examples of Sigma Notation a. An n-dimensional vector eld is described by a one-to-one correspondence between n-numbers and a point. For example, we can write which is a bit tedious. Value Stream Map. 1) Rule one states that if you're summing a constant from i=1 to n, the sum is equal to the constant multiplied by n. The rules for Mastery Quizzes are now different. Sum of first n natural numbers. In order to master the techniques explained here it is vital that you undertake plenty of practice exercises so that they become second nature. As we learn the basic integration rules, we will learn the difference between an indefinite integral and a definite integral. What is the sum of all integers between 30 and 809 that are NOT divisible by either the number 5 or the number 13? You must use Sigma notation and the rules discussed in class to solve this problem and you must show. There are formulae that can allow us to calculate the sum. An ellipsis (plural: ellipses) is a punctuation mark consisting of three dots. }\) Sigma notation relies on an index and expresses the terms of the sum as expression of the index. TechCalc scientific calculator contains 12 calculation modes in one application + a handy reference section that includes an additional 22 calculation modes plus a wealth of useful information. So for this series, there is 7 terms The seven terms are: when n=0 -2x. If this series can converge conditionally; for example, converges conditionally if , and absolutely for. where μ is the location parameter and σ is the scale parameter. 2 Rules of summation We will prove three rules of summation. Find the value of. 5*k/36)) k=1 Basically, I need to find a sum of square-roots where in each individual squareroot the k-value will be substituted by an integer from 1 to 14. They have the following general form XN i=1 x i In the above expression, the i is the summation index, 1 is the start value, N is the stop value. That's good. There are formulae that can allow us to calculate the sum. The terminology from AMS-LaTeX documentation. Sigma notation provides a way to compactly and precisely express any sum, that is, a sequence of things that are all to be added together. A summation is simply the act or process of adding. This guide is intended for users with basic chemistry knowledge and is not written to be the sole source of instruction for this topic. Summation formulas. ” For example, let’s say you had 5 items in a data set: 1,2,5,7,9; you can think of these as x-values. The "i = 1" at the bottom indicates that the summation is to start with X 1 and the 4 at the top indicates that the summation will end with X 4. Sigma notation uses a variable that counts upward to change the terms in the list. However, using parentheses makes. Go back to the example I keep using: the stylesheet knows the "frameset" rules. If 5, 6,…, = áare real numbers, then Í = Ü á Ü @ 5 L = 5 E = 6⋯ E = á RULES FOR WORKING WITH SIGMA NOTATION Theorem: If is any constant, then a Í ? á Ü @ 5 L J⋅ ? b Í⋅ = Ü á Ü @ 5 L ?⋅ Í = Ü. sigma notation, also known as summation notation. Summation Notation. MDL number MFCD00013592. Zeros after a # do not count unless they are also after a decimal place 4. If your instructor gave you a class key, use it to enroll yourself and create your account. 4-sigma quality requires addition of a 4 th rule and implementation of a 1 3s /2 2s /R 4s /4 1s multirole, preferably with 4 control measurements in each run (N=4, R=1), or alternatively, 2 control measurements in each of 2 runs. While often associated exclusively with Six Sigma, Centric leverages DMAIC (Define, Measure, Analyze, Improve, Control) as the underlying business process improvement methodology. The greek letter sigma (σ) is used to indicate syllable, and a bracket with a subscript sigma is used for syllable boundaries. 1, we de ne the integral R b a f(x)dx as a limit of approximations. In chemistry, a molecular orbital (MO) is a mathematical function describing the wave-like behavior of an electron in a molecule. The Crescent is the official publication and voice of Phi Beta Sigma Fraternity, Inc. 00, but has features that will be used throughout algebra, trigonometry, and statistics. The index of summation , here the letter i, is a dummy variable whose value will change as the addends of the sum change. Use the sum of rectangular areas to approximate the area under a curve. Only this variable may occur in the product term. Often mathematical formulae require the addition of many variables Summation or sigma notation is a convenient and simple form of shorthand used to give a concise expression for a sum of the values of a variable. Joining a fraternity or sorority is an opportunity to serve the community at UB and beyond. The Leibniz formula for the determinant of a 2 × 2 matrix is | | = −. Calculus Definitions>. That is indicated by the lower index of the letter. Get access risk-free. Three theorems. no i want it to be solve using sigma notation with its rules of sequence and series. sigma notation, also known as summation notation. However, the lower bound doesn't have to be 1. - Dave xml-dev: A list for W3C XML Developers. Geometric Progression, Series & Sums Introduction. 1 - In the following exercises, use the rules for sums Ch. Six Sigma is an intangible work process. Proficiency with Summation Notation also known as Sigma Notation is a very important skill usually taught in PreCalculus and also in Calculus 1 and 2 (AB and BC). Binomial theorem refresher. Rule 1: If c is a constant, then n i=1 cx i = c n i=1 x i. Write out completely the sequences given by the following rules: (a) a i = i2, where 0 i 5. Rules of Scientific Notation. Okay, now that we've seen that fancy sigma notation let's work a really simple small example of numbers and then generalize. adding & subtracting. The first lesson, "Sets and What They're Good For," walks you through the basic notions of. The Example shows (at least for the special case where one random variable takes only. Here, we prefer to set up the prior in terms of nu, mu, sigma/(nu-2) or something like that, to account for the fact that the scale of the distribution (as measured by the sd or median absolute deviation) depends on nu as well as sigma. Ex B) Ex => => C) Where c is a constant,. For example d/dx (x^2) will graph the derivative of x^2 with respect to x. The image below shows the common notation for conditional probability. It makes more sense if you convert to scientific notation first, so 12. Added Apr 14, 2011 by HighOPS in Mathematics. The double series. Riemann sums, summation notation, and definite integral notation. In the following, $$k$$ is the index. Sum of first n natural numbers. If this value of SSR is equal to the sum of squares total, it means our regression model captures all the. Look at the picture below to see an example. The expression is read as the sum of 4n as n goes from 1 to 6. To aid the investigation, we introduce a new quantity, the Euler phi function, written ϕ(n), for positive integers n. This web page describes how symbols are used on the Stat Trek web site to represent numbers, variables, parameters, statistics, etc. Notation 4 We say a Turing machine halts, if, in the course of processing its input data, the Turing machine enters into the halt state and has no further transitions. Summation Notation Worksheet 1 Introduction Sigma notation is used as a convenient shorthand notation for the summation of terms. Sigma Notation: Inequalities: Factorial Notation: Exponential Functions: Logarithmic Functions: Simultaneous Equations: Plotting Coordinates: Straight Line Graphs: Quadratic Graphs: Exponential Graphs: Logarithmic and Square Root Graphs: Differentiation: Integration: MathQuiz 4. Sigma notation mc-TY-sigma-2009-1 Sigma notation is a method used to write out a long sum in a concise way. The growth curve of an O (2 n) function is exponential - starting off very shallow, then rising meteorically. ? Using Sigma notation and related rules, compute the sum of all the integers between 21 and 126 that are not divisible by 4. Constant multiplier. Determine the sum of the series written in Sigma Notation. This calculus video tutorial provides a basic introduction into summation formulas and sigma notation. But polynomials truly come to shine in the work of Al-Samawal (1130-1180) The Shining Book on Calculation. Summation Notation Rules & Examples Video & Lesson Transcript 12. Sigma notation is a method used to write out a long sum in a concise way. Learn how it is used in this video. " If the sums do not converge, the series is said to diverge. So for this series, there is 7 terms The seven terms are: when n=0 -2x. For example, cosx, cos x, and cos (x) are all equivalent. Use algebra rules of sums, along with the appropriate sum formulae, to evaluate the following: (a) X12 i=1 (i2 33i) (b) X10 i=1 (i2 2 1) (c) X8 i=1 (2 i ) 6. A typical sum written in sigma notation looks like this: 4 k 0 (k2 3) The symbol "Σ" is the Greek capital letter sigma, which stands for "sum". Loading Unsubscribe from Jochumzen? Summation Formulas and Sigma Notation - Calculus - Duration: 20:24. In the following, $$k$$ is the index. Rules of Scientific Notation. The Sigma symbol, , is a capital letter in the Greek alphabet. To use summation, you can find sigma in the Desmos keyboard (under FUNCTIONS and then misc) or by typing "sum": If you populate the upper and lower bound, Desmos will output the summation answer. But, more than just being small, it's one of the most radical cameras we've seen released in years, incorporating an array of new ideas and video capabilities. 5100 x 3300 px. The symbol sigma is a Greek letter that stands for ‘the sum of’. Binomial theorem refresher. because it does not matter what we call our index. Kronecker Delta Multiplication The Kronecker Delta is nicknamed the substitution operator because of the following simple property of multiplication, best explained by example. The user is asked to select true. I thought about extending these ideas to product notation (we haven't learned it yet, but it's simple), and I figured out a few rules. [1] The name sigmatropic is the result of a compounding of the long-established "sigma" name for single carbon -carbon bonds and the Greek word tropos , meaning turn. There are some rules that can help simplify or evaluate series. That is, we split the interval x 2[a;b] into n increments of size. Exponents and Integers. 2 University of Sydney School of Mathematics and Statistics. A business process model and notation diagram, or BPMN diagram for short, is used to build easy-to-read business process model flowcharts, which can be shared across organizations and industries. Matrix and Index Notation David Roylance Department of Materials Science and Engineering Massachusetts Institute of Technology Cambridge, MA 02139. Regardless, your record of completion wil. The most general Σ \Sigma Σ notation describes the sum of some unknown number of elements. For each section in Chapter 7 you will have exactly two opportunities to take the quiz for that section, and both of those attempts need to be completed in Canvas by the end-of-week deadline. In this unit we look at ways of using sigma notation, and establish some useful rules. A series that diverges means either the partial sums have no limit or approach infinity. The terminology from AMS-LaTeX documentation. "My TI 83+ graphing calculator arrived faster than I expected. Go to The Equation of a Circle page. Viewing 8 posts - 1 through 8 (of 8 total) Author. The Westgard system is based on the principles of statistical process control used in manufacturing nationwide since the 1950s. Basic math formulas. 1 Steve Strand and Sean Larsen from Portland State University, US, have shown that, cognitively, the task of interpreting a given summation-notation expression differs significantly from the task of converting a longhand sum into summation notation. Sigma notation - Rules. This module contains three lessons that are build to basic math vocabulary. The example shows us how to write a sum of even numbers. If you're seeing this message, it means we're having trouble loading external resources on our website. 2 Rules of Roots. Basic Rule #4 of MO Theory Rule #4: If the AOs are non-degenerate, their interaction is. In particular, it is a symmetric group of prime degree and symmetric group of prime power degree. ” - Sincerely, Dr. Learners are taught how to use sigma notation and how to develop sigma notation. ' As such, the expression refers to the sum of all the terms, x n where n represents the values from 1 to k. Zeros after a # do not count unless they are also after a decimal place 4. It is, therefore, useful to have a set of rules for finding the equivalent resistance of some general arrangement of resistors. sp 3 HYBRIDIZATION - EXAMPLE 1) Methane (CH 4) * During the formation of methane molecule, the carbon atom undergoes sp 3 hybridization in the excited state by mixing one ‘2s’ and three 2p orbitals to furnish four half filled sp 3 hybrid orbitals, which are oriented in tetrahedral symmetry in space around the carbon atom. The notation for adding a series of numbers is the capital Greek letter sigma. But there is a limit on how far you can upgrade the bases. As well as providing shorthand for mathematical ideas, this notation can aid students' understanding of mathematics. TechCalc scientific calculator contains 12 calculation modes in one application + a handy reference section that includes an additional 22 calculation modes plus a wealth of useful information. It is called Sigma notation because the symbol is the Greek capital letter sigma: Σ. They're called partial sums because you're only able to find the sum of a certain number of terms — no infinite series […]. After many searches I couldn't find a single page containing summation formulas for polynomials of order greater than 4. Joining a fraternity or sorority is an opportunity to serve the community at UB and beyond. Select a link by mouse clicking one of the music notation symbols below. It looks like this: $\sum_{j=1}^n \sum_{k=1}^n f(j, k)$ The idea behind this is you're doing a sum within a sum, and both indices will be inside the inner sum. T HIS —Σ—is the Greek letter sigma. Last video we did some elementary examples of sigma notation. Use the sum of rectangular areas to approximate the area under a curve. PART 1: INTRODUCTION TO TENSOR CALCULUS A scalar eld describes a one-to-one correspondence between a single scalar number and a point. One way to compactly represent a series is with sigma notation, or summation notation, which looks like this: $\displaystyle{\sum _{n=3}^{7}{n^2}}$ The main symbol seen is the uppercase Greek letter sigma. Calculate the Product. Summation rules Jochumzen. To change a number from scientific notation to standard form, move the decimal point to the left (if the exponent of ten is a negative number), or to the right (if the exponent is positive). It doesn't have to be "i": it could be any variable (j ,k, x etc. The Organic Chemistry Tutor 270,467 views. For example, assuming k ≤ n. Advertisement. Executive in Residence and Director, Center for Quantitative Modeling. They are useful in getting right to the point without delay or distraction:. Mulliken (1896-1986, awarded with the Nobel prize in 1966) in the early 1930s. The sums are heading towards a value (1 in this case), so this series is convergent. A series can be represented in a compact form, called summation or sigma notation. This is true for all tensor notation operations, not just this matrix dot product. Its 2 line display allows “visually perfect” entries; that is, you can type in the problem exactly as it looks. Note that these formulae only work if we start from 1; we will see how to calculate summations. pdf Math 180 Worksheets W20 20 Sigma Notation And. 1:2s rather than 1 2s) Combinations of rules are generally indicated by using a "slash" mark (/) between control rules, e. The following rule can be used to convert numbers into scientific notation: The exponent in scientific notation is equal to the number of times the decimal point must be moved to produce a number between 1 and 10. Adding series. SIGMA NOTATION FOR SUMS. where E is the sigma sign. Due to linear algebra being all about finding the solutions to systems of linear equations, matrix math and the study of vector spaces become a tool to represent and orderly solve. The ONLY way to show three SF is by using scientific notation. All very clear and understandable for anyone, through the use of BPMN 2. | 2020-05-30T23:52:14 | {
"domain": "amicidellacattolica.it",
"url": "http://amicidellacattolica.it/rmev/sigma-notation-rules.html",
"openwebmath_score": 0.8859736919403076,
"openwebmath_perplexity": 745.3356280199723,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9830850832642354,
"lm_q2_score": 0.8791467801752451,
"lm_q1q2_score": 0.8642760855900652
} |
http://crowebrothers.com/now-we-eqz/bc6841-how-to-find-orthogonal-matrix | # how to find orthogonal matrix
• Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.. Visit Stack Exchange In fact, given any … The interactive program below is designed to answers the question whether the given input matrix is an orthogonal matrix. That is, each row has length one, and are mutually perpendicular. Damit ist die Inverse einer orthogonalen Matrix gleichzeitig ihre Transponierte. Orthogonal matrix is an important matrix in linear algebra, it is also widely used in machine learning. A matrix is orthogonal if the If Q is an orthogonal matrix, then, |Q| = ±1. Previous Solution: Example 1. The eigenvalues of the orthogonal matrix will always be $$\pm{1}$$. The matrix in problem statement (not step one) is for the previous problem. An orthogonal matrix is the real specialization of a unitary matrix, and thus always a normal matrix.Although we consider only real matrices here, the definition can be used for matrices with entries from any field.However, orthogonal matrices arise naturally from dot products, and for matrices of complex numbers that leads instead to the unitary requirement. The concept of orthogonality for a matrix is defined for just one matrix: A matrix is orthogonal if each of its column vectors is orthogonal to all other column vectors and has norm 1. transpose The orthogonal projection matrix is also detailed and many examples are given. Example using orthogonal change-of-basis matrix to find transformation matrix. Let W be a subspace of R n and let x be a vector in R n. If you are on a personal connection, like at home, you can run an anti-virus scan on your device to make sure it is not infected with malware. Es ist offensichtlich, dass Q orthogonal ist, da die beiden Spaltenvektoren orthogonal sind. If the result is an identity matrix, then the input matrix is an orthogonal matrix. Let's say I've got me a set of vectors. If matrix Q has n rows then it is an orthogonal matrix (as vectors q1, q2, q3, …, qn are assumed to be orthonormal earlier) Properties of Orthogonal Matrix. is equal to its Some important properties of orthogonal matrix are, See also Orthogonal Matrix (1) The Definition of The Orthogonal Basis. If you are at an office or shared network, you can ask the network administrator to run a scan across the network looking for misconfigured or infected devices. Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes. Completing the CAPTCHA proves you are a human and gives you temporary access to the web property. When you click Random Example button, it will create random input matrix to provide you with many examples of both orthogonal and non-orthogonal matrices. is an orthogonal matrix. Performance & security by Cloudflare, Please complete the security check to access. So let's say vector w is equal to some linear combination of these vectors right here. I need to find an orthogonal matrix Q, so that when applying M_2 = Q M_1 Q^-1 the matrix M_2 does not contain any values at the zero positions of P. The other way is possible, M_2 may contain a zero, where P is one. Proof Part(a):) If T is orthogonal, then, by definition, the An n £ n matrix A is orthogonal iff its columns form an orthonormal basis of Rn. If Q is square, then QTQ = I tells us that QT= Q−1. Comment(8) Anonymous. One way to think about a 3x3 orthogonal matrix is, instead of a 3x3 array of scalars, as 3 vectors. , Gram-Schmidt process example. Die Matrix ist also orthogonal, weil die Multiplikation der Matrix mit der transponierten Matrix die Einheitsmatrix ergibt. The concept of orthogonality for a matrix is defined for just one matrix: A matrix is orthogonal if each of its column vectors is orthogonal to all other column vectors and has norm 1. This is true because d vectors will always be sufficient be needed to span a d-dimensional vector space. Q⋅QT = E Q ⋅ Q T = E Die Determinante einer orthogonalem Matrix nimmt entweder den Wert +1 oder -1 an. Well, if you're orthogonal to all of these members, all of these rows in your matrix, you're also orthogonal to any linear combination of them. Cloudflare Ray ID: 60a7cf86683fdfbf of the , Diese Matrix beschreibt eine Drehung um den Winkel −θ. Index Next lesson. Orthogonal Matrix Example. Dafür musst du zunächst die transponierte Matrix berechnen und diese dann mit multiplizieren. Define a matrix and find the rank. Let W be a subspace of R4 with a basis {[1011],[0111]}. You can also try to input your own matrix to test whether it is an orthogonal matrix or not. Find the inverse matrix of … concatenation Similarly, the columns are also an orthonormal basis. Thus, matrix is an orthogonal matrix. How to fill in a matrix given diagonal and off-diagonal elements in r? Eigen vectors Thus, matrix Therefore, the value of determinant for orthogonal matrix will be either +1 or -1. 2. In this tutorial, we will dicuss what it is and how to create a random orthogonal matrix with pyhton. | The vectors in are orthogonal while are not. Suppose we have a set of vectors {q1, q2, …, qn}, which is orthogonal if, then this basis is called an orthogonal basis. Next spectral decomposition, Rate this tutorial or give your comments about this tutorial, The row vector and the column vector of matrix, Both Hermitian and Unitary matrix (including. inverse Suppose that is an orthogonal basis for the column space of . . Eigen-everything. From introductory exercise problems to linear algebra exam problems from various universities. Orthogonal matrices preserve angles and lengths. . A linear transformation T from Rn to Rn is orthogonal iff the vectors T(e~1), T(e~2),:::,T(e~n) form an orthonormal basis of Rn. Then we multiply the transpose with given matrix. Pictures: orthogonal decomposition, orthogonal projection. Find an orthonormal basis of W. (The Ohio State University, Linear Algebra Midterm) Add to solve later Sponsored Links Please enable Cookies and reload the page. Es gilt detQ = cos2 ϕ +sin2 ϕ = 1. (3) Your answer is P = P ~u i~uT i. 2. If we try the orth trick, it will produce an array of size d by d, thus a SQUARE matrix. This can be generalized and extended to 'n' dimensions as described in group theory. This covers about orthogonal matrix Its definition and properties. Singular Value Decomposition 7 Finding stationary distribution of a markov process given a transition probability matrix are orthogonal matrices. | Your IP: 78.47.248.67 The concept of two matrices being orthogonal is not defined. That is, if and only if . : Note that this is an n n matrix, we are multiplying a column vector by a row vector instead of the other way around. symmetric A = [1 0 1;-1 -2 0; 0 1 -1]; r = rank(A) r = 3 Since A is a square matrix of full rank, the orthonormal basis calculated by orth(A) matches the matrix U calculated in the singular value decomposition, [U,S] = svd(A,'econ'). Spiegelung. The objective is to find an orthogonal basis for the column space of the following matrix: Use Gram-Schmidt Process to find an orthogonal basis for the column space of segregate the columns of the matrix as . How to find an orthogonal matrix? • Fact 5.3.3 Orthogonal transformations and orthonormal bases a. Orthogonal matrix multiplication can be used to represent rotation, there is an equivalence with quaternion multiplication as described here. Let given square matrix is A. Title: Finding the Nearest Orthonormal Matrix Author: Berthold K.P. , that is Orthogonal matrix is important in many applications because of its properties. Orthogonale Matrizen k¨onnen auch Spiegelungen an Geraden beschreiben. orthogonal vector We study orthogonal transformations and orthogonal matrices. Another way to prevent getting this page in the future is to use Privacy Pass. Demzufolge gilt Q−1 = QT = cosϕ sinϕ −sinϕ cosϕ . b. To test whether a matrix is an orthogonal matrix, we multiply the matrix to its transpose. Finally we check if the matrix obtained is identity or not. You may need to download version 2.0 now from the Chrome Web Store. Eine orthogonale Matrix ist in der linearen Algebra eine quadratische, reelle Matrix, deren Zeilen- und Spaltenvektoren orthonormal bezüglich des Standardskalarprodukts sind. The 1/0 indicate where values are allowed in the result matrix. You can imagine, let's say that we have some vector that is a linear combination of these guys right here. Basic to advanced level. Horn Subject: Painful Way to Solve Photogrammetric Problems Keywords: Orthonormal matrix, Rotation, Photogrammetry, Least Squares Fitting, Projective Geometry, Matrix Square Root, Two step … A square orthonormal matrix Q is called an orthogonal matrix. To create random orthogonal matrix as in the interactive program below, I created random Example: Prove Q = $$\begin{bmatrix} cosZ & sinZ \\ -sinZ & cosZ\\ \end{bmatrix}$$ is orthogonal matrix. What is Orthogonal Matrix? Let us see an example of the orthogonal matrix. So let me call my set B. Let. Vocabulary words: orthogonal decomposition, orthogonal projection. To nd the matrix of the orthogonal projection onto V, the way we rst discussed, takes three steps: (1) Find a basis ~v 1, ~v 2, ..., ~v m for V. (2) Turn the basis ~v i into an orthonormal basis ~u i, using the Gram-Schmidt algorithm. Calculate and verify the orthonormal basis vectors for the range of a full rank matrix. Basis vectors. Simple Solution : The idea is simple, we first find transpose of matrix. Video transcript. Also given a symmetric prototype matrix P, containing ones and zeroes. If n>d, regardless of the size, as long as n>d, we can never find a set of n vectors in a d-dimensional space that are orthogonal. A matrix can be tested to see if it is orthogonal using the Wolfram Language code: OrthogonalMatrixQ[m_List?MatrixQ] := (Transpose[m].m == IdentityMatrix @ Length @ m) The rows of an orthogonal matrix are an orthonormal basis. If, it is 1 then, matrix A may be the orthogonal matrix. Problems of Orthogonal Bases. 0 0 1 0 1 0 For example, if Q =1 0 then QT=0 0 1. The concept of two matrices being orthogonal is not defined. >. Um eine orthogonale Matrix bestimmen zu können, überprüfst du die Formel von oben. Recipes: orthogonal projection onto a line, orthogonal decomposition by solving a system of equations, orthogonal projection via a complicated matrix product. To test whether a matrix is an orthogonal matrix, we multiply the matrix to its transpose. matrix and compute the modal matrix from < To check for its orthogonality steps are: Find the determinant of A. If a matrix A is an orthogonal matrix, it shoud be n*n. The feature of an orthogonal matrix A. Gram-Schmidt example with 3 basis vectors. We can define an inner product on the vector space of all polynomials of degree at most 3 by setting. If the result is an identity matrix, then the input matrix is an orthogonal matrix. Overview. The Gram-Schmidt process. Since computing matrix inverse is rather difficult while computing matrix transpose is straightforward, orthogonal matrix make difficult operation easier. An orthogonal matrix … Orth trick, it is an identity matrix, then the input matrix is an orthogonal matrix or.. Whether a matrix is an orthogonal matrix will be either +1 or -1 the Chrome Store. Stationary distribution of a the Chrome web Store are given the how to find orthogonal matrix is to use Privacy Pass most 3 setting... Is to use Privacy Pass simple, we first find transpose of matrix in this tutorial, first! Column space of = cosϕ sinϕ −sinϕ cosϕ ist die inverse einer orthogonalen matrix gleichzeitig ihre transponierte also,... Inverse matrix of … if Q is square, then QTQ = I tells us that Q−1... Of degree at most 3 by setting mit multiplizieren how to fill in a matrix is an orthogonal matrix then... Be \ ( \pm { 1 } \ ) the determinant of a array...: find the inverse matrix of … if Q =1 0 then QT=0 0 1 markov given. Nimmt entweder den Wert +1 oder -1 an got me a set of vectors containing ones zeroes... With pyhton den Wert +1 oder -1 an = E die Determinante orthogonalem... By cloudflare, Please complete the security check to access matrix obtained identity., Please complete the security check to access two matrices being orthogonal is not defined {. Is important in many applications because of its properties whether it is an orthogonal matrix gleichzeitig ihre.! Φ +sin2 ϕ = 1 } \ ) matrix gleichzeitig ihre transponierte den! 78.47.248.67 • Performance & security by cloudflare, Please complete the security check to access be. Containing ones and zeroes, as 3 vectors orthogonalem matrix nimmt entweder den Wert +1 oder -1 an ihre! To span a d-dimensional vector space of all polynomials of degree at most by. W is equal to some linear combination of these vectors right here many examples are given ist orthogonal! ⋅ Q T = E die Determinante einer orthogonalem matrix nimmt entweder den Wert +1 -1... To some linear combination of these vectors right here because d vectors will be! Its properties Finding the Nearest orthonormal matrix Q is called an orthogonal matrix with pyhton complicated matrix product web... Is not defined markov process given a transition probability matrix this covers about orthogonal matrix is. This is true because d vectors will always be sufficient be needed to a! = 1 n ' dimensions as described here ones and zeroes given a symmetric prototype P! ( 3 ) Your answer is P = P ~u i~uT I the space... Vector space = 1 let us see an example of the orthogonal matrix a is an orthogonal its... Applications because of its properties from various universities musst du zunächst die transponierte matrix berechnen und diese dann mit.. Your own matrix to its inverse, that is may be the orthogonal is! Covers about orthogonal matrix its definition and properties security by cloudflare, Please complete the security to! Cloudflare Ray ID: 60a7cf86683fdfbf • Your IP: 78.47.248.67 • Performance security! Then QT=0 0 1 £ n matrix a will dicuss what it is 1 then, =! Cloudflare Ray ID: 60a7cf86683fdfbf • Your IP: 78.47.248.67 • Performance & security by,... Can define how to find orthogonal matrix inner product on the vector space of all polynomials of degree at most by! A matrix is an identity matrix, then the input matrix is also detailed and many are... In group theory future is to use Privacy Pass n ' dimensions as described here sinϕ. Web property generalized and extended to ' n ' dimensions as described group! Du zunächst die transponierte matrix berechnen und diese dann mit multiplizieren of the matrix. Result matrix the inverse matrix of … if Q is an orthogonal matrix Q an. = I tells us that QT= Q−1 is true because d vectors will always sufficient... Rotation, there is an equivalence with quaternion multiplication as described here the matrix to transformation! Given any … the eigenvalues of the orthogonal matrix will always be be. Identity matrix, then the input matrix is an orthogonal basis for the previous problem the question the! Be n * n. the feature of an orthogonal matrix will be +1... Via a complicated matrix product this is true because d vectors will always be sufficient be needed to a... A 3x3 orthogonal matrix to input Your own matrix to its inverse, that is we multiply matrix! Determinante einer orthogonalem matrix nimmt entweder den Wert +1 oder -1 an rotation, there is how to find orthogonal matrix orthogonal,... W is equal to some linear combination of these guys right here operation easier any … the of! In fact, given any … the eigenvalues of the orthogonal matrix of. Is straightforward, orthogonal matrix operation easier not step one ) is for the column space of all of... 'Ve got me a set of vectors in r not step one ) is the!, |Q| = ±1 nimmt entweder den Wert +1 oder -1 an 3 by setting the property... -1 an \ ) also an orthonormal basis, that is 60a7cf86683fdfbf Your! Is straightforward, orthogonal matrix or not is not defined an equivalence with quaternion multiplication as described in theory... Input matrix is an orthogonal matrix will be either +1 or -1 QTQ I... Transpose of matrix problems to linear algebra exam problems from various universities können, überprüfst du die Formel oben! Decomposition by solving a system of equations, orthogonal projection via a complicated matrix product may need to version. If Q =1 0 then QT=0 0 1 with quaternion multiplication as described group. We will dicuss what it is and how to create a random orthogonal matrix.! Are allowed in the future is to use Privacy Pass Q =1 0 QT=0! Wert +1 how to find orthogonal matrix -1 an an orthonormal basis of Rn tutorial, we multiply matrix. Whether the given input matrix is an orthogonal matrix inverse einer orthogonalen matrix gleichzeitig ihre.... By cloudflare, Please complete the security check to access a complicated matrix.... & security by cloudflare, Please complete the security check to access equations, orthogonal matrix ( 1 the! Space of all polynomials of degree at most 3 by setting trick, it is and how to fill a! Weil die Multiplikation der matrix mit der transponierten matrix die Einheitsmatrix ergibt in fact, any! A random orthogonal matrix with pyhton how to find orthogonal matrix vectors right here orthogonalen matrix ihre! 1/0 indicate where values are allowed in the result is an orthogonal matrix make difficult easier! Is P = P ~u i~uT I access to the web property matrix obtained identity... Version 2.0 now from the Chrome web Store orthogonal, weil die Multiplikation der matrix mit der matrix... Web Store n ' dimensions as described in group theory ' n ' dimensions as described in group theory matrix! Vector that is instead of a 3x3 orthogonal matrix its definition and properties a system of equations, matrix... Dafür musst du zunächst die transponierte matrix berechnen und diese dann mit multiplizieren applications of. Also given a transition probability matrix this covers about orthogonal matrix will be either +1 -1. In are perpendicular or orthogonal provided that their dot product vanishes and.! Or not algebra exam problems from various universities equivalence with quaternion multiplication as in! Then QTQ = I tells us that QT= Q−1 dicuss what it is 1,. Try the orth trick, it shoud be n * n. the feature of an orthogonal...., then the input matrix is important in many how to find orthogonal matrix because of properties... Answers the question whether the given input matrix is orthogonal if the transpose is straightforward, orthogonal matrix,,... Web Store 1 0 1 0 1 0 for example, if Q is square, then input. ) is for the previous problem off-diagonal elements in r d, thus a square matrix examples... ) is for the column space of all polynomials of degree at most by... Weil die Multiplikation der matrix mit how to find orthogonal matrix transponierten matrix die Einheitsmatrix ergibt it is an equivalence with quaternion as! We have some vector that is an orthogonal matrix is orthogonal if the result an. Matrices being orthogonal is not defined orthogonal, weil die Multiplikation der matrix mit der transponierten matrix Einheitsmatrix. • Performance & security by cloudflare, Please complete the security check to access given diagonal and elements. Way to think about a 3x3 array of size d by d, thus a orthonormal. That their dot product vanishes let 's say I 've got me a set vectors. To access what it is 1 then, |Q| = ±1 rotation, there is an orthogonal matrix degree... 0 1 0 for example, if Q =1 0 then QT=0 0 1 0 for example if... Algebra exam problems from various universities on the vector space of imagine, let 's say that we some. Gives you temporary access to the web property ) Your answer is P = P i~uT. I 've got me a set of vectors: Finding the Nearest orthonormal Q... Projection via a complicated matrix product we can define an inner product on the vector.... Transition probability matrix this covers about orthogonal matrix with pyhton Q−1 = =... A transition probability matrix this covers about orthogonal matrix multiplication can be used to represent rotation there! Is true because d vectors will always be sufficient be needed to span d-dimensional... Any … the eigenvalues of the orthogonal basis for the previous problem matrix ist also orthogonal weil. A line, orthogonal decomposition by solving a system of equations, orthogonal matrix, then the input is!
Filed under: News. Bookmark the permalink. | 2021-06-12T18:37:39 | {
"domain": "crowebrothers.com",
"url": "http://crowebrothers.com/now-we-eqz/bc6841-how-to-find-orthogonal-matrix",
"openwebmath_score": 0.7539582252502441,
"openwebmath_perplexity": 1214.8395199556069,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES\n\n",
"lm_q1_score": 0.9724147201714923,
"lm_q2_score": 0.8887587949656841,
"lm_q1q2_score": 0.8642421349065085
} |
https://math.stackexchange.com/questions/4032890/winding-number-of-a-curve-not-complex-analysis | Winding number of a curve (not complex analysis)
I am asked to calculate the winding number of an ellipse (it's clearly 1 but I need to calculate it)
I tried two different aproaches but none seems to work.
I would like to know why none of them work (I believe it is because these formulas only work if I have a curve parametrized by arc lenght).
Approach 1:
A valid parametrization : $$\gamma=(a\cos t,b\sin t)$$, with $$t \in [0,2\pi], \, a,b \in \mathbb{R}$$
$$\dot{\gamma}(t)=(-a\sin t,b\cos t)$$, with $$t \in [0,2\pi], \, a,b \in \mathbb{R}$$
$$\ddot{\gamma}(t)=(-a\cos t,-b\sin t)$$, with $$t \in [0,2\pi], \, a,b \in \mathbb{R}$$
$$\det(\dot{\gamma}(t)|\ddot{\gamma}(t)) = \renewcommand\arraystretch{1.2}\begin{vmatrix} -a\sin t & -a\cos t \\ b\cos t & -b\sin t \end{vmatrix}=ab \sin^2 t+ab \cos^2 t=ab$$
$$||\dot{\gamma}(t)||^3=(\displaystyle\sqrt{(-a\sin t)^2+(b\cos t)^2})^3=(\displaystyle\sqrt{a^2\sin^2 t+b^2\cos^2 t})^3=a^3b^3$$
$$\kappa(t)=\displaystyle\frac{ab}{a^3b^3}=\displaystyle\frac{1}{a^2b^2}$$
$$\mathcal{K}_\gamma = \displaystyle\int_{0}^{2\pi} \displaystyle\frac{1}{a^2b^2} \ dt= \displaystyle\frac{2\pi}{a^2b^2}$$, $$\mathcal{K}_\gamma$$ is the total curvature of the curve.
$$i_\gamma=\displaystyle\frac{\displaystyle\frac{2\pi}{a^2b^2}}{2\pi}=\displaystyle\frac{1}{a^2b^2}$$...which is not necessarily 1.
Approach 2:
Winding # = $$\displaystyle\frac{1}{2\pi}\displaystyle\int_{\gamma}\displaystyle\frac{-y}{x^2+y^2}\>dx+\displaystyle\frac{x}{x^2+y^2}\>dy$$
That gives us $$\displaystyle\frac{1}{2\pi}\displaystyle\int_{0}^{2\pi}\left( \displaystyle\frac{-b\sin t}{a^2\cos^2 t+b^2\sin^2 t}(-a\sin t)+\displaystyle\frac{a\cos t}{a^2\cos^2 t+b^2\sin^2 t}(b\cos t) \right)\>dt$$
$$\displaystyle\frac{1}{2\pi}\displaystyle\int_{0}^{2\pi}\left( \displaystyle\frac{ab}{a^2\cos^2 t+b^2\sin^2 t }\right)\>dt$$, which I computed and cannot be calculated.
Clearly the second approach is valid if we are dealing with a circumference of radius 1. We can generalize for the elipsee using Green's Theorem. I would also like if someone could show me this way as well.
Thank you
• If you use a polar coordinate system, and parametrise the ellipse using $\theta(t)$ and $r(t)$ for $t_0 \le t \le t_1$, then the winding number is by definition $$\frac{\theta(t_1) - \theta(t_0)}{2 \pi}$$ – Glärbo Feb 20 at 11:55
• Thank you for your help. I had indeed read that as well, but I really can't seem to know what to do in order to end up with $\theta (t)$ and $r (t)$. Maybe this is a bit obvious, but I'm really not being able to see any further. Any hints? – hugh_maths Feb 20 at 13:01
The last integral indeed has a closed form to evaluate you can exploit the symmetry about $$\pi$$ to get the integral as \begin{align} \pi I &= ab \int_{0}^{\pi} \dfrac{1}{a^2 \cos^2(t) + b^2 \sin^2(t)}dt\\ &= 2ab\int_{0}^{\pi/2} \dfrac{\sec^2(t)}{a^2+b^2 \tan^2(t)} dt \end{align} Now substituite $$\tan(t) = u$$ $$\dfrac{\pi}{2ab} I = \int_{0}^{\infty}\dfrac{1}{a^2+b^2x^2}dx = \dfrac{\pi}{2ab}$$ thus giving $$I =1$$
• Thank you for your kind answer. Shouldn't this be equal to 1 since this is the winding number and its been known to be 1? – hugh_maths Feb 20 at 12:57
• it is 1 the lhs is a constant times the integral, does this answer your question @hugh_maths – Aditya Dwivedi Feb 20 at 12:58
• oh yes, of course, I'm sorry! Oh so we should be done ! 1 is indeed the winding number! Thank you so much! Any thoughts on why my first approach is wrong (or seems to be) ? – hugh_maths Feb 20 at 13:03
Green's Theorem will tell you that the winding number (given by approach #2 — your total curvature in #1 is incorrect because you need an arclength integral) of the ellipse is the same as the winding number of any circle (which is easy to compute).
Let $$P=-\dfrac y{x^2+y^2}$$ and $$Q=\dfrac x{x^2+y^2}$$. Note that on $$\Bbb R^2-\{0,0\}$$, we have $$\dfrac{\partial P}{\partial y} = \dfrac{\partial Q}{\partial x}$$. Thus, if $$R$$ is the region between the ellipse $$E$$ and a circle $$C$$ centered at the origin lying inside it, we have $$\int_E P\,dx+Q\,dy - \int_C P\,dx + Q\,dy = \iint_R \left(\frac{\partial Q}{\partial x} - \frac{\partial P}{\partial y}\right)\,dA = 0.$$ But you can easily calculate that $$\int_C P\,dx + Q\,dy = 2\pi$$.
• Thank you so much!@ Aditya Dwivedi helped me and I was able to evaluate the integral. As for the approach # one, I believe the total curvature divided by $2\pi$ gives us the index, which is the same as the winding number. Or they differ ? Cause I do not understand why the result comes up different than 1. – hugh_maths Feb 20 at 19:02
• Yeah, for a convex curve $C$, it is the case that $\int_C \kappa\,ds = \pm 2\pi$ (hard theorem). But you have to integrate with respect to arclength, not $dt$. – Ted Shifrin Feb 20 at 19:25
• Additional comment: The curvature of the ellipse is not constant, so you'd better double-check your computations! You made a glaring error there. – Ted Shifrin Feb 20 at 19:34 | 2021-06-21T15:54:14 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/4032890/winding-number-of-a-curve-not-complex-analysis",
"openwebmath_score": 0.9710761308670044,
"openwebmath_perplexity": 220.6253364112749,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9724147201714922,
"lm_q2_score": 0.8887587920192298,
"lm_q1q2_score": 0.8642421320413328
} |
http://rzby.effebitrezzano.it/4-4-matrix-latex.html | # 4 4 Matrix Latex
This theory. 1 command to change font size. For asymptote code embedded in a latex document, just use the "PdfLaTex+Asymptote+PdfLaTeX+View Pdf" mode for the quick build command. Its main purpose is to display mathematical formulas written in LaTeX. LaTeX Tutorial pt 6 - Tables and Matrices in LaTeX How to create a matrix larger than 3x3. matrix creates a matrix from the given set of values. You can use decimal (finite and periodic) fractions: 1/3, 3. Three Styles for LaTeX Vector Notation filed in LaTeX , Math on Jun. Beamer Tutorial Outline Outline 1 About Beamer 2 Templates 3 Frames 4 Sections and Subsections 5 Text 6 Alignment and Spacing 7 Lists 8 Overlays 9 Tables 10 Frame Structures 11 Graphics 12 Themes. With the encouragement and support of Eitan's family, Michal Hoftich, Karl Berry, and others have continued to work on TeX4ht. Suppose A is the 4 x 4 matrix. Specialty Products. I always forget how to do this. Similar Matrices and Diagonalizable Matrices S. Suppose I have a 6 by 6 matrix where the elements vary from 1:36 in increment of 1. Sage provides standard constructions from linear algebra, e. To initialize an N-by-M matrix, use the “zeros” function. Want a Mac app? Lucky you. subcaption A useful extension is the subcaption package (the subfigure and subfig packages are deprecated and shouldn't be used any more), which uses subfloats within a single float. Also, you can add a multiple of one row to another row without changing the determinant. One of the greatest motivating forces for Donald Knuth when he began developing the original TeX system was to create something that allowed simple construction of mathematical formulae, while looking professional when printed. \ vdots for vertical dots. I can't figure out how to use "Equation Tools" to enter a matrix with dimensions of my choosing. How do we calculate the dimension of a matrix? Is it the number of entries? Or is it the number of different entries? For instance if I have a matrix 2x2 the dimension would be 4 but if the matrix is simetrical it would be 3. Drag Sales to Values. If there are symbols missing drop me a line or create a pull-request. Examples and questions on matrices along with their solutions are presented. This is the 16th video in a series of 21 by Dr Vincent Knight of Cardiff University. MatrixForm acts as a "wrapper", which affects printing, but not evaluation. I need to combine them into one 10x10 matrix with n1 in the top left corner, n2 in the top right, n3 in the bottom left and n4 in the bottom right, and I am using Mathematica 4. Symmetrical monomers such as ethylene and tetrafluoroethylene can join together in only one way. Yes, but there will always be the same number of pivots in the same columns, no matter how you reduce it, as long as it is in row echelon form. Just array to make the matrix and insert a vertical bar between the columns where you want a vertical bar. ELEMENTARY MATRICES 43 Remark 106 To actually create the matrix which performs (R j +mR i) $(R j), we do not need to perform the same operation on the identity matrix. When this is done to a matrix in echelon form, it remains in echelon form. 5 option in the \includegraphics command to resize the image to 150% of its original size. where I denotes a unit matrix of order n. Linear Algebra/Zero Matrices and Zero Vectors/ From Wikibooks, open books for an open world < Linear Algebra. Matrix algebra for beginners, Part I matrices, determinants, inverses Jeremy Gunawardena Department of Systems Biology Harvard Medical School 200 Longwood Avenue, Cambridge, MA 02115, USA [email protected] August 2012 by tom 55 Comments. An m × n (read 'm by n') matrix is an arrangement of numbers (or algebraic expressions ) in m rows and n columns. Matrices with Examples and Questions with Solutions. 4 Fonts Font sizes Point size Latex cmd User-de ned * Sample 5 6 \tiny \xxxsmall the quick brown fox 7 8 \scriptsize \xxsmall the quick brown fox 8 10 \footnotesize \xsmall the quick brown fox. An online LaTeX editor that's easy to use. All the basic matrix operations as well as methods for solving systems of simultaneous linear equations are implemented on this site. ELEMENTARY MATRICES 43 Remark 106 To actually create the matrix which performs (R j +mR i)$ (R j), we do not need to perform the same operation on the identity matrix. The inverse of a $2\times2$ matrix is given by swapping the diagonal entries, negating the off-diagonal entries, and dividing by the determinant: $$\begin{pmatrix}a&b\\c&d\end{pmatrix}^{-1} = \frac{1}{ad-bc} \begin{pmatrix}d & -b \\ -c & a\end{pmatrix}$$. Word 2016 automatically handles formatting, nonetheless, you can manually adjust the spacing and alignment of equations. To add rows and/or columns, right click on your matrix 6. 1234567890 abcdefghijklmnopqrstuvwxyz. #N#square root ("radical") Symbols in Geometry Symbols in Algebra. We can associate a matrix with each graph storing some of the information about the graph in that matrix. Our matrix and vector calculator is the most sophisticated and comprehensive matrix calculator online. The matrix $B$ is the inverse of the matrix $A$ if when multiplied together, $A\cdot B$ or [latex. To find the det(B), I multiplied B 14 by det(B 14 ) and B 24 by det(B 24 ) and followed the + - + - pattern as showed by the formula here (scroll below for 4x4 formula). While in Spain she was cast in a regular role in the TV show Dark Justice which was produced in Barcelona for its first season. Justify each answer. - Thomas Oct 5 '13 at 8:23. Calendar library 5. eigenvectors_left ¶. Just array to make the matrix and insert a vertical bar between the columns where you want a vertical bar. Sage provides standard constructions from linear algebra, e. \ vdots for vertical dots. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. This does seem silly. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58. We introduce a very small part of the language for writing mathematical notation. my table and figure. to get a color as mix of 4 colors such as CMYK). Together these facts mean that the upper triangular matrices form a subalgebra of the associative algebra of square matrices for a given size. Natural rubber is an elastomer and a thermoplastic. The defining property for the gamma matrices to generate a Clifford algebra is the anticommutation relation {,} = + =,where {,} is the anticommutator, is the Minkowski metric with signature (+ − − −), and is the 4 × 4 identity matrix. The majority of L A TEX packages has a manual which describes how to use it and usually gives examples. The video explains the concepts with hands on. For example, create a 3-by-5 matrix of zeros:. You can think of these two points as "attractor points". Inverse Matrix Questions with Solutions Tutorials including examples and questions with detailed solutions on how to find the inverse of square matrices using the method of the row echelon form and the method of cofactors. VerkhovtsevaKatya. Most rubber in everyday use is vulcanized to a point where it shares properties of both; i. Let A be the following matrix LaTeX: \begin{bmatrix}5&-6&-12\\ 14 & 4&7 \end{bmatrix} [ 5 −6 −12 14 4 7 ] The dimensions of A are Expert Answer 100% (1 rating). Formatting Optimization Problems with LaTeX. This means that it is the set of the n-tuples of real numbers (sequences of n real numbers). Reference. There are many identity matrices. Transparency 20. In a double-blind, placebo-controlled, randomized study of 187 women receiving Climara 0. js as an input. Important: We can only multiply matrices if the number of columns in the first matrix is the same as the number of rows in the second matrix. MatrixForm acts as a "wrapper", which affects printing, but not evaluation. Note: This page is a work-in-progress. 00 Only 2 left. Welcome! This is the documentation for Numpy and Scipy. So our strategy will be to try to find the eigenvector with X = 1, and then if. How to add an equation in your document, see Working with Microsoft Equation. INPUT: The matrix command takes the entries of a matrix, optionally preceded by a ring and the dimensions of the matrix, and returns a matrix. Similarly, the other matrix is of the order 4 × 3, thus the number of elements present will be 12 i. Definir el tamaño y márgenes del papel. tikz-pgf positioning matrices bordermatrix. The eigenspace corresponding to an eigenvalue λ of A is defined to be Eλ = {x ∈ Cn ∣ Ax = λx}. Ideal for low compression situations, the polyester/cotton weave provides excellent elasticity and recoverability. Read honest and unbiased product reviews from our users. 可以生成嵌入到HTML网站、论坛或博客的公式代码. ISBN -8176-3805-9 (acid-free paper) (pbk. Please join the discussion on moodle. 1 or any later version published by the Free Software. Right click the matrix and select Matrix Spacing… 3. The Matrix 4 will be in the same universe as John Wick Lionsgate This one is (surprisingly) way too detailed to outline in full here (it involves the creation of a bunch of Zion Accords to "govern. Making statements based on opinion; back them up with references or personal experience. We can encode this transformation in a 4 x 4 matrix by putting A in the top left with three 0's below it and making the last column be (b,1). To define dots in Latex, use: \ ldots for horizontal dots on the line. Texmaker can also be used to edit and compile directly asymptote figure not embedded in a latex document. Input LaTeX, Tex, AMSmath or ASCIIMath notation (Click icon to switch to ASCIIMath mode) to make formula. Multiplying the 4-vector (v,1) with this matrix will give you (Av + b, 1). radio_button_uncheckedNo. Imagine turning a paper to the other side, that is what is happening. LaTeX minipage. Definir el tamaño y márgenes del papel. Paquete layouts. But the resulting 2 matrices are S4 object of class. 4-18 are: v v v 23 4= =16 V, 8 V and 6 V= Determine the values of the following: (a) The gain, A, of the VCVS (b) The resistance R 5 (c) The currents i b and i c (d) The power received by resistor R 4. 25]{image}} \begin{table}[h!] \begin{tabular}{| p{2cm} | p{2cm} | p{2cm} | p{2cm. This ends up being a cubic equation, but just looking at it here we see one of the roots is 2 (because of 2−λ), and the part inside the square brackets is Quadratic, with roots of −1 and 8. Welcome! This is the documentation for Numpy and Scipy. Multiplication of Matrices. Most rubber in everyday use is vulcanized to a point where it shares properties of both; i. 4 5! 2 9! = 53! Putting it all together 3 7 4 5! 2 9! = 69 53! Example Find 2 4 5 3. Define Vector and Matrix Data. 620 MazdaRX4Wag 21. multiplication dot. Ideal for low compression situations, the polyester/cotton weave provides excellent elasticity and recov. Yes, but there will always be the same number of pivots in the same columns, no matter how you reduce it, as long as it is in row echelon form. Want a Mac app? Lucky you. Very Basic Mathematical Latex A document in the article style might be entered between the nmaketitle and nendfdocumentgsections below. Our matrix and vector calculator is the most sophisticated and comprehensive matrix calculator online. They'll be productive from day one and be able to pick up small amounts of LaTeX as they go. For LaTex symbols, check the website LaTeX:Symbols (Art of Problem Solving). Steps 5 and 6 specify the data to display in the matrix data cells. Definir el tamaño y márgenes del papel. Use commas or spaces to separate values in one matrix row and semicolon or new line to separate different matrix rows. Note that the inverse [B]-1 always has the same number of rows and columns as the original matrix [B]. Matrix Representations of Linear Transformations and Changes of Coordinates 0. 0 6 160 110 3. ISBN -8176-3805-9 (acid-free paper) (pbk. It is easy to define a matrix of values in Octave. a $2 \times 2$ matrix whose elements are $2 \times 2$ matrices) and then apply "Block Inversion" : have a look at this article. MatrixForm prints SparseArray objects like the corresponding ordinary lists. Creation of matrices and matrix multiplication is easy and natural: Note that in Sage, the kernel of a matrix A is the "left kernel", i. She followed the series to its new. TeXstudio is a fully featured LaTeX editor. The size of the matrix is determined automatically, so it is not necessary to explicitly state the dimensions. So the Eigenvalues are −1, 2 and 8. The simplest classifiers, called binary classifiers, has only two classes: positive/negative, yes/no, male/female … Performance of a binary classifier is summarized in a confusion matrix that cross-tabulates predicted and observed examples into four options:. Row and column labelling of matrixes in LaTeX. 3 Reference guide. Definition If A is an m n matrix, with columns a1,a2, ,an, and if x is in Rn, then the product of A and x, denoted by Ax,isthelinear combination of the columns of A using the corresponding. Sage provides standard constructions from linear algebra, e. Let A be the following matrix LaTeX: \begin{bmatrix}5&-6&-12\\ 14 & 4&7 \end{bmatrix} [ 5 −6 −12 14 4 7 ] The dimensions of A are Expert Answer 100% (1 rating). a system of linear equations with inequality constraints. Carrie Anne Moss loves to play her so much. No installation, real-time collaboration, version control, hundreds of LaTeX templates, and more. 3 Beamer presentation. This post will tell you which one is the best. I have seen is countless discussion threads and videos to use Equation Editor 3. In mathematics, a matrix (plural matrices) is a rectangular array (see irregular matrix) of numbers, symbols, or expressions, arranged in rows and columns. 3 Single Equations that are Too Long: multline If an equation is too long, we have to wrap it somehow. The previous example was the 3 × 3 identity; this is the 4 × 4 identity: The 3 × 3 identity is denoted by I3 (pronounced as "eye-three" or "eye. matrix without brackets. See Snip in action—watch a demo video! Take screenshots of individual equations, paragraphs, and even full pages of text! Digitize any math or text on your screen in seconds. The position of the elements are specified with pos, which is either NULL, or a vector specifying the number of elements on a row, or a 2-columned matrix specifying the (x,y) position of. This ends up being a cubic equation, but just looking at it here we see one of the roots is 2 (because of 2−λ), and the part inside the square brackets is Quadratic, with roots of −1 and 8. LATEX Command Summary This listing contains short descriptions of the control sequences that are likely to be handy for users of LAT EX v2. It is free and easy to use. An online LaTeX editor that's easy to use. Is T one–to–one? Theorem Let T: n m be a linear transformation and let A be the standard matrix for T. Changing the font size in LaTeX can be done on two levels, either affecting the whole document or parts/elements of it. 6 Implications of nullity being zero. We can associate a matrix with each graph storing some of the information about the graph in that matrix. Click on "Insert" and choose what you want to add. You can put this solution on YOUR website! How do I write systems of equations in matrix form? That's one of the easiest things you'll ever learn: Suppose you have this system: 4x + 7y = 1 x - y = -8 Look at the red numbers: 4x + 7y = 1 1x - 1y = -8 Erase the letters: 4 + 7 = 1 1 - 1 = -8 Erase the + and bring the - over nearer the 1: 4 7 = 1 1 -1 = -8 Replace the " = " signs with a vertical. The mathematical symbol is produced using \partial. This site is supported by donations to The OEIS Foundation. CHANGES IN VERSION 1. LaTeX for Advanced View Examples These are provided if you'd like to copy and paste the LaTeX from the examples into the Advanced View of the Equation Editor to tinker with the examples. 320 Hornet4Drive 21. Mathematical Formulas. This function and x / y are equivalent. MATH 316U (003) - 1. 1 Fill the rest of the line. mat") where readMat is from the R. Creating a Payoff Matrix Using LaTeX Tabular Environment 291. Analogous sets of gamma matrices can be defined in any dimension and for any signature of the metric. You can add, subtract, multiply and transpose matrices. Specifically the cofactor of the $(i,j)$ entry of a matrix, also known as the $(i,j)$ cofactor of that matrix, is the signed minor of that entry. The context menu does not have an option to insert additional rows or columns. More details. Augmented Matrix Calculator is a free online tool that displays the resultant variable value of an augmented matrix for the two matrices. Coordinate systems 8. Choose a type a matrix 5. , Manufacturer: Medline, Medline Item Number: MDS087004LFZ, Medline MDS087004LFZ Bandage, Elastic, Matrix, 4" x 5 yd. Invest in comfortable, restful sleep for your family with mattresses that suit individual sleeping styles and preferred levels of firmness. 4 tips for writing matrix questions Sarah Cho 2 min read A matrix question —or really, multiple questions presented on a grid—is one of the most popular question types in online and traditional pen-and-paper surveys. Use the scale=1. X n converges to Xin distribution, written X n X, if lim n!1 F n(t) = F(t) (7) at all tfor which Fis continuous. The X-Y Matrix is a Six Sigma tool mostly used during the DMAIC measure phase and the DMADV measure phase to show the relationship between X and Y factors. We introduce a very small part of the language for writing mathematical notation. Only a limited part of the full TeX language is supported; see below for details. Then write the LaTex code \cancel{A}. 4 FROM VERSION 1. If we try to multiply an n×1 matrix with another n×1 matrix, this product is not defined. America's #1 selling latex caulk. Enumerate is used to make numbered lists. Set the matrix (must be square). \\imath and\\jmath make "dotless" i and j, which. We now go on to solve. Please, be aware that the support for loading tables from an existing LaTeX code is severely limited and may work erroneously or may not work at all. Matrix is our finest elastic bandage. LaTeX symbols have either names (denoted by backslash) or special characters. We can encode this transformation in a 4 x 4 matrix by putting A in the top left with three 0's below it and making the last column be (b,1). It is free and easy to use. 8 in R3 form a basis for the unit cell shown in the accompanying figure. If you have more specific LaTeX questions. The process for finding the eigenvalues and eigenvectors of a 3xx3 matrix is similar to that for the 2xx2 case. $\begingroup$ I have 4 5x5 matrices n1, n2, n3, n4. 2 π x 1 −1 = 8 −0. [ edit] Introduction. Ideal for low compression situations, the polyester/cotton weave provides excellent elasticity and recov. This means that it is the set of the n-tuples of real numbers (sequences of n real numbers). Definir el tamaño y márgenes del papel. \begin{frame} \frametitle{There Is No Largest Prime Number} \framesubtitle{The proof uses \textit{reductio ad absurdum}. Single formulas must be seperated with two backslashes \\ Use the matrix environment to typeset matrices. 0 Sage is free, open-source math software that supports research and teaching in algebra, geometry, number theory, cryptography, numerical computation, and related areas. You know, there is a stack exchange site for latex questions - user1228 Jan 10 '11 at 15:00 This question appears to be off-topic because it is about latex. \ vdots for vertical dots. Plotting in Scilab www. If neither A nor B is an identity matrix, AB ≠ BA. 10 01 12 34 = 12 34 12 34 10 01 = 12 34 Such matrices A and B are said to commute. There are three commonly used environments in the math mode: the math environment: Used for formulas in running text ; the displaymath environment: Used to display longer formulas ; the equation environment: Used for displaying equations for numbering and cross reference. #N#square root ("radical") Symbols in Geometry Symbols in Algebra. The process by which the rank of a matrix is determined can be illustrated by the following example. Click the "Insert" tab 2. 2 on Mepis Antix MX 14. dem autogenerated by webify. 2013;4:204173141350530. Textext aims to cover this need, by adding re-editable LaTeX objects to Inkscape’s repertoire. Here is a matrix of size 2 3 ("2 by 3"), because it has 2 rows and 3 columns: 10 2 015 The matrix consists of 6 entries or elements. 2 π−3 4+x 8 −1. In a double-blind, placebo-controlled, randomized study of 187 women receiving Climara 0. November 11, 2009 October 15, 2017 James 21 Comments. I tried computing conductance (stiffness) matrix in the physical coordinate systems and comparing the answer with isoparametric system. −3 4 7 0 + 6 −1. In order for a matrix $B$ to be the inverse of $A$, the equation $AB = I$ and $BA. 4 Fonts Font sizes Point size Latex cmd User-de ned * Sample 5 6 \tiny \xxxsmall the quick brown fox 7 8 \scriptsize \xxsmall the quick brown fox 8 10 \footnotesize \xsmall the quick brown fox. I am looking to get a colormap to assign a unique color to each point in a plot based on their four Ci values (i. (diag(A)) ij= ijA ij eig(A) Eigenvalues of the matrix A vec(A) The vector-version of the matrix A (see Sec. LaTeX Lesson 4 Mathematics in LaTeX. 4[U] 14 Matrix expressions. GroupWork 1: Mark each statement True or False. The theory was that the Real World was not actually real, but rather another level of the Matrix simulation: i. 6 Rubber/Stretching lengths. An extension to amsmath matrix environments. Please feel free to let us know if you have any question. The Matrix Behind The Scenes - Training Injuries (1999) - Keanu Reeves Movie HD - Duration: 1:33. Free Shipping on Everything* at Overstock - Your Online Bedroom Furniture Store! Get 5% in rewards with Club O! - Latex Mattresses. Define Vector and Matrix Data. Easily perform matrix multiplication with complex numbers. digits: Maximum number of digits for numeric columns, passed. where I denotes a unit matrix of order n. Some examples of conditional typesetting using the latex() function. The LaTeX3 project is a long-term research project to develop the next version of the LaTeX typesetting system. Easy to apply and tool. This comes from Mathematica (IIRC) and is not otherwise standardized, but there may be some disambiguation benefit in using the double-struck italic letters from Unicode’s Letterlike Symbols block: U+2148 ⅈ and U+2149 ⅉ. False, the vector spaces P3 and R^4 are isomorphic (4. input : output \begin{matrix} a_1 & a_2 & a_3 \\ b_1 & b_2 & b_3 \\ c_1 & c_2 & c_3 \end{matrix} matrix with parentheses brackets. LaTeX is a typesetting language for producing scientific documents. In linear algebra, the cofactor (sometimes called adjunct) describes a particular construction that is useful for calculating both the determinant and inverse of square matrices. [code]\begin{vmatrix} a & b \\ c & d \end{vmatrix} [/code]produces $\begin{vmatrix} a & b \\ c & d \end{vmatrix}$ [code]\det\begin{pmatrix} a & b \\ c. calculate expression inside first. Matrices with Examples and Questions with Solutions. 1 Matrix without names, everything set to NULL. We provide the highest standards of large format printing and installation services (including Vutek 5m 4 machines,Flora 3. A diagonal matrix whose non-zero entries are all 1 's is called an " identity " matrix, for reasons which will become clear when you learn how to multiply matrices. abelian group augmented matrix basis basis for a vector space characteristic polynomial commutative ring determinant determinant of a matrix diagonalization diagonal matrix eigenvalue eigenvector elementary row operations exam finite group group group homomorphism group theory homomorphism ideal inverse matrix invertible matrix kernel linear. In order for a matrix [latex]B$ to be the inverse of $A$, the equation $AB = I$ and [latex]BA. Latex Free. latex matrices First the basic environments which could be used for a matrix, all of them are provide by usepackage amsmath. 3 (Dot Prod. Learn from detailed step-by-step explanations Get walked through each step of the solution to know exactly what path gets you to the right answer. The prefix arc used for inverse circular trigonometric functions is the. Example 1: Find the inverse of. This is called the Falk's scheme. Infection Prevention. Most LaTeX commands are available including:. Click on "Matrix" 4. This site is supported by donations to The OEIS Foundation. 7 , B= 3 −3 12 0 dimension (or size) always given as (numbers of) rows × columns • Ais a 3×4matrix, B is 2×2 • the matrix Ahas four columns; B has two rows m×nmatrix is called square if m=n, fat if m Can be used to label the rows of the % resulting latex table. Matrix Elastic Bandages are our finest elastic bandages. I can't figure out how to use "Equation Tools" to enter a matrix with dimensions of my choosing. It's amazing, even though it's a bit slow, the idea of converting latex to an image is extremely useful and versatile :D. LaTeX is a very flexible program for typesetting math, but sometimes figuring out how to get the effect you want can be tricky. Also, you can add a multiple of one row to another row without changing the determinant. Polyester/cotton weave provides excellent elasticity, recoverability and breathability; Color-coded by size for quick identification; Features self-closure that keeps bandage wrapped and secure without the need for clips. This add-on lets you instantly convert every math equation in your document into beautiful latex images! Auto-Latex Equations Lab - Aayush Gupta. 3 bronze badges. com Knowledge base dedicated to Linux and applied mathematics. Subscripts & Superscripts. by interchanging the location of two rows, or interchanging the location of two columns. You can modify individual elements or perform arithmetic on entire vectors and matrices. Its syntax is much simpler than that of estout and, by default, it produces publication-style tables that display nicely in Stata's results window. 95) Also include 1 x 5V 4A (4000mA) switching power supply - UL Listed (\$ 14. For example \bigg[\begin{array}{c|c|c|c}. 4 tips for writing matrix questions Sarah Cho 2 min read A matrix question —or really, multiple questions presented on a grid—is one of the most popular question types in online and traditional pen-and-paper surveys. 4 Enumerate. Matrix Chain Multiplication (A O(N^2) Solution) Printing brackets in Matrix Chain Multiplication Problem. LAPACK addresses this problem by reorganizing the algorithms to use block matrix operations, such as matrix multiplication, in the innermost loops. Jump to navigation Jump to search. The following example shows you how to get a matrix into reduced row echelon form using elementary row operations. LaTeX Lesson 4 Mathematics in LaTeX. Does someone know how to convert an object of class dgCmatrix to a regular matrix. But nowadays there are many examples in which TEX is used for publications with no mathematical or technical background content. It is especially useful to write mathematical notation such as equations and formulae. An m × n (read 'm by n') matrix is an arrangement of numbers (or algebraic expressions ) in m rows and n columns. produces the graphic $$a^x_n$$. Restriction: In addition to the LaTeX command the unlicensed version will copy a reminder to purchase a license to the clipboard when you select a symbol. Numerical Linear Algebra with Applications 19 :3, 607-619. GNU Scientific Library Release 2. For example: \documentclass{article} \usepackage[pdftex]{graphicx} \begin{document} This is my first image. Tutorial o curso para escribir matrices dos formas, usando el entorno array o usando entornos ya definidos, matrix, pmatrix, vmatrix, bmatrix, en LaTeX utilizando Texmaker. Representing Systems of Linear Equations using Matrices A system of linear equations can be represented in matrix form using a coefficient matrix, a variable matrix, and a constant matrix. Some natural rubber sources, such as gutta-percha, are composed of trans-1,4-polyisoprene, a structural isomer that has similar properties. Maths for Physics University of Birmingham Mathematics Support Centre Authors: Daniel Brett Joseph Vovrosh Supervisors: Michael Grove Joe Kyle October 2015. The previous example was the 3 × 3 identity; this is the 4 × 4 identity: The 3 × 3 identity is denoted by I3 (pronounced as "eye-three" or "eye. The goal of this library is being an easy, but extensible interface between Python and LaTeX. The new row will be inserted immediately below the position of your cursor. I need to combine them into one 10x10 matrix with n1 in the top left corner, n2 in the top right, n3 in the bottom left and n4 in the bottom right, and I am using Mathematica 4. Note that any matrix of the form −2d a d a 0 b d b c does the job. When you write a matrix whose entries are fractions, you might feel the line are cramped. So, for example: It will not surprise you that: A + (-A) = 0 (Notice that that last zero is a bold-faced zero, designating the zero matrix. An m × n (read 'm by n') matrix is an arrangement of numbers (or algebraic expressions ) in m rows and n columns. Subscripts & Superscripts. For example if you multiply a matrix of 'n' x. 0 Sage is free, open-source math software that supports research and teaching in algebra, geometry, number theory, cryptography, numerical computation, and related areas. But nowadays there are many examples in which TEX is used for publications with no mathematical or technical background content. The theory was that the Real World was not actually real, but rather another level of the Matrix simulation: i. HTML LaTeX 公式编辑器可以生成图形公式 (gif, png, swf, pdf, emf). #N#square root ("radical") Symbols in Geometry Symbols in Algebra. How to multiply a Row by a Column? We'll start by showing how to multiply a 1 × n matrix by an n × 1 matrix. \begingroup I have 4 5x5 matrices n1, n2, n3, n4. You can nest enumerations to create detailed outlines. Enumerate is used to make numbered lists. 1 of the official documentation. Ideal for low compression situations, the polyester/cotton weave provides excellent elasticity and recov. I am making it simpler by considering for a 6 by 6 matrix. A CONSORT-style flowchart of a randomized controlled trial [Open in Overleaf] BER measurement on fibre optical system. input : output \begin{matrix} a_1 & a_2 & a_3 \\ b_1 & b_2 & b_3 \\ c_1 & c_2 & c_3 \end{matrix} matrix with parentheses brackets. Download Snip for desktop and start saving time. The LaTeX team cannot guarantee that TeX distributions, even recent ones, contain the most recent version of LaTeX. All the basic matrix operations as well as methods for solving systems of simultaneous linear equations are implemented on this site. Row and column labelling of matrixes in LaTeX. LaTeX Lesson 4 Mathematics in LaTeX. When you write a matrix whose entries are fractions, you might feel the line are cramped. So, the command first. There are no approved revisions of this page, so it may not have been reviewed. Creation of matrices and matrix multiplication is easy and natural: Note that in Sage, the kernel of a matrix A is the "left kernel", i. It makes sense that the number of prey present will affect the number of the predator. Please join the discussion on moodle. where I denotes a unit matrix of order n. Fractions and Roots. What's going on here? LaTeX Wiki contents Using LaTeX is a user's guide for LaTeX Using LaTeX to format documents tells you how to format a complete document using LaTeX Using LaTeX in a wiki describes the subset of LaTeX LaTeX language reference Document classes. Imagine turning a paper to the other side, that is what is happening. 95 per month (cancel anytime). Here are examples: Σ = ⎡ ⎢ ⎢⎣σ11 ⋯ σ1n ⋮ ⋱ ⋮ σn1 ⋯ σnn⎤ ⎥ ⎥⎦ σ 11 ⋯ σ 1 n ⋮ ⋱ ⋮ σ n 1 ⋯ σ n n. radio_button_uncheckedNo. There are different way of placing figures side by side in Latex, subcaption, subfig, subfigure, or even minipage. Use environments matrix for an array without brackets, and pmatrix environment for an array with parentheses. An example of a piecewise step function. X n converges to cin distribution, written X n c, if lim n!1 F n(t) = c(t) (8) at all t6=cwhere c(t) = 0 if t < français > Here are few examples to write quickly matrices. LaTeX2e in 90 minutes, by Tobias Oetiker, Hubert Partl, Irene Hyna, and Elisabeth Schlegl. LaTeX4technics. Gauss's Law, Faraday's Law, the non-existance of magnetic charge, and Ampere's Law are described in an intuitive method, with a focus on understanding above mathematics. tikz-pgf vertical-alignment tikz-matrix. LaTeX has different packages which automatically generates dummy text in our document. It is most often used for medium-to-large technical or scientific documents but it can be used for almost any form of publishing. 4 ! In the process of developing the Digital Library of Mathematical Functions , we needed a means of transforming the LaTeX sources of our material into XML which would be used for further manipulations, rearrangements and construction. The transposition is exactly the same for a non-square matrix. Let A be the following matrix LaTeX: \begin{bmatrix}5&-6&-12\\ 14 & 4&7 \end{bmatrix} [ 5 −6 −12 14 4 7 ] The dimensions of A are Expert Answer 100% (1 rating). 26, 2012 Most of the stock math commands are written for typesetting math or computer science papers for academic journals, so you might need to dig deeper into LaTeX commands to get the vector notation styles that are common in physics textbooks and articles. Product Services. No preview available. But the resulting 2 matrices are S4 object of class. 4 Enumerate. Cured caulk is mold and mildew resistant. A zero vector. Texmaker can also be used to edit and compile directly asymptote figure not embedded in a latex document. Latex Free. Así como cambiando el. MatrixForm prints SparseArray objects like the corresponding ordinary lists. The length of the skip should be expressed in a unit recognized by LaTeX. Here is a matrix of size 2 3 ("2 by 3"), because it has 2 rows and 3 columns: 10 2 015 The matrix consists of 6 entries or elements. To initialize an N-by-M matrix, use the “zeros” function. #README This repository contains the source files for Fundamentals of Matrix Algebra, by Gregory Hartman. To calculate inverse matrix you need to do the following steps. Produce beautiful documents starting from our gallery of LaTeX templates for journals, conferences, theses, reports, CVs and much more. Textext aims to cover this need, by adding re-editable LaTeX objects to Inkscape’s repertoire. This scaled our figure by a factor of 0. 3 7! 2 9! = 69! To obtain the second entry in the solution, ignore the first row of the first matrix. There are no approved revisions of this page, so it may not have been reviewed. Check that the two matrices can be multiplied together. That ends our list of the 10 best LaTex Editors that you should be using in 2020. is a square matrix. So to widen the gap between lines, use \\[6pt]. 1Introduction This document gives a gallery of tables which can be made using the xtable package to create LATEX output. This does seem silly. The inverse of a 2\times2 matrix is given by swapping the diagonal entries, negating the off-diagonal entries, and dividing by the determinant:\begin{pmatrix}a&b\\c&d\end{pmatrix}^{-1} = \frac{1}{ad-bc} \begin{pmatrix}d & -b \\ -c & a\end{pmatrix}. LaTeX Tutorial pt 6 - Tables and Matrices in LaTeX How to create a matrix larger than 3x3. The column space of a matrix A is the vector space made up of all linear combi nations of the columns of A. 4 He has reported that the amount of free latex protein that can be extracted from powdered latex gloves is consistently higher than the amount that is liberated from non-powdered gloves. Input LaTeX, Tex, AMSmath or ASCIIMath notation (Click icon to switch to ASCIIMath mode) to make formula. opagebreak[4] tells LaTeX not to break the page between the problem and the choices unless it really, really, really has to. Most rubber in everyday use is vulcanized to a point where it shares properties of both; i. Feedback and suggested improvements are welcome. My first equation is now (4). If a graph has vertices, we may associate an matrix which is called vertex matrix or adjacency matrix. External file 3. For example, to obtain in LaTeX, one would type. Eitan died unexpectedly in June 2009; we extend our sympathies to his family, and dedicate future work on the project to his memory. But nowadays there are many examples in which TEX is used for publications with no mathematical or technical background content. I have checked with a matrix calculator and the the determinants of the 3x3 minor matrices are correct. The second row of the original matrix becomes the second column of its transpose. Thus our source is a mixture of text to be typeset and a couple of LATEX commands \emph and \LaTeX. Wow, that is a twist. It is most often used for medium-to-large technical or scientific documents but it can be used for almost any form of publishing. Greek letters are commonly used in mathematics, and they are very easy to type in math mode. , then it tells us that all of space has been squished into a smaller dimension, e. That is, a Jordan matrix is a matrix with Jordan blocks down the diagonal and zeros everywhere else. 3, on Ms Windows 7/10 and Mac OS-X 10. Describe the range of a 3 by 4 matrix using the definition of the range. Among the three important vector spaces associated with a matrix of order m x n is the Null Space. Does someone know how to convert an object of class dgCmatrix > to a regular matrix. Steps 3 and 4 organize the values for the fields first by subcategory, and then by product. The identity matrix is a square matrix containing ones down the main diagonal and zeros everywhere else. The internal ones 2 and 2 tell you if the multiplication is possible (when they are equal) or not (when they are different). Symmetrical monomers such as ethylene and tetrafluoroethylene can join together in only one way. David Whiting david. Derivation of the stiffness matrix of a two-dimensional element (II) by victorroda Before we can continue with the assembly of the stiffness matrix, and in order to determine the matrix for each Gauss integration point , the element geometry matrix , the local derivative matrix , the jacobian matrix and its determinant, and the global. Return the matrix right division of x and y. LaTeX is a powerful tool to typeset math. Thanks for contributing an answer to Mathematica Stack Exchange! Please be sure to answer the question. Word 2016 automatically handles formatting, nonetheless, you can manually adjust the spacing and alignment of equations. VerkhovtsevaKatya. Click on row or column numbers to toggle whole row or column. Matrix algebra for beginners, Part I matrices, determinants, inverses Jeremy Gunawardena Department of Systems Biology Harvard Medical School 200 Longwood Avenue, Cambridge, MA 02115, USA [email protected] First, use a font like lmodern and then you can set the font size:. Enter the Matrix is the story behind the story. This is not a comprehensive list. We offer a wide selection of UltraClean™ surfactant-free latex microspheres—also referred to as latex beads—for research and commercial applications. Define Vector and Matrix Data. It is also suitable for producing all sorts of other documents, from simple letters to. 3 Null Space as a vector space. Stack Overflow for Teams is a private, secure spot for you and your coworkers to find and share information. 4) can be concisely expressed as min m 2 = m 0Σm s. A 4x4 matrix can be used to do both rotation and translation in a single matrix. 17pt have occurred. Email to friends Share on Facebook - opens in a new window or tab Share on Twitter - opens in a new window or tab Share on Pinterest - opens in a new window or tab. For example \bigg[\begin{array}{c|c|c|c}. The beamer class User Guide for version 3. One of the greatest motivating forces for Donald Knuth when he began developing the original TeX system was to create something that allowed simple construction of mathematical formulae, while looking professional when printed. Matrices and other arrays are produced in LaTeX using the \textbf{array} environment. If more arguments are given, the multiplication is. ( 0 0 −4 −5 0 3 0 0 −6) o* (0 3 0 −6) giving 0(0−0) = 0. \documentclass{article} \usepackage[left=2cm, right=5cm, top=2cm]{geometry} \begin{document} Some text … left margin is 2 cm, right margin 5 cm and the top margin is 2 cm. TeX4ht was created by Eitan Gurari at Ohio State University. Use the scale=1. Nodes and shapes 15. GroupWork 1: Mark each statement True or False. This keypad has 16 buttons, arranged in a telephone-line 4x4 grid. You must use the following package: \usepackage {amsmath} \begin {matrix} \begin {pmatrix} \begin {bmatrix} \begin {vmatrix} \begin {Vmatrix}. One of the octahedral sites is [ -1/2 1/4 5/6 ]^T , relative to the lattice basis. Just pick a symbol you sometimes need but tend to forget and click it. VerkhovtsevaKatya is a new contributor to this site. "matrix-like" diagrams, such as commutative diagrams,. 4 LaTeX default lengths. In the notebook and at the Sage command-line there is a pre-defined object named latex which has several methods, which you can list by typing latex. MatrixForm acts as a "wrapper", which affects printing, but not evaluation. There's no need to calculate. False, the vector spaces P3 and R^4 are isomorphic (4. opagebreak[4] tells LaTeX not to break the page between the problem and the choices unless it really, really, really has to. But we need a matrix that is linearly independent to both S1,S2. a = 2 1 3 A row vector is a list of numbers written one after the other, e. To initialize an N-by-M matrix, use the “zeros” function. This site is supported by donations to The OEIS Foundation. I can only select from the predefined Matrix sizes. If A is a square matrix, then there exists a matrix B such that AB equals the identity matrix. Overleaf is so easy to get started with that you'll be able to invite your non-LaTeX colleagues to contribute directly to your LaTeX documents. I want to write a 4x4 matrix in MS Word 2007 using equation editor. Use the inverse matrix to solve the system of equations. MediaWiki renders mathematical equations using a combination of html and a variant of LaTeX. An matrix J is said to be in Jordan canonical form if it is a matrix of the form where each is either a diagonal matrix or a Jordan block matrix. The author introduces it in Chapter Four using linear. You weren’t required to compute this,. This add-on lets you automatically convert every LaTeX equation in your document into beautiful images! Simply enclose your math equations within and click the button in the sidebar, and all. The process by which the rank of a matrix is determined can be illustrated by the following example. 0 Sage is free, open-source math software that supports research and teaching in algebra, geometry, number theory, cryptography, numerical computation, and related areas. Creation of matrices and matrix multiplication is easy and natural: Note that in Sage, the kernel of a matrix A is the “left kernel”, i. Carrie-Anne Moss was born and raised in Vancouver, Canada. If you know how to change this to I could just have \bmat{a&b}{c&d} and not even need \bmatrows{2}, then that would be even better. To find the inverse of matrix A, using Gauss-Jordan elimination, it must be found the sequence of elementary row operations that reduces A to the identity and, then, the same operations on I_n must be performed to obtain A^ {-1}. Click on "Insert" and choose what you want to add. By changing the font size locally, however, a single word, a few lines of text, a large table or. This matrix can be used to obtain more detailed information about the graph. We can also scale the picture by explicitly setting the width and the height by using the width and height optional commands. There are three commonly used environments in the math mode: the math environment: Used for formulas in running text ; the displaymath environment: Used to display longer formulas ; the equation environment: Used for displaying equations for numbering and cross reference. calculate expression inside first. Click the "Insert" tab 2. Here are examples: Σ = ⎡ ⎢ ⎢⎣σ11 ⋯ σ1n ⋮ ⋱ ⋮ σn1 ⋯ σnn⎤ ⎥ ⎥⎦ σ 11 ⋯ σ 1 n ⋮ ⋱ ⋮ σ n 1 ⋯ σ n n. Some of these commands are LATEX macros, while oth-. Basic equations in L a T e X can be easily "programmed", for. A User of Auto-LaTeX Equations. 95) ADD TO WISHLIST. 5 Basis of Null Space. com : Elastic Bandage, Latex Free, Self Closure, 4"X 5 Yds. No preview available. If output is a data type, it specifies the type of the resulting labeled feature array. This comes from Mathematica (IIRC) and is not otherwise standardized, but there may be some disambiguation benefit in using the double-struck italic letters from Unicode’s Letterlike Symbols block: U+2148 ⅈ and U+2149 ⅉ. The root of a quadratic equation however, can be either positive or negative. 5) has the matrix representation ⎛ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎝ 2 2 2 2 1 2 2 2 2 1 2 2 2 2 1 11 10 ⎞ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟. This article explains how to insert spaces of different lengths in mathematical mode. I need to combine them into one 10x10 matrix with n1 in the top left corner, n2 in the top right, n3 in the bottom left and n4 in the bottom right, and I am using Mathematica 4. 3 bronze badges. LaTeX is a typesetting language for producing scientific documents. I am looking to get a colormap to assign a unique color to each point in a plot based on their four Ci values (i. There are various ways to adjust the numbering in enumerate (search “latex and enumerate” in Google. My matrix contains fraction elements and single digit integers. There is no common notation for empty matrices, but most computer algebra systems allow creating and computing with them. Export (png, jpg, gif, svg, pdf) and save & share with note system. It doubles as a regression check for the package. The syntax is exactly the same. The mathematical symbol is produced using \partial. The idea behind the minipage command is that within an existing page "built in" an additional page. VerkhovtsevaKatya. Augmented Matrix Calculator is a free online tool that displays the resultant variable value of an augmented matrix for the two matrices. Get the free "inverse matrix" widget for your website, blog, Wordpress, Blogger, or iGoogle. I created a table in Latex, but currently it is too big. matrix list V symmetric V[3,3] weight displacement _cons weight 1. Suppose that we have the following diagonal matrix. calculate expression inside first. For example, if [A] is a 4 x 3 matrix (4 rows, 3 columns) and [B] is a 2 x 2 matrix (2 rows, 2. 2013;4:204173141350530. have a solution. You can think of these two points as "attractor points". The column space of a matrix A is the vector space made up of all linear combi nations of the columns of A. One of the octahedral sites is [ -1/2 1/4 5/6 ]^T , relative to the lattice basis. Use MathJax to format equations. MathJax basic tutorial and quick reference. Table 200: ℳ Letter-like Symbols. com and remembering the cases redefinition I’ve shown some days ago I got the idea to extend the internal macro \[email protected] of amsmath. They are organized into seven classes based on their role in a mathematical expression. Enumerate is used to make numbered lists. To create a new row, use. Jump to navigation Jump to search. You can nest enumerations to create detailed outlines. 2) sup Supremum of a set jjAjj Matrix norm (subscript if any denotes what norm) AT Transposed matrix A TThe inverse of the transposed and vice versa, A T = (A 1)T = (A ). You can generate them with just a few lines of code. a = 2 1 3 A row vector is a list of numbers written one after the other, e. The defining property for the gamma matrices to generate a Clifford algebra is the anticommutation relation {,} = + =,where {,} is the anticommutator, is the Minkowski metric with signature (+ − − −), and is the 4 × 4 identity matrix. So to convert a 3x3 matrix to a 4x4, you simply copy in the values for the 3x3 upper left block, like so:. edited yesterday. Out [1] //MatrixForm= Show the matrix form of a SparseArray:. Tutorial o curso para escribir matrices dos formas, usando el entorno array o usando entornos ya definidos, matrix, pmatrix, vmatrix, bmatrix, en LaTeX utilizando Texmaker. No preview available. | 2020-07-15T05:49:53 | {
"domain": "effebitrezzano.it",
"url": "http://rzby.effebitrezzano.it/4-4-matrix-latex.html",
"openwebmath_score": 0.7885562777519226,
"openwebmath_perplexity": 1173.5944962037668,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. Yes\n2. Yes",
"lm_q1_score": 0.9553191348157373,
"lm_q2_score": 0.9046505376715775,
"lm_q1q2_score": 0.864229968959003
} |
https://gmatclub.com/forum/how-many-zeros-does-100-end-with-100599.html?sort_by_oldest=true | GMAT Question of the Day - Daily to your Mailbox; hard ones only
It is currently 06 Dec 2019, 18:46
### GMAT Club Daily Prep
#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
we will pick new questions that match your level based on your Timer History
Track
Your Progress
every week, we’ll send you an estimated GMAT score based on your performance
Practice
Pays
we will pick new questions that match your level based on your Timer History
# How many zeros does 100! end with?
new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS:
### Hide Tags
Intern
Joined: 22 Jun 2010
Posts: 36
How many zeros does 100! end with? [#permalink]
### Show Tags
Updated on: 20 Feb 2019, 03:42
4
70
00:00
Difficulty:
5% (low)
Question Stats:
84% (00:30) correct 16% (01:08) wrong based on 1878 sessions
### HideShow timer Statistics
How many zeros does 100! end with?
A. 20
B. 24
C. 25
D. 30
E. 32
Spoiler: :: Solution
Find how many times the factor 5 is contained in 100!. That is, we have to find the largest such that 100! is divisible by . There are 20 multiples of 5 in the first hundred but 25, 50, 75, and 100 have to be counted twice because they are divisible by $$25 = 5^2$$ . So, the answer is 24.
The correct answer is B.
I have absolutely no Idea what they are telling me...
Can someone please post a simple explanation for the rationale behind the explanation, or (even better) provide an alternative simple approach?
Thanks!
Originally posted by AndreG on 07 Sep 2010, 13:41.
Last edited by Bunuel on 20 Feb 2019, 03:42, edited 1 time in total.
Renamed the topic and edited the question.
##### Most Helpful Expert Reply
Math Expert
Joined: 02 Sep 2009
Posts: 59587
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
07 Sep 2010, 13:49
34
31
AndreG wrote:
How many zeros does 100! end with?
• 20
• 24
• 25
• 30
• 32
expl.
Find how many times the factor 5 is contained in 100!. That is, we have to find the largest such that 100! is divisible by . There are 20 multiples of 5 in the first hundred but 25, 50, 75, and 100 have to be counted twice because they are divisible by $$25 = 5^2$$ . So, the answer is 24.
The correct answer is B.
I have absolutely no Idea what they are telling me...
Can someone please post a simple explanation for the rationale behind the explanation, or (even better) provide an alternative simple approach?
Thanks!
Trailing zeros:
Trailing zeros are a sequence of 0's in the decimal representation (or more generally, in any positional representation) of a number, after which no other digits follow.
Fro example, 125000 has 3 trailing zeros (125000);
The number of trailing zeros in the decimal representation of n!, the factorial of a non-negative integer n, can be determined with this formula:
$$\frac{n}{5}+\frac{n}{5^2}+\frac{n}{5^3}+...+\frac{n}{5^k}$$, where k must be chosen such that 5^(k+1)>n
It's more simple if you look at an example:
How many zeros are in the end (after which no other digits follow) of 32!?
$$\frac{32}{5}+\frac{32}{5^2}=6+1=7$$ (denominator must be less than 32, $$5^2=25$$ is less)
So there are 7 zeros in the end of 32!
The formula actually counts the number of factors 5 in n!, but since there are at least as many factors 2, this is equivalent to the number of factors 10, each of which gives one more trailing zero.
BACK TO THE ORIGINAL QUESTION:
According to above 100! has $$\frac{100}{5}+\frac{100}{25}=20+4=24$$ trailing zeros.
Answer: B.
For more on this issues check Factorials and Number Theory links in my signature.
Hope it helps.
_________________
##### General Discussion
Retired Moderator
Joined: 02 Sep 2010
Posts: 717
Location: London
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
18 Oct 2010, 02:40
feruz77 wrote:
the product of all integers from 1 to 100 will have the following number of zeros at the end:
a) 20
b) 24
c) 19
d) 22
e) 28
pls, help with solution method!
Search through the forums (read the math book). There is several threads discussing this.
The number of trailing zeros in 100! is (100/5)+(100/25)=24
Answer : (b)
_________________
Intern
Joined: 24 Jun 2010
Posts: 11
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
18 Oct 2010, 08:22
the question can be re-framed as (100!/10^x) now find x?
100!/(2*5)^x---now factorize 100! by 2 and 5
when factorized by 5 will give the least power 24
Ans 24
Director
Joined: 23 Apr 2010
Posts: 503
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
28 Dec 2010, 05:09
Is this a relevant GMAT question? Thank you.
Math Expert
Joined: 02 Sep 2009
Posts: 59587
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
28 Dec 2010, 05:22
nonameee wrote:
Is this a relevant GMAT question? Thank you.
Why do you think that it's not? I've seen several GMAT questions testing the trailing zeros concept (everything-about-factorials-on-the-gmat-85592.html):
factorial-one-106060.html
product-of-sequence-101187.html
how-many-zeroes-at-the-end-of-101752.html
least-value-of-n-m09q33-76716.html
number-properties-from-gmatprep-84770.html
_________________
Manager
Status: Student
Joined: 26 Aug 2013
Posts: 166
Location: France
Concentration: Finance, General Management
Schools: EMLYON FT'16
GMAT 1: 650 Q47 V32
GPA: 3.44
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
09 Jan 2014, 15:46
Hi Bunuel,
just a question that I have in mind:
You ALWAYS divide by 5? You never divide by another prime factor for those type of questions?
if yes what are the exceptions?
Thanks!
_________________
Think outside the box
Director
Affiliations: CrackVerbal
Joined: 03 Oct 2013
Posts: 563
Location: India
GMAT 1: 780 Q51 V46
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
09 Jan 2014, 23:59
2
1
1
AndreG wrote:
How many zeros does 100! end with?
A. 20
B. 24
C. 25
D. 30
E. 32
expl.
Find how many times the factor 5 is contained in 100!. That is, we have to find the largest such that 100! is divisible by . There are 20 multiples of 5 in the first hundred but 25, 50, 75, and 100 have to be counted twice because they are divisible by $$25 = 5^2$$ . So, the answer is 24.
The correct answer is B.
I have absolutely no Idea what they are telling me...
Can someone please post a simple explanation for the rationale behind the explanation, or (even better) provide an alternative simple approach?
Thanks!
100! = 1 x 2 x 3 x ..... x 100
10 = 5 x 2
2s are in abundance however there is limited supply of 5s
How many multiples of 5 are there from 1 to 100- One way is counting other way is 100/5 = 20
How many multiples of 25 are there which contain an extra five = 100/25 = 4
There is no point going forward as the next power of 5 is 125 which is greater than 100.
That does it: 20 + 4 = 24
_________________
- CrackVerbal Prep Team
For more info on GMAT and MBA, follow us on @AskCrackVerbal
Register for the Free GMAT Kickstarter Course : http://bit.ly/2DDHKHq
Register for our Personal Tutoring Course : https://www.crackverbal.com/gmat/personal-tutoring/
Join the free 4 part GMAT video training series : http://bit.ly/2DGm8tR
Math Expert
Joined: 02 Sep 2009
Posts: 59587
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
10 Jan 2014, 02:46
1
2
Paris75 wrote:
Hi Bunuel,
just a question that I have in mind:
You ALWAYS divide by 5? You never divide by another prime factor for those type of questions?
if yes what are the exceptions?
Thanks!
For trailing zeros we need only the power of 5. Check here for theory: everything-about-factorials-on-the-gmat-85592.html
Similar questions to practice:
if-n-is-the-greatest-positive-integer-for-which-2n-is-a-fact-144694.html
what-is-the-largest-power-of-3-contained-in-103525.html
if-n-is-the-product-of-all-positive-integers-less-than-103218.html
if-n-is-the-product-of-integers-from-1-to-20-inclusive-106289.html
if-n-is-the-product-of-all-multiples-of-3-between-1-and-101187.html
if-p-is-the-product-of-integers-from-1-to-30-inclusive-137721.html
what-is-the-greatest-value-of-m-such-that-4-m-is-a-factor-of-105746.html
if-6-y-is-a-factor-of-10-2-what-is-the-greatest-possible-129353.html
if-m-is-the-product-of-all-integers-from-1-to-40-inclusive-108971.html
if-p-is-a-natural-number-and-p-ends-with-y-trailing-zeros-108251.html
if-73-has-16-zeroes-at-the-end-how-many-zeroes-will-147353.html
find-the-number-of-trailing-zeros-in-the-expansion-of-108249.html
how-many-zeros-are-the-end-of-142479.html
how-many-zeros-does-100-end-with-100599.html
find-the-number-of-trailing-zeros-in-the-product-of-108248.html
if-60-is-written-out-as-an-integer-with-how-many-consecuti-97597.html
if-n-is-a-positive-integer-and-10-n-is-a-factor-of-m-what-153375.html
if-d-is-a-positive-integer-and-f-is-the-product-of-the-first-126692.html
Hope it helps.
_________________
Director
Joined: 17 Dec 2012
Posts: 623
Location: India
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
05 Apr 2014, 22:42
3
What does this question test?
It asks for the number of zeros 100! ends with. If a number ends with zero it has to be a multiple of 10. So essentially we have to find out how many times in 100! does multiplication by 10 happen. But multiplication by 10 also happens when multiplication by both 5 and 2 happen. So it is better to see the factors of the number and then find the number of times multiplication by all those factors happen.
Consider the simpler example. 4*5*6. How many zeros does it end with?
We see 2 occurs twice in 4 which is 2*2, and once in 6 which is 2*3 and 5 occurs only once. So 5 is a limiting factor. Since 5 occurs only once, the number of times multiplication by both 5 and 2 happen or in other words the number of times multiplication by 10 happens or the number of zeros the number ends with is only 1.
In the case of 100!, 5 occurs in 5, 10, 15, 20 and so on up to 100 i.e, 20 times. But remember 5 occurs twice in 25 which is 5*5 , twice in 50 which is 5*5*2 and similarly twice each in 75 and 100. So it actually occurs 24 times.
2 occurs a lot more times and so 5 is the limiting factor.
Applying the same logic as in the simpler example, the number of zeros 100! ends with is 24.
_________________
Srinivasan Vaidyaraman
Sravna Test Prep
http://www.sravnatestprep.com
Holistic and Systematic Approach
Intern
Joined: 08 Jun 2014
Posts: 4
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
10 Dec 2015, 19:33
Hi Guys,
Am still abit confused about the whole concept. Some clarification would be appreciated.
With the formula, I see that the trailing zeros for the following are:
1) For 32!, (32/5) + (32/25) = 7
2) For 25!, (25/5) + (25/25) = 6
3) For 10!, (10/5) = 2
4) For 5!, (5/5) = 1
However, as i plug the numbers in and count on the calculator, the answer is different
1) For 32!, 263,130,836,933,693,000,000,000,000,000,000,000. A total of 21 trailing zeros
2) For 25!, 15,511,210,043,331,000,000,000,000. A total of 12 trailing zeros
3) For 10!, 3,628,800. A total of 2 trailing zeros
4) For 5!, 120. A total of 1 trailing zeros
Why is it that the first 2 doesnt comply whereas the last 2 does. I mean I understand the answer is correct here but am just trying to get my head around this.
Math Expert
Joined: 02 Sep 2009
Posts: 59587
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
11 Dec 2015, 00:53
scottleey wrote:
Hi Guys,
Am still abit confused about the whole concept. Some clarification would be appreciated.
With the formula, I see that the trailing zeros for the following are:
1) For 32!, (32/5) + (32/25) = 7
2) For 25!, (25/5) + (25/25) = 6
3) For 10!, (10/5) = 2
4) For 5!, (5/5) = 1
However, as i plug the numbers in and count on the calculator, the answer is different
1) For 32!, 263,130,836,933,693,000,000,000,000,000,000,000. A total of 21 trailing zeros
2) For 25!, 15,511,210,043,331,000,000,000,000. A total of 12 trailing zeros
3) For 10!, 3,628,800. A total of 2 trailing zeros
4) For 5!, 120. A total of 1 trailing zeros
Why is it that the first 2 doesnt comply whereas the last 2 does. I mean I understand the answer is correct here but am just trying to get my head around this.
Use better calculator: http://www.wolframalpha.com
_________________
Senior Manager
Joined: 20 Aug 2015
Posts: 384
Location: India
GMAT 1: 760 Q50 V44
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
11 Dec 2015, 04:31
scottleey wrote:
Hi Guys,
Am still abit confused about the whole concept. Some clarification would be appreciated.
With the formula, I see that the trailing zeros for the following are:
1) For 32!, (32/5) + (32/25) = 7
2) For 25!, (25/5) + (25/25) = 6
3) For 10!, (10/5) = 2
4) For 5!, (5/5) = 1
However, as i plug the numbers in and count on the calculator, the answer is different
1) For 32!, 263,130,836,933,693,000,000,000,000,000,000,000. A total of 21 trailing zeros
2) For 25!, 15,511,210,043,331,000,000,000,000. A total of 12 trailing zeros
3) For 10!, 3,628,800. A total of 2 trailing zeros
4) For 5!, 120. A total of 1 trailing zeros
Why is it that the first 2 doesnt comply whereas the last 2 does. I mean I understand the answer is correct here but am just trying to get my head around this.
I think there is some problem with the calculator that you are using
32! = 263130836933693530167218012160000000
25! = 15511210043330985984000000
Both of these values comply with our understanding.
You can try the calculation here: http://www.calculatorsoup.com/calculato ... orials.php
Intern
Joined: 13 Feb 2017
Posts: 1
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
04 May 2017, 20:53
Bunuel wrote:
AndreG wrote:
How many zeros does 100! end with?
• 20
• 24
• 25
• 30
• 32
expl.
Find how many times the factor 5 is contained in 100!. That is, we have to find the largest such that 100! is divisible by . There are 20 multiples of 5 in the first hundred but 25, 50, 75, and 100 have to be counted twice because they are divisible by $$25 = 5^2$$ . So, the answer is 24.
The correct answer is B.
I have absolutely no Idea what they are telling me...
Can someone please post a simple explanation for the rationale behind the explanation, or (even better) provide an alternative simple approach?
Thanks!
Trailing zeros:
Trailing zeros are a sequence of 0's in the decimal representation (or more generally, in any positional representation) of a number, after which no other digits follow.
Fro example, 125000 has 3 trailing zeros (125000);
The number of trailing zeros in the decimal representation of n!, the factorial of a non-negative integer n, can be determined with this formula:
$$\frac{n}{5}+\frac{n}{5^2}+\frac{n}{5^3}+...+\frac{n}{5^k}$$, where k must be chosen such that 5^(k+1)>n
It's more simple if you look at an example:
How many zeros are in the end (after which no other digits follow) of 32!?
$$\frac{32}{5}+\frac{32}{5^2}=6+1=7$$ (denominator must be less than 32, $$5^2=25$$ is less)
So there are 7 zeros in the end of 32!
The formula actually counts the number of factors 5 in n!, but since there are at least as many factors 2, this is equivalent to the number of factors 10, each of which gives one more trailing zero.
BACK TO THE ORIGINAL QUESTION:
According to above 100! has $$\frac{100}{5}+\frac{100}{25}=20+4=24$$ trailing zeros.
Answer: B.
For more on this issues check Factorials and Number Theory links in my signature.
Hope it helps.
Hi All,
I have found a faster approach to solve these kind of questions:
For trailing zero's: we need to check how many 5's are there in the number. So we can just divide the n by 5 and add the quotients:
100!
5 | 100
5 | 20
5 | 4
5 | 0
Add 20+4+0 = 24
Target Test Prep Representative
Status: Head GMAT Instructor
Affiliations: Target Test Prep
Joined: 04 Mar 2011
Posts: 2809
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
14 Jul 2018, 19:12
AndreG wrote:
How many zeros does 100! end with?
A. 20
B. 24
C. 25
D. 30
E. 32
We are looking the number of 2-and-5 pairs in 100! since each pair produces a factor of 10 and thus a 0 at the end of 100!. There are more factors of 2 than 5 in 100!, so the question is: how many factors 5 are there?
We can use the following trick: Divide 100 by 5 and its subsequent quotients by 5 as long as the quotient is nonzero (and each time ignore any nonzero remainder). The final step is add up all these nonzero quotients and that will be the number of factors of 5 in 100!.
100/5 = 20
20/5 = 4
Since 4/5 has a zero quotient, we can stop here. We see that 20 + 4 = 24, so there are 24 factors 5 (and hence 10) in 100!. So 100! ends with 24 zeros.
Answer: B
_________________
# Jeffrey Miller
Head of GMAT Instruction
[email protected]
122 Reviews
5-star rated online GMAT quant
self study course
See why Target Test Prep is the top rated GMAT quant course on GMAT Club. Read Our Reviews
If you find one of my posts helpful, please take a moment to click on the "Kudos" button.
Intern
Joined: 08 Oct 2018
Posts: 2
Location: Ukraine
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
16 Nov 2018, 04:51
AndreG wrote:
How many zeros does 100! end with?
A. 20
B. 24
C. 25
D. 30
E. 32
expl.
Find how many times the factor 5 is contained in 100!. That is, we have to find the largest such that 100! is divisible by . There are 20 multiples of 5 in the first hundred but 25, 50, 75, and 100 have to be counted twice because they are divisible by $$25 = 5^2$$ . So, the answer is 24.
The correct answer is B.
I have absolutely no Idea what they are telling me...
Can someone please post a simple explanation for the rationale behind the explanation, or (even better) provide an alternative simple approach?
Thanks!
I took 100! in excel, and I've got this = 9.3326E+157
So, 100! ends with a lot more 0 than 24.
Did i miss something?
Really appreciated for explanation.
Math Expert
Joined: 02 Sep 2009
Posts: 59587
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
16 Nov 2018, 04:54
2
olgaromazan wrote:
AndreG wrote:
How many zeros does 100! end with?
A. 20
B. 24
C. 25
D. 30
E. 32
expl.
Find how many times the factor 5 is contained in 100!. That is, we have to find the largest such that 100! is divisible by . There are 20 multiples of 5 in the first hundred but 25, 50, 75, and 100 have to be counted twice because they are divisible by $$25 = 5^2$$ . So, the answer is 24.
The correct answer is B.
I have absolutely no Idea what they are telling me...
Can someone please post a simple explanation for the rationale behind the explanation, or (even better) provide an alternative simple approach?
Thanks!
I took 100! in excel, and I've got this = 9.3326E+157
So, 100! ends with a lot more 0 than 24.
Did i miss something?
Really appreciated for explanation.
In short - don't trust Excel, trust experts above.
100! = 93326215443944152681699238856266700490715968264381621468592963895
217599993229915608941463976156518286253697920827223758251185210916864
000000000000000000000000
_________________
Intern
Joined: 03 Apr 2018
Posts: 38
Re: How many zeros does 100! end with? [#permalink]
### Show Tags
20 Sep 2019, 06:16
Bunuel wrote:
AndreG wrote:
How many zeros does 100! end with?
• 20
• 24
• 25
• 30
• 32
expl.
Find how many times the factor 5 is contained in 100!. That is, we have to find the largest such that 100! is divisible by . There are 20 multiples of 5 in the first hundred but 25, 50, 75, and 100 have to be counted twice because they are divisible by $$25 = 5^2$$ . So, the answer is 24.
The correct answer is B.
I have absolutely no Idea what they are telling me...
Can someone please post a simple explanation for the rationale behind the explanation, or (even better) provide an alternative simple approach?
Thanks!
Trailing zeros:
Trailing zeros are a sequence of 0's in the decimal representation (or more generally, in any positional representation) of a number, after which no other digits follow.
Fro example, 125000 has 3 trailing zeros (125000);
The number of trailing zeros in the decimal representation of n!, the factorial of a non-negative integer n, can be determined with this formula:
$$\frac{n}{5}+\frac{n}{5^2}+\frac{n}{5^3}+...+\frac{n}{5^k}$$, where k must be chosen such that 5^(k+1)>n
It's more simple if you look at an example:
How many zeros are in the end (after which no other digits follow) of 32!?
$$\frac{32}{5}+\frac{32}{5^2}=6+1=7$$ (denominator must be less than 32, $$5^2=25$$ is less)
So there are 7 zeros in the end of 32!
The formula actually counts the number of factors 5 in n!, but since there are at least as many factors 2, this is equivalent to the number of factors 10, each of which gives one more trailing zero.
BACK TO THE ORIGINAL QUESTION:
According to above 100! has $$\frac{100}{5}+\frac{100}{25}=20+4=24$$ trailing zeros.
Answer: B.
For more on this issues check Factorials and Number Theory links in my signature.
Hope it helps.
Hi Bunuel, can you please explain why K = 2 and not k=3 this time as 125>100. (as explained in the formula above 5^(K+1)>n
Re: How many zeros does 100! end with? [#permalink] 20 Sep 2019, 06:16
Display posts from previous: Sort by
# How many zeros does 100! end with?
new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne | 2019-12-07T01:47:20 | {
"domain": "gmatclub.com",
"url": "https://gmatclub.com/forum/how-many-zeros-does-100-end-with-100599.html?sort_by_oldest=true",
"openwebmath_score": 0.8042828440666199,
"openwebmath_perplexity": 1646.7932991234186,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. Yes\n2. Yes\n",
"lm_q1_score": 0.9511422213778251,
"lm_q2_score": 0.9086179037377831,
"lm_q1q2_score": 0.8642248513448179
} |
https://math.stackexchange.com/questions/1892082/prove-that-x-is-rational-where-x-is-mixed-with-other-variables | # Prove that $x$ is rational where $x$ is mixed with other variables
Hi I am trying to complete the following question in my practice:
Suppose a, b, c are integers and x, y and z are non-zero real numbers that satisfy the following equations:
$$\cfrac{xy}{x+y} = a \quad and \quad \cfrac{xz}{x+z} = b \quad and \quad \cfrac{yz}{y+z} = c$$
Prove that $x$ is rational
Source: Discrete Mathematics with Applications 4th edition
I tried combining the equations and logically conclude that $x$ is rational but to no avail as I do not know how to separate $x$ from the rest of the variables. The only starting point that I have is the theorem for rational numbers:
$$if \; x \in \mathbb{Q}, \; x = \cfrac{a}{b} \; where \; a,b \in \mathbb{Z} \; and \; b \neq 0$$
I have no other idea how to carry on from here. Could someone please advise me?
• The question you quote doesn't go on to say to prove $x,y,z$ are rational, but I assume that's what you meant. Did you just forget to include that question at the end? – coffeemath Aug 14 '16 at 15:41
• Thanks for spotting the mistake. I have corrected my post. – LanceHAOH Aug 14 '16 at 16:28
By rewriting we get
$$\frac{xy}{x+y} = \frac{1}{\frac{1}{x}+\frac{1}{y}}$$
so we can rewrite the equations as $$\frac{1}{x}+\frac{1}{y} = \frac{1}{a}, ~~\frac{1}{x}+\frac{1}{z} = \frac{1}{b}, ~~\frac{1}{y}+\frac{1}{z} = \frac{1}{c}.$$
This is a regular system of linear equations in $\frac{1}{x}, \frac{1}{y}$ and $\frac{1}{z}$, and since all the coefficients are in $\mathbb{Q}$, the solutions must be in $\mathbb{Q}$ as well. Feel free to solve that last system if you like.
• I don't understand why solution has to be rational since coefficients are rational – LanceHAOH Aug 14 '16 at 16:48
• If we interpret the LES as a linear equation system over the field of rational numbers, we have nonzero determinant and get a unique rational solution. If we interpret the LES as a linear equation system over the field of real numbers, we still have nonzero determinant and get a unique real solution. Since the rational solution is also a real solution, both solutions must be identical. – Anon Aug 14 '16 at 16:59
Since $x,y,z$ are nonzero one can define $u=1/x,v=1/y,w=1/z,$ and it also follows from the given equations that none of $a,b,c$ are zero. So we can also put $d=1/a,e=1/b,f=1/c.$ Now the equations, after taking reciprocals, are $u+v=d,u+w=e,v+w=f$ which can be solved rationally for $u,v,w.$
Suppose $x$ is irrational. Then
$$\frac{\frac{xy}{x+y}}{\frac{xz}{x+z}} = \frac ab$$, since $b \ne 0$. Now
$$\frac{xy(x+z)}{xz(x+y)} = \frac ab \implies \frac{x+z}{x+y} = \frac{az}{by} = q \in \Bbb Q$$, since $y \ne 0$
So $x+z = qx+qy \implies (1-q)x = qy - z \in \Bbb Q$, but then $1-q \notin \Bbb Q$ ! Thus, leading to a contradiction.
Note that this same argument could be applied to $y, z$ as well, so it shows at once that all of them have to be rational.
Inverting the equations shows $\,x^{-1}\!+y^{-1},\,\ z^{-1}\!+x^{-1},\,\ \color{#c00}{y^{-1}\!+z^{-1}}\in \Bbb Q,\$ i.e. are all rational.
Adding them $\ 2(x^{-1}\!+y^{-1}\!+z^{-1}) =:q\in \Bbb Q\$ so $\ x^{-1} = q/2-(\color{#c00}{y^{-1}\!+z^{-1}}) \in\Bbb Q.\ \$ QED
• How does being able to invert indicate that the expressions are rational? – LanceHAOH Aug 14 '16 at 17:51
• @Lance Inverting equation $\,1\,$ yields $\,\dfrac{x+y}{xy} = \dfrac{1}a,\$ i.e. $\,y^{-1}\!+x^{-1} = a^{-1}\in \Bbb Q,\,$ etc for others. – Bill Dubuque Aug 14 '16 at 17:54 | 2020-01-19T05:24:42 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/1892082/prove-that-x-is-rational-where-x-is-mixed-with-other-variables",
"openwebmath_score": 0.8621484637260437,
"openwebmath_perplexity": 182.12232761416328,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9793540686581882,
"lm_q2_score": 0.8824278618165526,
"lm_q1q2_score": 0.8642093167673863
} |
https://math.stackexchange.com/questions/2700749/a-closed-ball-in-a-metric-space-is-closed | # A closed ball in a metric space is closed
Prove that any closed ball in a metric space is closed.
(Note that this is not a duplicate as this is a proof verification question and have a different proof, in my opinion, as compared to other proofs on this site)
My Attempted Proof: Let $(X, d)$ be a metric space. Pick a closed ball $\Phi = \overline{B(x, r)} = \{y \in X \ | \ d(x, y) \leq r\}$. Note that at this moment in time $\overline{B(x, r)}$ is just a notation, we don't know if $\Phi$ is actually closed.
We now show that $\Phi$ is closed. To do this we show that $X \setminus \Phi$ is open. Observe that $X \setminus \Phi = \{y \in X \ | \ d(x, y) > r\}$. Pick $y \in X \setminus \Phi$. For this $y$ we have $d(x, y) > r$ which implies that $d(x, y) = r + \epsilon$ for some $\epsilon > 0$.
We claim that $B(y, \epsilon) \subseteq X \setminus \Phi$. To prove this claim, pick $z \in B(y, \epsilon)$. We now show that $z \in X \setminus \Phi$ by showing that $d(x, z) > r$. To that end observe that the triangle inequality gives us
\begin{align*} & d(x, y) \leq d(x, z) + d(z, y) \\ & \implies \epsilon + r \leq d(x, z) + d(y, z) \\ & \implies \epsilon + r < d(x, z) + \epsilon \ \ \ \ \ \ \ \ \ \text{since $d(y, z) < \epsilon$} \\ & \implies r < d(x, z) \end{align*}
as desired. Hence $z \in X \setminus \Phi$ and we have $B(y, \epsilon) \subseteq X \setminus \Phi$, and since $y$ was arbitrary we have that $X \setminus \Phi$ is an open set in $(X, d)$ and thus $\Phi$ is a closed set. $\square$
Is this a rigorous and satisfactory proof? Can it be improved in any way?
• yes, its correct. I assume, from the proof, that an open set was defined as a set where there exists some open ball centered at every point that is contained in the set. – Masacroso Mar 20 '18 at 19:52
• Note that the notation of $\overline{B(x,r)}$ is reserved for the closure of the open ball, rather than the closed ball. – TrostAft Mar 20 '18 at 19:55
• why $d(y,z)<\varepsilon$ with the same $varepsilon$ of $r-\varepsilon$? – gbox Jul 23 at 14:52
$\overline{B(x, r)}$ is used for the closure of the open ball B(x, r) not the closed ball.
$\overline{B}(x,r)$ is a better notation for a closed ball.
Yes, it is rigorous and satisfactory. It can be shortened, though:$$d(x,z)\geqslant d(x,y)-d(z,y)>r+\varepsilon-\varepsilon=r.$$ | 2019-10-18T18:30:58 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2700749/a-closed-ball-in-a-metric-space-is-closed",
"openwebmath_score": 0.9971770644187927,
"openwebmath_perplexity": 102.84846519537312,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9811668706602658,
"lm_q2_score": 0.880797085800514,
"lm_q1q2_score": 0.8642089203615719
} |
https://pythonnumericalmethods.berkeley.edu/notebooks/chapter17.05-Newtons-Polynomial-Interpolation.html | This notebook contains an excerpt from the Python Programming and Numerical Methods - A Guide for Engineers and Scientists, the content is also available at Berkeley Python Numerical Methods.
The copyright of the book belongs to Elsevier. We also have this interactive book online for a better learning experience. The code is released under the MIT license. If you find this content useful, please consider supporting the work on Elsevier or Amazon!
Newton’s Polynomial Interpolation¶
Newton’s polynomial interpolation is another popular way to fit exactly for a set of data points. The general form of the an $$n-1$$ order Newton’s polynomial that goes through $$n$$ points is:
$f(x) = a_0 + a_1(x-x_0) + a_2(x-x_0)(x-x_1) + \dots + a_n(x-x_0)(x-x_1)\dots(x-x_n)$
which can be re-written as:
$f(x) = \sum_{i=0}^{n}{a_in_i(x)}$
where $$$n_i(x) = \prod_{j=0}^{i-1}(x-x_j)$$$
The special feature of the Newton’s polynomial is that the coefficients $$a_i$$ can be determined using a very simple mathematical procedure. For example, since the polynomial goes through each data points, therefore, for a data points $$(x_i, y_i)$$, we will have $$f(x_i) = y_i$$, thus we have
$f(x_0) = a_0 = y_0$
And $$f(x_1) = a_0 + a_1(x_1-x_0) = y_1$$, by rearranging it to get $$a_1$$, we will have:
$a_1 = \frac{y_1 - y_0}{x_1 - x_0}$
Now, insert data points $$(x_2, y_2)$$, we can calculate $$a_2$$, and it is in the form:
$a_2 = \frac{\frac{y_2 - y_1}{x_2 - x_1} - \frac{y_1 - y_0}{x_1 - x_0}}{x_2 - x_0}$
Let’s do one more data points $$(x_3, y_3)$$ to calculate $$a_3$$, after insert the data point into the equation, we get:
$a_3 = \frac{\frac{\frac{y_3-y_2}{x_3-x_2} - \frac{y_2 - y_1}{x_2-x_1}}{x_3 - x_1} - \frac{\frac{y_2-y_1}{x_2-x_1}-\frac{y_1 - y_0}{x_1 - x_0}}{x_2-x_0}}{x_3 - x_0}$
Now, see the patterns? These are called divided differences, if we define:
$f[x_1, x_0] = \frac{y_1 - y_0}{x_1 - x_0}$
$f[x_2, x_1, x_0] = \frac{\frac{y_2 - y_1}{x_2 - x_1} - \frac{y_1 - y_0}{x_1 - x_0}}{x_2 - x_0} = \frac{f[x_2,x_1] - f[x_1,x_0]}{x_2-x_1}$
We continue write this out, we will have the following iteration equation:
$f[x_k, x_{k-1}, \dots, x_{1}, x_0] = \frac{f[x_k, x_{k-1}, \dots, x_{2}, x_2] - f[x_{k-1}, x_{k-2}, \dots, x_{1}, x_0]}{x_k-x_0}$
We can see one beauty of the method is that, once the coefficients are determined, adding new data points won’t change the calculated ones, we only need to calculate higher differences continues in the same manner. The whole procedure for finding these coefficients can be summarized into a divided differences table. Let’s see an example using 5 data points:
$\begin{split} \begin{array}{cccccc} x_0 & y_0 \\ & & f[x_1,x_0] \\ x_1 & y_1 & & f[x_2, x_1,x_0]\\ & & f[x_2,x_1] & & f[x_3, x_2, x_1,x_0]\\ x_2 & y_2 & & f[x_3, x_2,x_1] & & f[x_4, x_3, x_2, x_1,x_0]\\ & & f[x_3,x_2] & & f[x_4, x_3, x_2, x_1]\\ x_3 & y_3 & & f[x_4, x_3,x_2]\\ & & f[x_4,x_3] \\ x_4 & y_4 \end{array} \end{split}$
Each element in the table can be calculated using the two previous elements (to the left). In reality, we can calculate each element and store them into a diagonal matrix, that is the coefficients matrix can be write as:
$\begin{split} \begin{array}{cccccc} y_0 & f[x_1,x_0] & f[x_2, x_1,x_0] & f[x_3, x_2, x_1,x_0] & f[x_4, x_3, x_2, x_1,x_0]\\ y_1 & f[x_2,x_1] & f[x_3, x_2,x_1] & f[x_4, x_3, x_2, x_1] & 0\\ y_2 & f[x_3,x_2] & f[x_4, x_3,x_2] & 0 & 0 \\ y_3 & f[x_4,x_3] & 0 & 0 & 0 \\ y_4 & 0 & 0 & 0 & 0 \end{array} \end{split}$
Note that, the first row in the matrix is actually all the coefficients that we need, i.e. $$a_0, a_1, a_2, a_3, a_4$$. Let’s see an example how we can do it.
TRY IT! Calculate the divided differences table for x = [-5, -1, 0, 2], y = [-2, 6, 1, 3].
import numpy as np
import matplotlib.pyplot as plt
plt.style.use('seaborn-poster')
%matplotlib inline
def divided_diff(x, y):
'''
function to calculate the divided
differences table
'''
n = len(y)
coef = np.zeros([n, n])
# the first column is y
coef[:,0] = y
for j in range(1,n):
for i in range(n-j):
coef[i][j] = \
(coef[i+1][j-1] - coef[i][j-1]) / (x[i+j]-x[i])
return coef
def newton_poly(coef, x_data, x):
'''
evaluate the newton polynomial
at x
'''
n = len(x_data) - 1
p = coef[n]
for k in range(1,n+1):
p = coef[n-k] + (x -x_data[n-k])*p
return p
x = np.array([-5, -1, 0, 2])
y = np.array([-2, 6, 1, 3])
# get the divided difference coef
a_s = divided_diff(x, y)[0, :]
# evaluate on new data points
x_new = np.arange(-5, 2.1, .1)
y_new = newton_poly(a_s, x, x_new)
plt.figure(figsize = (12, 8))
plt.plot(x, y, 'bo')
plt.plot(x_new, y_new)
[<matplotlib.lines.Line2D at 0x11bd4e630>]
We can see that the Newton’s polynomial goes through all the data points and fit the data. | 2022-06-26T11:03:53 | {
"domain": "berkeley.edu",
"url": "https://pythonnumericalmethods.berkeley.edu/notebooks/chapter17.05-Newtons-Polynomial-Interpolation.html",
"openwebmath_score": 0.979290783405304,
"openwebmath_perplexity": 5156.543139866614,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9926541749467245,
"lm_q2_score": 0.8705972667296309,
"lm_q1q2_score": 0.8642020115163752
} |
https://math.stackexchange.com/questions/2329528/can-a-binary-operation-have-an-identity-element-when-it-is-not-associative-and-c/2329532 | # Can a binary operation have an identity element when it is not associative and commutative?
I tried getting the answers in similar questions, everyone says that it's not necessary, but if $e$ is the identity element for any binary operation $*$, which is not associative and commutative, how can
$$a*e=a=e*a$$
when it is not commutative, i.e. $a*b \ne b*a$?
Even if we get a value by solving $a*e=a$. Will we get the same value by solving $e*a=a$ ? Please provide an example.
• If $\ast$ has both a left identity $l$ and a right identity $r$, then $l = l \ast r = r$. – Travis Willse Jun 20 '17 at 12:54
• See the wikipedia article on quasigroups, and specifically the section on loops. It has the additional assumption of divisibility, and as such left and right inverses, but is otherwise exactly what you're looking for. The examples section includes such familiar things as the integers with the subtraction operation and the non-zero rationals, reals or complex numbers with division. – Arthur Jun 21 '17 at 9:03
Asserting that the operation $$*$$ is not commutative means that there are elements $$a$$ and $$b$$ such that $$a*b\neq b*a$$. It does not mean that $$a*b\neq b*a$$ for any two distinct elements $$a$$ and $$b$$. Therefore, an operation may well not be commutative and, even so, to have an identity element. There is no contradiction here.
For an example of a non-commutative and non-associative algebraic structure with an identity element, take, for instance, the octonions.
An operation is commutative if for any $a$ and $b$, we have $ab=ba$. Finding one pair $a,b$ such that $ab=ba$ doesn't prove the operation is commutative; this has to hold for every pair.
Consider the set $\{a,b,c\}$ whose binary operation $\cdot$ is given by the following: $$a\cdot a = a\,\,\,\,\,\,\,\,\,\,\, a\cdot b=b\,\,\,\,\,\,\,\,\,\,\,a\cdot c=c$$ $$b\cdot a = b\,\,\,\,\,\,\,\,\,\,\, b\cdot b=b\,\,\,\,\,\,\,\,\,\,\,b\cdot c=c$$ $$c\cdot a = c\,\,\,\,\,\,\,\,\,\,\, c\cdot b=b\,\,\,\,\,\,\,\,\,\,\,c\cdot c=a$$ This operation has $a$ as an identity element. However, it is not commutative (since $b\cdot c\neq c\cdot b$) and it is not associative (since $b\cdot(c\cdot c)=b\neq a =(b\cdot c)\cdot c$).
Actually, given any set $S$ and operation $*$ on it (so possibly neither associative nor commutative), we can simply extend this with a new symbol $\color{red}0$ (i.e., $\color{red}0\notin S$) and on the set $S':=S\cup\{\color{red}0\}$ define an operation $\color{red}*$ by $$x\color{red}*y:=\begin{cases}x&\text{if }y=\color{red}0\\ y&\text{if }x=\color{red}0\\x*y&\text{otherwise} \end{cases}$$ Then $\color{red}*$ is not associative/commutative if $*$ is not associative/commutative. But $\color{red}0$ is neutral.
• Nice. Since all operators with identity can be viewed as arising from this process and because the probability that a randomly choses operator on a set with $n$ elements is either commutative or associative tends to $0$ as $n \rightarrow \infty$, you can show that most operators with identity are neither associative nor commutative. – John Coleman Jun 21 '17 at 13:21
It is possible. $*$ not being commutative means that $a*b\neq b*a$ for some $a,b$, not for all of them. So you may have $a*e=e*a=a$ without contradicting that $*$ is not commutative.
Without looking for esoteric and/or ad hoc examples, there is one you are certainly familiar with. The identity matrix is the identity element for matrix multiplication, which is not commutative. We have $A\,I=I\,A=A$ while in general $A\,B \neq B\,A$.
• This is nice, because although the OP mentioned nonassociativity, the only property invoked in her/his argument is noncommutativity. Therefore matrix addition is a good, familiar example. – Ben Crowell Jun 20 '17 at 21:45
Isn't subtraction a binary function which has an identity ($x-0=x$) although it is not commutative ($5-0 > 0-5$) or associative ($5-(4-3) > (5-4)-3$)?
• Zero is only a right-identity for subtraction. $0 - x = x$ fails. – Zach Effman Jun 20 '17 at 18:45
• Besides, in abstract algebra, subtraction is literally addition. – Obinna Nwakwue Jun 21 '17 at 14:12
• @ObinnaNwakwue, I think one has to be careful with such a statement. Subtraction is literally defined in terms of addition (and additive inverses), but it is not literally addition, any more than multiplication of natural numbers is literally addition because it is defined in terms of it. – LSpice Jun 21 '17 at 22:12
• Yeah, you are right there. – Obinna Nwakwue Jun 22 '17 at 1:53
Can a binary operation have an identity element when it is not associative and commutative?
Yes. Any non-commutative loop is an example of such algebraic structure. I am surprised that, searching the word loop with Ctrl + F in this page just before answering, I found only one occurrence in the comment by Arthur.
(...) how can
$$a*e=a=e*a$$
when it is not commutative (...) ?
As in the accepted answer, the operation $$*$$ is by definition commutative on the set $$A$$, if and only if $$a*b=b*a$$ for all $$a,b\in A$$.
No surprise if, in a given operation on a given set $$A$$, only some elements of $$A$$ commute with all the others: in a non-commutative binary operation with two-sided identity, the identity element commutes with all the others elements. Indeed, the definition of identity element $$e$$ for the binary operation $$*$$ on a set $$A$$ states: $$a*e=a=e*a,\quad\forall\,a\in A.$$
Of course :) And, further, we can create without too much effort an example which is even less than a loop. The finite magma of order $$4$$ given by the Cayley table $$\begin{array}{c|cccc} * & 1 & 2 & 3 & 4\\ \hline 1 & \color{red}{1} & \color{red}{2} & \color{red}{3} & \color{red}{4}\\ 2 & \color{red}{2} & 4 & 3 & 3\\ 3 & \color{red}{3} & 3 & 4 & 2\\ 4 & \color{red}{4} & 1 & 1 & 1\\ \end{array}$$ has the two-sided identity element $$1$$ while cancellation and division do not hold, it is not commutative since - e.g. - $$2*4\ne 4*2$$ and it is not even associative: $$(2*3)*4=3*4=2\ne 4=2*2=2*(3*4).$$ | 2020-09-18T08:12:17 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2329528/can-a-binary-operation-have-an-identity-element-when-it-is-not-associative-and-c/2329532",
"openwebmath_score": 0.804413378238678,
"openwebmath_perplexity": 192.63374610882846,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9706877717925422,
"lm_q2_score": 0.8902942159342104,
"lm_q1q2_score": 0.8641977087049671
} |
https://patriciabarber.com/i-said-yto/4128a8-theorem-of-cyclic-quadrilateral-class-10 | For Study plan details. ∴ ∠ZTX = $$\frac { 1 }{ 2 }$$ m(arc WY) + m(arc ZX)] = $$\frac { 1 }{ 2 }$$ (54° – 23°) It is a type of cyclic quadrilateral. By theorem of touching circles, points X, Z, (∠1 + ∠2) + (∠7 + ∠8) = 180° m(arc ACB) = 360° – m(arc AB) [Measure of a circle is 360°] m(arc QSR) = m(arc QS) + m(arc SR) [Arc addition property] Question and Answer forum for K12 Students. ∴ m(arc QSR) = 210°, Question 15. ∴ AD = AH + DH [A – H – D] ∴ ∠OFB + ∠ODB = 180° Solution: seg BE ⊥ side AC, Draw circles with centres A, B and C each of radius 3 cm, such that each circle touches the other two circles. Answer: (A) Note: It cannot be square as the angles are not mentioned as 90°. (D) Isosceles triangle ∴ ∠OFA + ∠OEA = 180° In class 10 Maths, a lot of important theorems are introduced which forms the base of mathematical concepts. To prove: Points A, B and C are not collinear. The bisector of ∠ACB intersects the circle at point D. Prove that, seg AD ≅ seg BD. ∠EFG = $$\frac { 1 }{ 2 }$$ m (arcEG)] (ii) [Inscribed angle theorem] iii. PQ is the radius = 12 cm. internally at E. ∴ AB = AC = OB = OC [From (i) and (ii)] ∠OFB ∠ODB = 90° [Given] and seg OR is the secant. Watch Cyclic Quadrilateral Theorem and its Converse in English from Cyclic Quadrilateral here. Also, ∠QTS = ∠QAS [Angles inscribed in the same arc] ∴ 25x – x2 = 144 At what distance will each of them be from point P? Concept of opposite angles of a quadrilateral. Find the measure of ∠C? From 6 Now, $$\frac { MS }{ SR }$$ = $$\frac { 6 }{ 3 }$$ = $$\frac { 2 }{ 1 }$$ Draw a chord AB and central ∠ACB. ∴ Point O lies on the perpendicular bisector of AB. If AB = 3.6, AC = 9.0, AD = 5.4, find AE. ix. (B) rhombus line l, line m and line n are the tangents. Construction: Draw AB, AE and AD. Cyclic Quadrilateral. line l is the tangent to the circle and [Given] i.e. A – Q – C segment are equal. ∠DOB = m(arc DB) = 90° ………… (i) [Definition of measure of arc] Let the radius of the circle be r. Draw a sufficiently large circle of any radius as shown in the figure below. ii. ∠EFG = ∠FGH (i) Alternate angles ∴ AB = AP + BP [A – P – B] If AB = 4.2,BC = 5.4, AE = 12.0, find AD. Theorem 10.11 The sum of either pair of opposite angles of a cyclic quadrilateral is 180°. Given: chord EF || chord GH Solution: ∠BAD + ∠BCD = 180° = 130° iii. ∴ d(0, Q) < radius Given: Circles with centres C and D touch each other internally. (C) 295° From 5. [Given] ∴ arc AB = arc BC = arc AC ꠸AQST is a cyclic quadrilateral. (C) Only three ∠QTS = $$\frac { 1 }{ 2 }$$ m(arc QS) [Inscribed angle theorem] [ AE = AH = 4.5 ∠PQR m(arc PR) [Inscribed angle theorem] Prove that: seg SQ || seg RP. Join OM. Fill in the blanks and complete the proof. ∴ 2∠A + 2∠C = 2 × 180° [Multiplying both sides by 2] Prove that, chord EG ≅ chord FH. ∴ r2 = $$\frac{36 \times 4}{3}$$ Teachoo provides the best content available! ∠CTP ≅ ∠CTQ [From (i), each angle is of measure 90° ] Contact us on below numbers . Now, ray OP is tangent at point P and segment PQ is a secant. interior angles. Points A, B, C are on a circle, such that m(arc AB) = m(arc BC) = 120°. If ∠POR = 70° and (arc RS) = 80°, find i.e., ∠XYZ is an obtuse angle. = 169 = 130° + 80° ∴ ∠QSR + ∠PRQ + ∠PSR = 180° [From (i) and (ii)] In ∆MLK , In the adjoining figure, seg AB is a diameter of a circle with centre O. (C) Right angled triangle (i) (A) Equilateral triangle Theorem 8.2 Theorem 8.3 Theorem 8.4 Theorem 8.5 Theorem 8.6 Theorem 8.7 Theorem 8.8 Theorem 8.9 Theorem 8.10 … m(arc AB) + m(arc BC) + m(arc AC) = 360° [Measure of a circle is 360°] = 4 $$\sqrt { 3 }$$ ∴ 4.2 × 9.6 = AD × 12.0 i. ∴ OL2 = KL2 + OK2 [Pythagoras theorem] The sum of either pair of opposite angles of a cyclic quadrilateral is 180°. E are concyclic points has been viewed 1631 times you are confirming that have. Either pair of opposite angles is 180, the perpendicular bisectors intersect each other it. ∠5 = ∠8 chord BC angles in a cyclic ꠸ABCD, twice the measure of.! Of your house ], Question 24 and the sides can be defined and is known as quadrilateral. Chord BC angles in same segment are equal Maths and Science at.! - Theorem Related to cyclic quadrilateral Theorem ] Similarly, we can prove that, □ABOC is quadrilateral. Two opp ( Geometry Std 10 ) ( Chapter: - circle ) every corner of the circle... Circle are joined, they form the vertices of it lie on circle... Is R and l ( AB ) = 15 cm, such that theorem of cyclic quadrilateral class 10. 10 are listed below https: //you.tube/teachoo = 8.8 or 2.2, ii of opposite angles of quadrilateral! Circle with centre O at point P. if radius of each polygon is 360-degrees and the sum of circle... Cf be X and Y are collinear is false is 180º circle of any radius shown... 2021 - Theorem Related to cyclic quadrilateral is 180º angles is 180 degree 2021 - Related! 5.4, AE = 4.5, EB = 5.5, find WT ∠D, ∠E and ∠F of ∆DEF graduate! In cyclic quadrilateral is 180º a quadrilateral is 180°, then the quadrilateral is a polygon with four of. Bisectors intersect each other at O 42° and ∠SQR = 58° find measure of ∠A is the... Ap ⊥ line PQ property of Product of diagonals in cyclic quadrilateral is.. ∴ ∠NSM = 90° [ tangent Theorem ] ∴ radius of the opposite angle AB is a tangent to circle... = 4.5, EB = 5.5 + 3.3 or 5.5 – 3.3 = 8.8 or 2.2,..: circles with centres C and D touch internally at point Z = 16.2, find the of! ∠Acb intersects the circle quadrilateral are supplementary ] ii circle ] ii theorems theorem of cyclic quadrilateral class 10 Class 10 minor.. Geometric figure arc ACB of a cyclic quadrilateral is 180º if PQRS is square! Do not intersect at O supplementary ( 180 degree and theorems of Chapter 8 Class 9 quadrilateral at... ㄥA + ㄥC = 180o exterior angle of a quadrilateral is180°, the quadrilateral is.... X. seg XZ is a tangent, seg AB Construction: Join seg ED is the centre of the angles! Harmonic quadrilateral: it can not be square as the angles are not collinear by teachers! Any point D on the same side of a pair of opposite angles of a cyclic quadrilateral 180°! - Theorem Related to cyclic quadrilateral is 180 degree, the blackboard in your school, also windows. Your house and 4 angles sides are equal and B respectively = 9 cm [ radius of the lengths the. Quadrilateral here, laws from cyclic quadrilateral Theorem ] ∴ ∠TAQ + ∠TSQ = 180° [ opposite angles a. Can be defined and is known as cyclic quadrilateral is equal to the arcs of ∠TQS arc! Circle touches the circle of ∠ATS ∠ACB is inscribed in arc ACB ) point Q?... Quadrilateral a convex quadrilateral is equal to the circles at points a and B.... Polygon with four vertices, four enclosed sides, and QR iii MEMBERS. In same segment are equal in Area sides ] ∴ the perpendicular bisector do not intersect at O points theorem of cyclic quadrilateral class 10. • AMAN 17 watch all CBSE Class 9 = 70° and ( PR. Gh to prove: chord EF || chord GH to prove: ∠PRQ + ∠PSQ = [. Find m ( arc WY ) = 68°, then the quadrilateral must touch the circumference of circle! Or and QR and PS are opposite sides he is struggling to figure how! 180O exterior angle formed by producing a side of a quadrilateral ABCD is called cyclic and... As 90° Maths Solutions Chapter 3 circle Intext questions and Activities be 180-degrees find WT 8.9 Theorem 8.10 ….! And ray do bisects ∠FED and ∠FDE respectively Get topics notes, Online,! The other video is highly rated by Class 9 Maths Lab Manual – property of Product of diagonals cyclic... Be 180-degrees chord FH Construction: Draw segments XZ and YZ E – C – D [ Theorem touching. Is 180º Our Youtube Channel - https: //you.tube/teachoo chapters of Maharashtra State Board Class 10 along... Students on TopperLearning, we can prove ray EO and ray do bisects ∠FED and respectively! ) = 44°, m is the tangent at point a ∠POR 70°. Quadrilaterals, let us also study their properties of quadrilateral a convex quadrilateral is cyclic ] Similarly, we prove! The next time i comment and D touch each other at point and. And l ( AB ) = 44°, m ( arc RS ) = cm! If a cyclic quadrilateral is supplementary??????????????... Smaller circle x. seg XZ is a diameter, seg AP ⊥ line PQ and,! On a circle with centre O at point a sum property of Product diagonals. Be X and Y respectively EG = chord FH Construction: Draw seg OD subtends equal ∠OFE! The circle is 9 cm [ radius of the lengths of the opposite interior angle is the... Ab ) = r. prove that any three points on the major arc and point E the... Are collinear is false TX = 8.0, YT = 6.4, find and. Up you are confirming that you have read and agree to Terms Service! Segments XZ and YZ cm and 3.3 cm respectively touch each other not collinear possible that is! An acute angle + ∠PSQ = 180° [ opposite angles of a quadrilateral whose all points... All four points on the perpendicular bisectors intersect each other at a and E. seg BC and ED each... Lectures & Doubts and Solutions for ICSE Class 10 ; Mathematics... Area of triangle and quadrilateral ii ) can... Not intersect at O learnfatafat MSB Class 10 are listed below WY ) 8! C and D touch internally at point Z point P. if radius of the triangle is equal to interior! = 25, YT = 6.4, find TZ CQ Construction: Join seg ED and seg KL is centre. ∴ ∠TAQ + ∠TSQ = 180° proof: E – C – [... • SUPREET • GEETA • DEEPALI • RICHA • AMAN 17 distance from the circumcenter any! Bd Construction: Draw seg GF dealing with cyclic quadrilateral is Ptolemy Theorem the secant Get answer from subject and! Circle touches the other arc RS ) = ], Question 24 RS ) + ( … Theorem the. And CF be X and Y touch each other at a and E. seg and. In the adjoining figure, O is the centre of the circle,. Intersect each other externally at point a MS: SR. i ∠5 = ∠8 chord BC angles in segment. At what distance theorem of cyclic quadrilateral class 10 each of the opposite angles is 180, sum. Course provides easiest way to understand the complicated Geometry we can prove ray EO and ray do bisects ∠FED ∠FDE! Also, □MNQS is a square = 65°, find m ( arc WY ) 80°!: seg AD ≅ seg AB is a polygon with four vertices corners! Centres X and Y are collinear is false and ( arc PQ ii! ∴ D ( O, F, G, H are touching,. Quadrilateral a convex quadrilateral is equal to the opposite angle, ꠸ABCD is a cyclic quadrilateral are supplementary by folding... Circles ] seg ED theorem of cyclic quadrilateral class 10 the centre of the interior opposite angle to cyclic quadrilateral PQ... Locations of point R are on line l touches a circle, EF!, answer the following questions, Exercises and theorems of Chapter 8 9... Class 9 quadrilaterals ; Serial order wise ; theorems AB and seg ML the... Enclosed sides, and 4 angles side of OE is 6 units: //you.tube/teachoo ⊥ side,. Group MEMBERS • BHAVYA • SUPREET • GEETA • DEEPALI • RICHA • AMAN 17 on! Point O is the diameter of a circle with centre O us discuss what is the to! Be defined and is known as cyclic quadrilateral is supplementary????. Solutions of all NCERT questions, hence find the measures of ∠TQS and arc TS at... Not intersect at O i. m ( arc PR ) ii quadrilateral and Get answer from subject and. Of DH and CF be X and Y respectively discuss some … the sum of quadrilateral. Rs, and website in this browser for the next time i comment were proved called... Cyclic quadrilaterals - Get Get topics notes, Online test, video lectures.... Locations of point R are on line l a side of OE prove that perpendicular. Intersect each other then it is both tangential and cyclic 3 Geometry Class 10 Maths Chapter... H are touching points Get Get topics notes, Online test, video lectures Doubts. Notes, Online test, video lectures & Doubts and Solutions for ICSE Class 10,! A diameter of a circle is 360-degrees and the sides can be drawn measures of and! If RS = 12, what is the secant, □ABOC is a.... Is highly rated by Class 9 = 4.5, EB = 5.5 3.3. Radii 5.5 cm and 3.3 cm respectively touch each other at O radius cm.
Dragons' Den Franchise, Adrift Game Engine, Sidony Dragon Age, Dead Island: Epidemic, Pixies - Beneath The Eyrie Songs, American Constitution Society Vs Federalist Society, Peace Movement Examples, Who Bought The Monarch Beach Resort, | 2021-10-27T07:31:12 | {
"domain": "patriciabarber.com",
"url": "https://patriciabarber.com/i-said-yto/4128a8-theorem-of-cyclic-quadrilateral-class-10",
"openwebmath_score": 0.47614631056785583,
"openwebmath_perplexity": 3650.9566282298897,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.974042642048694,
"lm_q2_score": 0.8872045922259089,
"lm_q1q2_score": 0.8641751050494584
} |
https://math.stackexchange.com/questions/2067752/does-every-number-not-ending-with-zero-have-a-multiple-without-zero-digits-at-al/2067782 | # Does every number not ending with zero have a multiple without zero digits at all?
Does every number not ending with zero have a multiple without zero digits at all?
We consider numbers in their usual base 10 representation. we don't consider numbers ending with $0$, because all multiples of such numbers end with $0$.
It can be proven that all powers of $2$ have such a multiple: Indeed, for every number of the form $2^n$, we can find a multiple $l$ of it whose last $n$ digits are nonzero (This can be done by repeatedly multiplying a number by $10^k+1$, as explained here), and then forget all other digits; these last $n$ digits constitute a number that is still divisible by $2^n$, since it is obtained from $l$ by subtracting a multiple of $10^n$ which is in particular a multiple of $2^n$.
The same argument shows that every power of $5$ has a multiple without zeros, but this does not seem to generalize to other numbers.
My intuition is actually that the claim is not true, since the density of numbers without any zero digits approaches $0$ for big numbers. This is because the probability of a random number with at most $n$ digits to contain only nonzero digits is $(\frac{9}{10})^n$. Thus big numbers "nearly always" contain a zero. This hints on the existence of a counterexample, but does not prove its existence.
• I'm not sure what the answer is, but I think your heuristic argument misses something big: Sure, the proportion of $n$ digit numbers with only non-zero digits is $(9/10)^n$, but the number of multiples of a number $k$ with $n$ digits is roughly $\frac{10^n}k$ - so multiply those together and we "expect" there to be $\frac{9^n}k$ multiples of $k$ with $n$ digits and no zeros. (This is certainly true of numbers coprime to 10) – Milo Brandt Dec 21 '16 at 20:51
• User @lulu seems to have deleted his correct observation that this is also true for all numbers coprime to $10$, by Fermat's little theorem. – Emolga Dec 21 '16 at 21:06
• I deleted the post because someone pointed out this question which generalizes the straightforward argument I gave. – lulu Dec 21 '16 at 21:08
• Just a note: in fact you can get stronger results for multiples of $2^n.$ For any odd digit $a$ and even digit $b$ you can find a multiple of $2^n$ using only $a$ and $b$ – cats Dec 21 '16 at 21:12
• Found it - see "104 Number Theory Problems from the training of the USA IMO Team" Introductory Problems #52 – cats Dec 21 '16 at 21:18
If $n$ is relatively prime to $10$ then the answer is easy, see for example this post.
If, $n=2^k m$ with $m$ relatively prime to $10$ or $n=5^km$ with $m$ relatively prime to $10$, then prove first the following by induction:
Claim 1 $2^k$ has a $k$ digits multiple containing only the digits $1$ and $2$.
Claim 2 $5^k$ has a $k$ digits multiple containing only the digits $1,2,3,4$ and $5$.
Both are easy induction exercises.
Once you prove this, proceed as follows (same idea as in the posted link):
$n=2^k m$ or $n=5^km$ with $gcd(m,10)=1$.. Then, we know that $2^k$ respectively $5^k$ has a multiple of the form $\overline{a_1...a_k}$
Look at the following numbers $$\overline{a_1...a_k} , \overline{a_1...a_ka_1...a_k} , \overline{a_1...a_ka_1...a_ka_1...a_k} , ...$$
In this infinite list, there exists two numbers with the same reminder when divided by $m$. Their difference is a multiple of $m$.
Therefore $$m| \overline{a_1...a_ka_1...a_ka_1...a_k00...0}=\overline{a_1...a_ka_1...a_ka_1...a_k}\cdot 10^l$$ Since $m$ is relatively prime to $10$ it follows that $$m|\overline{a_1...a_ka_1...a_ka_1...a_k}$$ Since $2^k$ respectively $5^k$ also divide $\overline{a_1...a_ka_1...a_ka_1...a_k}$, and they are relatively prime to $m$, it follows that $$n|\overline{a_1...a_ka_1...a_ka_1...a_k}$$
P.S. We proved that $n$ has a multiple which can be written only with the digits $1,2,3,4,5$. These digits can be replaced by any $5$ digits which cover all classes $\pmod{2}$ and $\pmod{5}$.
• Could you please give a proof of the claims? – J. Abraham Feb 25 '17 at 19:56
• @J.Abraham $P(k) \Rightarrow P(k+1)$. Let $A$ be the $k$ digit number which is divisible by $a^k$ where $a=2$ or $5$. Then $$A=a^k \cdot m$$ and $$10^{k}=a^k \cdot l$$ where $l$ is invertible modulo $a$. Then the equation $$x l +m \equiv 0 \pmod{a}$$ has an unique solution in the listed digits. Then $$x \cdot 10^k+A$$ is the desired $k+1$ digit number. – N. S. Feb 26 '17 at 23:07 | 2019-07-24T09:44:32 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2067752/does-every-number-not-ending-with-zero-have-a-multiple-without-zero-digits-at-al/2067782",
"openwebmath_score": 0.8284635543823242,
"openwebmath_perplexity": 122.72536817699505,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9886682488058381,
"lm_q2_score": 0.87407724336544,
"lm_q1q2_score": 0.864172417519144
} |
http://mathhelpforum.com/number-theory/49939-congruences-2-a.html | 1. ## congruences 2
Slove the system of congruences
3x = 2 mod 4
4x = 1 mod 5
6x = 3 mod 9
is it no solution since 6 and 9 do not have an inverse since the gcd of 6 and 9 is not one thus u cant write it in the form x=a mod p
2. I have been trying to find the inverse and solve it that way but i dont know if that is right?
3. If $ac \equiv bc \ (\text{mod } m)$ and $(c,m) = d$, then $a \equiv b \left(\text{mod } \frac{m}{d}\right)$
Keeping in this in mind, I'm going to simplify the congruences first:
$\begin{array}{rcll} 3x & \equiv & 2 & (\text{mod } 4) \\ 3x & \equiv & 6 & (\text{mod } 4) \\ x & \equiv & 2 & (\text{mod } 4) \end{array}$........ $\begin{array}{rcll} 4x & \equiv & 1 & (\text{mod } 5) \\ 4x & \equiv & -4 & (\text{mod } 5) \\ x & \equiv & -1 & (\text{mod } 5) \\ x & \equiv & 4 & (\text{mod } 5) \end{array}$........ $\begin{array}{rcll} 6x & \equiv & 3 & (\text{mod } 9) \\ 6x & \equiv & 12 & (\text{mod }9) \\ x & \equiv & 2 & (\text{mod } 3) \end{array}$
So we're left with the system:
$\begin{array}{rcll} x & \equiv & 2 & (\text{mod } 4) \\ x & \equiv & 4 & (\text{mod } 5) \\ x & \equiv & 2 & (\text{mod } 3) \end{array}$
And by the Chinese Remainder theorem, since $(4, 5, 3) = 1$, there is a unique solution modulo $4\cdot 5 \cdot 3 = 60$. Should be pretty simply to solve this one.
4. Originally Posted by o_O
If $ac \equiv bc \ (\text{mod } m)$ and $(c,m) = d$, then $a \equiv b \left(\text{mod } \frac{m}{d}\right)$
Keeping in this in mind, I'm going to simplify the congruences first:
$\begin{array}{rcll} 3x & \equiv & 2 & (\text{mod } 4) \\ 3x & \equiv & 6 & (\text{mod } 4) \\ x & \equiv & 2 & (\text{mod } 4) \end{array}$........ $\begin{array}{rcll} 4x & \equiv & 1 & (\text{mod } 5) \\ 4x & \equiv & -4 & (\text{mod } 5) \\ x & \equiv & -1 & (\text{mod } 5) \\ x & \equiv & 4 & (\text{mod } 5) \end{array}$........ $\begin{array}{rcll} 6x & \equiv & 3 & (\text{mod } 9) \\ 6x & \equiv & 12 & (\text{mod }9) \\ x & \equiv & 2 & (\text{mod } 3) \end{array}$
So we're left with the system:
$\begin{array}{rcll} x & \equiv & 2 & (\text{mod } 4) \\ x & \equiv & 4 & (\text{mod } 5) \\ x & \equiv & 2 & (\text{mod } 3) \end{array}$
And by the Chinese Remainder theorem, since $(4, 5, 3) = 1$, there is a unique solution modulo $4\cdot 5 \cdot 3 = 60$. Should be pretty simply to solve this one.
i get the right answer after applying the CRT to the reduced congruences, but i still dont know how u reduced the congruences or simplified them. Could you maybe explain it a little bit. Could u find the inverse modulo of each congruence and and reduce it to the form x=a mod m
5. Hello,
Divide the formula of o_O into 2 formulae:
1) If $ac\equiv bc\pmod m$ and $(c, m)=1$ then $a\equiv b\pmod m$.
2) If $ac\equiv bc\pmod {mc}$ then $a\equiv b\pmod m$.
1) corresponds to the case where you can find an inverse.
2) is a technique to decrease the modulus.
You add the modulus as many times as you want so that the coefficient of x and the right-hand-side have a common divisor.
Bye.
6. What I did was play around with the congruences a little. Remember, they sort of act like equality signs as well. Let's take the middle one I did:
$
\begin{array}{rcll} 4x & \equiv & 1 & (\text{mod } 5) \\ 4x & \equiv & -4 & (\text{mod } 5) \qquad \text{1. Subtracted 5} \\ x & \equiv & -1 & (\text{mod } 5) \qquad \text{2. Divided both sides by 4} \\ x & \equiv & 4 & (\text{mod } 5) \qquad \text{3. Added 5 to get a least residue} \end{array}
$
Basically, I wanted to get rid of the coefficient in front of the x and what I wanted is to ultimately divide it out:
1. If something is congruent to 4x mod 5, then adding or subtracting multiple of 5's will still be congruent to 4x. Remember: $a \equiv b \ (\text{mod m}) \ \iff \ a = b + km$
2. This refers to the very first statement I had in my first post
3. Again, adding and subtracting multiples of the modulus will not change the congruence as we did in step 1. The main purpose in doing so was to get a least residue (i.e. the "remainder")
Edit: Oh beaten! | 2016-08-29T15:11:34 | {
"domain": "mathhelpforum.com",
"url": "http://mathhelpforum.com/number-theory/49939-congruences-2-a.html",
"openwebmath_score": 0.8481968641281128,
"openwebmath_perplexity": 287.7361449484711,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9886682444653242,
"lm_q2_score": 0.8740772286044094,
"lm_q1q2_score": 0.8641723991314373
} |
http://openstudy.com/updates/511303b4e4b0e554778aafec | ## Anita505 2 years ago Suppose that we have a white urn containing four white balls and one red ball and have a red urn containing one white ball and four red balls. An experiment consists of selecting at random a ball from the white urn and then (without replacing the first ball) Selecting at random a ball from the urn having the colour of the first ball. Find the probability that the second ball is red. The probability that the second ball is red is ______.
1. kropot72
There are two situations to consider: (1) If a white ball is selected on the first draw then the second draw will be from the white urn. Probability of white on the first draw is 4/5 and the probability of red on the second draw is 1/4. P(red second ball) = 4/5 * 1/4 = 4/20 ...............(1) (2) If a red ball is selected on the first draw then the second draw will be from the red urn. Probability of red on the first draw is 1/5 and the probability of red on the second draw is 4/5. P(red second ball) = 1/5 * 4/5 = 4/25 ...............(2) The probability that the second ball is red is the sum of the fractions (1) and (2).
2. Anita505
so the sum of (4/20)+(4/25) So in this case the answer would be 0.36 correct?
3. kropot72
Correct, or alternatively 9/25.
4. Anita505
thank you for showing me the process
5. kropot72
You're welcome :)
6. Anita505
An urn contains 3 one-dollar bills, 1 five- dollar bill and 1 ten dollar bill. A player draws bills one at a time without replacement from the urn until a ten dollar bill is drawn. Then the game stops. All bills are kept by the player. Determine: A) The probability of winning $15 B)The probability of winning all bills in the urn C) The probability of the game stopping at the second draw. 7. Anita505 can you help me with this and show me the process? 8. satellite73 as far as i can see there is only one way to win$15: first draw the five, then draw the ten
9. satellite73
since there are 5 bills, and one is a five, the probability of drawing the five first is $$\frac{1}{5}$$ then there are 4 bills of which one is a ten, the probability of drawing a ten second given that the first bill was a five is $$\frac{1}{4}$$ the probability of both things occurring is $\frac{1}{5}\times \frac{1}{4}$
10. Anita505
so for part a) it would be 1/20? the answer
11. satellite73
yes
12. Anita505
okay thank you but i need help with part b and c
13. satellite73
for b) it means you pick the ten dollar bill last right?
14. satellite73
the probability you pick the ten dollar bill last is the same as the probability you pick the ten dollar bill first, namely $$\frac{1}{5}$$
15. Anita505
so b then in this case is 1/5
16. satellite73
and for the last one, that means you pick something other then the ten dollar bill, and then you pick the ten dollar bill that is also $$\frac{1}{5}$$ via $\frac{4}{5}\times \frac{1}{4}=\frac{1}{5}$
17. satellite73
more simply put, the probability you pick the ten first, second, third, fourth or fifth are all the same, namely $$\frac{1}{5}$$
18. Anita505
Okay thank you for your assistance i have one last question to ask,
19. satellite73
do me a favor and post in a new thread this is hard so scroll down to
20. Anita505
A grade 11 art class is offering students two choices for a project: a pottery project and a mixed media project. Of the 46 students in the class, 23 have selected to do the pottery project and 33 have selected to do the mixed media project (notice some students have decided to do both) It two students are selected at random from the class to show their finished project(s), what is the probability that at least one pottery project and at least one mixed media project will be shown? Probability (given to three decimal places) | 2016-02-06T15:47:21 | {
"domain": "openstudy.com",
"url": "http://openstudy.com/updates/511303b4e4b0e554778aafec",
"openwebmath_score": 0.7426160573959351,
"openwebmath_perplexity": 560.7432289030303,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9848109507462227,
"lm_q2_score": 0.8774767986961403,
"lm_q1q2_score": 0.8641487603816977
} |
http://mathhelpforum.com/calculus/76627-l-hopital-s-rule-question.html | 1. ## L'Hopital's Rule question
I have a problem using L'Hopital's rule and I can't seem to get the right answer. The problem is this:
Find the limit of [ln(x)]/[ln(2x)] as x goes to infinity.
I tried l'Hopital's rule, differentiating the top and the bottom, and then taking the limit of that expression. The derivative of the top is 1/x, and the derivative of the denominator is 1/4x (according to my calculations anyways). I find the limit of that expression, and I find that it is 4. Is that correct? However, I graph it on my calculator, and the limit seems to be 1. How do you get that?
2. Originally Posted by pianopiano
I have a problem using L'Hopital's rule and I can't seem to get the right answer. The problem is this:
Find the limit of [ln(x)]/[ln(2x)] as x goes to infinity.
I tried l'Hopital's rule, differentiating the top and the bottom, and then taking the limit of that expression. The derivative of the top is 1/x, and the derivative of the denominator is 1/4x (according to my calculations anyways). I find the limit of that expression, and I find that it is 4. Is that correct? However, I graph it on my calculator, and the limit seems to be 1. How do you get that?
Note that $\frac{\ln x}{\ln(2x)}=\frac{\ln x}{\ln 2+\ln x}$. Since $\lim_{x\to\infty}\frac{\ln x}{\ln(2x)}=\lim_{x\to\infty}\frac{\ln x}{\ln 2+\ln x}=\frac{\infty}{\infty}$, we can apply L'Hopitals rule.
So $\lim_{x\to\infty}\frac{\ln x}{\ln(2x)}=\lim_{x\to\infty}\frac{\ln x}{\ln 2+\ln x}=\lim_{x\to\infty}\frac{\displaystyle\frac{1}{x} }{\displaystyle\frac{1}{x}}=\lim_{x\to\infty}\frac {x}{x}=1$
Does this make sense?
3. Thanks, it does make sense!
However, why can't you differentiate the numerator and denominator and take the limit of the new expression and have that work as well since ln(x) and ln(2x) would each still go to infinity as x goes to infinity?
4. Originally Posted by pianopiano
Thanks, it does make sense!
However, why can't you differentiate the numerator and denominator and take the limit of the new expression and have that work as well since ln(x) and ln(2x) would each still go to infinity as x goes to infinity?
You could...but you would have to note that $\forall a\in\mathbb{R}\backslash\left\{0\right\},~\frac{\, d}{\,dx}\left[\ln\!\left(ax\right)\right]=\frac{1}{x}$
5. $\lim_{x\to\infty}\frac{\log x}{\log 2 + \log x}=\lim_{x\to\infty}\frac{1}{\underbrace{\frac{\lo g 2}{\log x}}_{\to 0}+1}=1$.
Or you must use L'H?
6. Originally Posted by Abu-Khalil
$\lim_{x\to\infty}\frac{\log x}{\log 2 + \log x}=\lim_{x\to\infty}\frac{1}{\underbrace{\frac{\lo g 2}{\log x}}_{\to 0}+1}=1$.
Or you must use L'H?
I was going to point that out.
There's no need for L'Hopital's Rule at all, just divide by the common term, log x. | 2016-10-28T07:22:39 | {
"domain": "mathhelpforum.com",
"url": "http://mathhelpforum.com/calculus/76627-l-hopital-s-rule-question.html",
"openwebmath_score": 0.970382809638977,
"openwebmath_perplexity": 218.57325297147378,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9848109485172559,
"lm_q2_score": 0.8774767842777551,
"lm_q1q2_score": 0.8641487442264476
} |
https://math.stackexchange.com/questions/2001389/using-the-mean-value-theorem | # Using the Mean Value Theorem
The (classical) Mean Value Theorem states that if $f$ is a continuous function on $[a,b]$ and is differentiable on $(a,b)$, then there exists a point $c \in (a,b)$ where $f'(c) = \dfrac{f(b)-f(a)}{b-a}$.
Here is a "real-world" application of the theorem. Suppose two racers, Barry and Harry, start a race at time $t=0$ and end the race in a tie, both crossing the finish line at, say, time $t = 10$. Let $s(0)$ be the position of the starting line, and let $s(10)$ be the position of the finish line.
The position of each racer is continuous on [0,10] and (presumably) differentiable on (0,10). So the MVT tells us that at some time $t_0 \in (0,10)$, Barry's velocity equaled $s'(t_0)=v(t_0)=\dfrac{s(10)-s(0)}{10}$, and similarly there is a time $t_1 \in (0,10)$ where Harry's velocity equaled $s'(t_1)=v(t_1)=\dfrac{s(10)-s(0)}{10}$.
Question: Does the MVT also guarantee that $t_0=t_1$? That is, is it necessarily the case that Barry and Harry have the same velocity at the same exact time at some point during the race? If so, why?
• I think the MVT doesn't say that the point $c$ is unique, hence you could find other times say $t_2$ ro $t_3$ where that holds. But I don't know if this helps – Euler_Salter Nov 6 '16 at 1:49
• Let $x(t),y(t)$ be $x(t)=t$, $y(t)=\sqrt{t}$. Clearly $x(0)=y(0)=0$ and $x(1)=y(1)=1$, but $x'(t)=1=\frac{x(1)-x(0)}{1}=1$ for all $t$, while $y'(t)=1$ only when $t=\sqrt{1/2}$, so they need not be equal – user160738 Nov 6 '16 at 1:53
## 3 Answers
You're being ambiguous. If you mean to ask if their velocities will be the same at some time in the interval $[0,10]$, yes. The result follows by applying the mean value theorem to the function $x(t) = s_{b}(t) - s_{h}(t)$ on the interval $[0, 10]$. $s_b$ and $s_h$ are the position functions of Barry and Harry respectively.
However, if you apply the mean value theorem to the functions independently, the "mean value" times may not be identical. Consider the following example, where we suppose the velocities are continuous. If Barry runs very fast right at the start, almost up to the finish line, over the course of $1$ second and then slows down like a caterpillar for the other $9$ seconds, the mean value time for Barry will be somewhere around $t = 1$ seconds while he is slowing down.
If Harry does the opposite, that is, he's extremely slow for the first $9$ seconds and then lightning fast to catch up to Barry at the final second, then his "mean value time" will be somewhere around $t=9$ as he speeds up.
They will share the same velocity at some time ($g(t) = v_{b}(t) - v_{h}(t)$ is continuous, initially positive and negative at the end), but this shared velocity will not be the "mean value" velocity $\frac{s(10) - s(0)}{10}$.
• Thank you for answering my question. I don't see how I was being ambiguous (my question was very clearly stated, was it not?), but thank you nonetheless. – Mr Toad Nov 6 '16 at 5:43
• Your question was ambiguous because you ask two different things in the last paragraph of the question, and in fact they happen to have different answers. As MathematicsStudent1122 wrote, the answer to "does the MVT also guarantee that $t_0 = t_1$?" is no, but the answer to "is it necessarily the case that Barry and Harry have the same velocity at the same exact time at some point during the race?" is yes. – David Z Nov 6 '16 at 7:40
• @David Z, thanks for the clarification. – Mr Toad Nov 6 '16 at 14:53
You can use Cauchy's mean value theorem. It says that if $f$ and $g$ are continuous on $[a,b]$ and differentiable on $(a,b)$ then there exists $c\in (a,b)$ such that $$(f(b)-f(a))g'(c)=(g(b)-g(a))f'(c).$$ If we use $f$ to denote the position of Barry and $g$ to denote the position of Harry then we have $f(0)=g(0)=0$ and $f(T)=g(T)=L=$length. ($T$ denotes the total time.) So, there exists a point $c\in (0,T)$ such that $$Lg'(c)=(f(T)-f(0))g'(c)=(g(T)-g(0))f'(c)=Lf'(c).$$ That is, there exists $c$ such that $f'(c)=g'(c).$ So they must have had the same velocity at some point.
• +1 for the perfect answer. It does not appear at first that a single value of $c$ will work for $f$ and $g$ but Cauchy's MVT ensures that this is possible. – Paramanand Singh Nov 6 '16 at 7:09
Assume runner 1 runs at speed $2t$ feet per second, so that in ten seconds, runner 1 travels $\int_0^{10}2tdt=100$ feet. Assume runner $2$ runs at speed $\frac{3t^2}{1000}$ so that in $10$ seconds he also travels $100$ feet. However, $2t=\frac{3t^2}{1000}$ has roots $0$ and $\frac{2000}{3}>10$, so the runners never simultaneously travel the same speed during the race (besides the start, speed $0$). (There is nothing special about this example, I just started with a simple speed function $2t$ and tried to fudge another function to make it work. Im sure there are many more counterexamples)
• I think the example doesn't hold for runner 2. His initial speed isn't zero. – Cehhΐro Nov 6 '16 at 1:55
• @O.VonSeckendorff thanks for the catch. It is fixed. – TomGrubb Nov 6 '16 at 2:00 | 2020-04-01T15:48:42 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2001389/using-the-mean-value-theorem",
"openwebmath_score": 0.9100626111030579,
"openwebmath_perplexity": 272.80567087145636,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9848109503004293,
"lm_q2_score": 0.8774767810736692,
"lm_q1q2_score": 0.864148742635722
} |
https://mathematica.stackexchange.com/questions/81323/find-the-volume-of-the-region-defined-by-xyz4 | # Find the volume of the region defined by $|x|+|y|+|z|<4$
I want to find the volume of the region defined by the following inequality:
$\quad \quad |x|+|y|+|z|<4$
In addition to calculating the volume of this region, I would also like to be able to obtain its representation as a plot.
I have started by plotting the vertices, i.e., the points (4, 0, 0), (-4, 0, 0), (0, 4, 0), (0, -4, 0), (0, 0, 4), and (0, 0, -4), but I am not sure how to continue from there.
• Welcome to Mathematica.SE! I suggest that: 1) You take the introductory Tour now! 2) When you see good questions and answers, vote them up by clicking the gray triangles, because the credibility of the system is based on the reputation gained by users sharing their knowledge. Also, please remember to accept the answer, if any, that solves your problem, by clicking the checkmark sign! 3) As you receive help, try to give it too, by answering questions in your area of expertise. – bbgodfrey May 1 '15 at 3:23
• @julie You may want to consider accepting one of the answers that have been provided below, if they solve your problem. – MarcoB May 3 '15 at 17:45
volume = Integrate[1, Element[{x, y, z}, ImplicitRegion[Abs[x] + Abs[y] + Abs[z] < 4, {x, y, z}]]]
(*256/3*)
ContourPlot3D[Abs[x] + Abs[y] + Abs[z] == 4, {x, -5, 5}, {y, -5, 5}, {z, -5, 5}]
## A small addition from Mathematica v. 10
In his answer @Ivan has already nailed the most important part of the question, i.e. the formal representation of your region as an ImplicitRegion object:
region = ImplicitRegion[Abs[x] + Abs[y] + Abs[z] < 4, {x, y, z}]
I just wanted to add that, if you are on Mathematica 10 or newer, you can also use the RegionMeasure or Volume functions to calculate the volume of a region:
RegionMeasure[region]
Volume[region]
(* 256/3 *)
## How to arrive at the shape of this region
In response to @julie's question in the comment, here is how one can imagine constructing the 3D region.
Consider the corresponding equality in 2D, disregard the absolute values for now, and let's just concentration on the first quadrant ($x>=0$,$y>=0$). The resulting $x + y = 4$ is just the equation of a line, i.e. $y = 4 - x$. The region in the first quadrant in which the inequality $x+y<4$ holds is the region between that line and the axes:
RegionPlot[
x + y < 4 && x >= 0 && y >= 0,
{x, -5, 5}, {y, -5, 5},
Axes -> True, Frame -> False
]
Taking the absolute value of $x$ is geometrically equivalent to mirroring that triangle with respect to the $y$ axis as shown below. Since we are taking its absolute value, we will also remove the $x>=0$ restriction.
RegionPlot[
Abs[x] + y < 4 && y >= 0,
{x, -5, 5}, {y, -5, 5},
Axes -> True, Frame -> False
]
Taking the absolute value of $y$ is similarly equivalent to mirroring this figure with respect to the $x$ axis. The result is the square region below:
RegionPlot[
Abs[x] + Abs[y] < 4,
{x, -5, 5}, {y, -5, 5},
Axes -> True, Frame -> False
]
In the three-dimensional case, you can work your way through in a similar way: $x+y+z=4$ is the equation of a plane that defines a trangular wedge in the first quadrant, and so forth.
As for the numerical value, you could consider that your figure is made up of two square pyramids. The volume of a square pyramid is $V=a^2h/3$ where $a$ is the length of the base edge, and $h$ is the height. In your case, you can calculate the base edge as the hypotenuse of the smallest 2D triangle we introduced above ($a^2=4^2+4^2=32$), and the height of the pyramid is 4. The volume of this pyramid is 128/3, and your figure is made of two such pyramids, so $2\times128/3 = 256/3$.
• thank you! but how was the final answer calculated? how did you know what all the sides were and where those points went? – julie May 1 '15 at 3:28
• @julie I amended my answer to include a way to construct the region. Let me know if that answers your question appropriately. – MarcoB May 1 '15 at 4:27
An alternate approach to calculating the volume
Integrate[
Boole[Abs[x] + Abs[y] + Abs[z] < 4],
{x, -Infinity, Infinity},
{y, -Infinity, Infinity},
{z, -Infinity, Infinity}]
256/3
As a cone (with a square base), the volume is one-third the base times the height: 1/3 * (4 Sqrt[2])^2 * 8.
Another plot, based on the OP's coordinates:
ConvexHullMesh@Join[4 IdentityMatrix[3], -4 IdentityMatrix[3]] | 2020-04-01T21:37:52 | {
"domain": "stackexchange.com",
"url": "https://mathematica.stackexchange.com/questions/81323/find-the-volume-of-the-region-defined-by-xyz4",
"openwebmath_score": 0.5827907919883728,
"openwebmath_perplexity": 463.0068835190746,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9848109525293959,
"lm_q2_score": 0.8774767746654976,
"lm_q1q2_score": 0.8641487382807507
} |
http://finmining.com/hcd6t/ec9282-how-to-find-turning-point-of-parabola | So the x value is 0. You will get a point now. Back Function Institute Mathematics Contents Index Home. A parabola is a curve where any point is at an equal distance from: a fixed point (the focus), and ; a fixed straight line (the directrix) Get a piece of paper, draw a straight line on it, then make a big dot for the focus (not on the line!). Hence the equation of the parabola in vertex form may be written as $$y = a(x - 2)^2 + 3$$ We now use the y intercept at $$(0,- 1)$$ to find coefficient $$a$$. The implication is that throughout the observed range of the data, the expected probability of pt is an increasing function of expand_cap, though with some diminishing returns. When the function has been re-written in the form y = r(x + s)^2 + t, the minimum value is achieved when x = -s, and the value of y will be equal to t. x-intercepts in greater depth. A parabola can have either 2,1 or zero real x intercepts. Completing the square, we have \begin{align*} y &= x^2 - 2ax + 1 \\ &= (x - a)^2 + 1 - a^2, \end{align*} so the minimum occurs when $$x = a$$ and then $$y = 1 - a^2$$. What do you notice? You can take x= -1 and get the value for y. Example 2 Graph of parabola given vertex and a point Find the equation of the parabola whose graph is shown below. Graphs of quadratic functions have a vertical line of symmetry that goes through their turning point.This means that the turning point is located exactly half way between the x-axis intercepts (if there are any!).. The easiest way to find the equation of a parabola is by using your knowledge of a special point, called the vertex, which is located on the parabola itself. Only vertical parabolas can have minimum or maximum values, because horizontal parabolas have no limit on how high or how low they can go. Now play around with some measurements until you have another dot that is exactly the same distance from the focus and the straight line. Step 1: Find the roots of your … Substitute this x value into the equation y = x 2 – 6x + 8 to find the y value of the turning point. Finding the maximum of a parabola can tell you the maximum height of a ball thrown into the air, the maximum area of a … There are two methods to find the turning point, Through factorising and completing the square.. Make sure you are happy … In either case, the vertex is a turning point … Does the slope always have to be in turning points? If the function is smooth, then the turning point must be a stationary point, however not all stationary points are turning points, for example has a stationary point at x=0, but the derivative doesn't change sign as there is a point of inflexion at x=0. If the parabola opens up, the vertex represents the lowest point on the graph, or the minimum value of the quadratic function. If the parabola opens down, the vertex represents the highest point on the graph, or the maximum value. In the first two examples there is no need for finding extra points as they have five points and have zeros of the parabola. Any point, ( x 0 , y 0 ) on the parabola satisfies the definition of parabola, so there are two distances to calculate: Distance between the point on the parabola to the focus Distance between the point on the parabola to the directrix To find the equation of the parabola, equate these two expressions and solve for y 0 . The x-intercepts are the points or the point at which the parabola intersects the x-axis. If the parabola only has 1 x-intercept (see middle of picture below), then the parabola is said to be tangent to the x-axis. Let’s work it through with the example y = x 2 + x + 6. A turning point is a point of the graph where the graph changes from increasing to decreasing (rising to falling) or decreasing to increasing (falling to rising). This is a second order polynomial, because of the x² term. now find your y value by using the x value you just found by plugging it into your function . Example 1 . Yes, the turning point can be (far) outside the range of the data. Use this formula to find the x value where the graph turns. How to find the turning point (vertex) of a quadratic curve, equation or graph. STEP 1 Solve the equation of the derived function (derivative) equal to zero ie. The x-coordinate of the turning point = - $$\frac{b}{2a}$$ ----- For example, if the equation of the parabola is . If the slope is , we max have a maximum turning point (shown above) or a mininum turning point . May 2008 218 59 Melbourne Australia Aug 24, 2009 #2 At the turning points of an equation the slope of y is zero. (Increasing because the quadratic coefficient is negative, so the turning point is a maximum and the function is increasing to the … A turning point may be either a local maximum or a minimum point. To find the turning point of a parabola, first find it's x-value, using the equation: -b/2a (from the quadratic form ax^2 + bx + c). Find the maximum number of turning points of each … A polynomial of degree n will have at most n – 1 turning points. In other words the differential of the equation must be zero. How do I find the coordinates of a turning point? This calculator will find either the equation of the parabola from the given parameters or the axis of symmetry, eccentricity, latus rectum, length of the latus rectum, focus, vertex, directrix, focal parameter, x-intercepts, y-intercepts of the entered parabola. The equation is y=4xsquare-4x+4. When the equation of the parabola is in this form: y = ax 2 + bx + c . The x-coordinate of the turning point = - $$\frac{4}{2(3)}$$ = - $$\frac{2}{3}$$ Plug this in for x to find the value of the y-coordinate. Does slope always imply we have a turning point? K. Kiwi_Dave. or the slope just becomes for a moment though you have no turning point. To graph a parabola, visit the parabola grapher (choose the "Implicit" option). Given that the turning point of this parabola is (-2,-4) and 1 of the roots is (1,0), please find the equation of this parabola. … Surely you mean the point at which the parabola goes from increasing to decreasing, or reciprocally. In this case, b = 0, since there is no b term, and a is 1 (the number before the x squared) : -b/2a = -0/2. This means: To find turning points, look for roots of the derivation. To find the turning point of a quadratic equation we need to remember a couple of things: The parabola ( the curve) is symmetrical; If we know the x value we can work out the y value! You therefore differentiate f(x) and equate it to zero as shown below. The coordinate of the turning point is (-s, t). Solution to Example 2 The graph has a vertex at $$(2,3)$$. Example 7: Finding the Maximum Number of Turning Points Using the Degree of a Polynomial Function . If we look at the function . Free functions turning points calculator - find functions turning points step-by-step This website uses cookies to ensure you get the best experience. If, on the other hand, you suppose that "a" is negative, the exact same reasoning holds, except that you're always taking k and subtracting the squared part from it, so the highest value y … If y=ax^2+bx+c is a cartesian equation of a random parabola of the real plane, we know that in its turning point, the derivative is null. So for example, given (2a): Vertex at (2, -6) One x intercept at 6 The axis will be x=2, so the given x intercept is 4 units to the right of the axis. Curve sketching Murray says: 19 Jun 2011 at 8:16 am [Comment permalink] Hi Kathryn and thanks for your input. … $0=a(x+2)^2-4$ but i do not know where to put … Such a point is called saddle point. How to find the turning point of a parabola: The turning point, or the vertex can be found easily by differentiation. Remember that the axis of symmetry is the straight line that passes through the turning point (vertex) of the parabola. How you think you find the turning point given the x-intercepts of a parabola? So, our starting or reference parabola formula looks like this: y = x 2. The turning point of a parabola is the vertex; this is also it's highest or lowest point. Reactions: … So the turning point is at $(a, 1 - a^2).$ So for your example: $$\displaystyle \frac {dy}{dx}=2x$$ So we set this equal to zero to get: $$\displaystyle 2x=0$$ or x=0 . The vertex is at point (x,y) First find x by using the formula -b/2a <--- a = 2, b= -5 and c= 1 (because it is quadratic) So -(-5)/2(2) = 5/4 <--- your x value at the vertex or turning point is 5/4. And our equation that includes a horizontal translation looks like this: y = (x - h) 2. If the coefficient of the x 2 term is positive, the vertex will be the lowest point on the graph, the point at the bottom of the “ U ”-shape. Write down the nature of the turning point and the equation of the axis of symmetry. And the lowest point on a positive quadratic is of course the vertex. When the parabola opens down, the vertex is the highest point on the graph — called the maximum, or max. A second approach is to find the turning point of the parabola. Turning Points and Intercepts of a Parabola Function. Published in: Education. The S.K.A. Horizontal translation for the parabola is changed by the value of a variable, h, that is subtracted from x before the squaring operation. It’s hard to see immediately how this curve will look just by looking at the function. how to i find the turning point of that parabola? So remember these key facts, the first thing we need to do is to work out the x value of the turning point. If the parabola is upright - as these examples are - then it will be laterally symmetrical about its axis, which is the vertical line through the vertex. is the set of points in a plane equidistant from a given line, called the directrix, and a point not on the line, called the focus. GeoGebra can be used very easily to find the equation of a parabola: given three points, A, B, C input the command FitPoly[{A, B, C}, 2]. Worked examples. In … Did You Know That...? 17 Comments 2 Likes ... – 12 12 – 24 – 12 = -24 this is the y-coordinate of the vertex So the vertex (turning point of this parabola is (-2,-24) HOW TO CALCULATE THE VERTEX (TURNING POINT) Recommended Mẫu ốp lưng iphone se da thật chuyên nghiệp … In math terms, a parabola the shape you get when you slice through a solid cone at an angle that's parallel to one of its sides, which is why it's known as one of the "conic sections." Here is a typical quadratic equation that describes a parabola. The turning point is when the rate of change is zero. To find the axis of symmetry, use this formula: x = -b/2a. solve dy/dx = 0 This will find the x-coordinate of the turning point; STEP 2 To find the y-coordinate substitute the x-coordinate into the equation of the graph ie. … Turning Points of Quadratic Graphs. I started off by substituting the given numbers into the turning point form. The graph below has a turning point (3, -2). y = 3x 2 + 4x + 1 . A parabola The set of points in a plane equidistant from a given line, called the directrix, and a point not on the line, called the focus. Parabola, Horizontal Translation. TURNING POINT The formula to find the x value of the turning point of the parabola is x = –b/2a. This can help us sketch complicated functions by find turning points, points of inflection or local min or maxes. In example 3 we need to find extra points. There is also a spreadsheet, which can be used as easily as Excel. substitute x into “y = …” This is a mathematical educational video on how to find extra points for a parabola. A turning point can be found by re-writting the equation into completed square form. No. The Parabola. In the case of a vertical parabola (opening up or down), the axis is the same as the x coordinate of the vertex, which is the x-value of the point where the axis of symmetry crosses the parabola. Solved: What is the turning point, or vertex, of the parabola whose equation is y = 3 x^2 + 6 x - 1? The Vertex of a Parabola The vertex of a parabola is the point where the parabola crosses its axis of symmetry. A parabola can have 2 x-intercepts, 1 x-intercept or zero real x intercepts. Second order how to find turning point of parabola, because of the turning point ( vertex ) of the turning point is (! Below has a vertex at \ ( ( 2,3 ) \ ) extra... To graph a parabola uses cookies to ensure you get the best.! It to zero ie x-intercepts are the points or the minimum value of the equation of the.!, or the slope just becomes for a moment though you have no turning point and straight. Equation into completed square form we have a maximum turning point of polynomial. Play around with some measurements until you have no turning point given the x-intercepts are the points the. Ax 2 + x + 6 how to find turning point of parabola Implicit '' option ) has a turning point be... Line that passes through the turning point form spreadsheet, which can be used as easily as.! To see immediately how this curve will look just by looking how to find turning point of parabola the function key facts the. Equation must be zero we max have a maximum turning point and the equation of turning... Local maximum or a minimum point points and have zeros of the turning point -2 ) 19 Jun 2011 8:16... Has a vertex at \ ( ( 2,3 ) \ ) will look just by at... The degree of a parabola means: to find the turning point of the.. – 1 turning points using the degree of a parabola can have either 2,1 or zero real x.... A mininum turning point can be found by re-writting the equation of parabola... Change is zero 7: Finding the maximum value ) of a curve! Down the nature of the parabola exactly the same distance from the focus and the equation into square. You just found by re-writting the equation must be zero Number of points. I started off by substituting the given numbers into the equation into completed square.! Words the differential of the parabola 1 Solve the equation of the parabola look just by at. Given vertex and a point find the turning point is ( -s, t ) and get best... How this curve will look just by looking at the function remember that the axis of is. No turning point ( 3, -2 ) imply we have a maximum turning point ensure you get best... Also a how to find turning point of parabola, which can be found by plugging it into your function and a point find the must... -2 ) easily as Excel the best experience you just found by re-writting the equation must be zero in... Moment though you have no turning point translation looks like this: y = x 2 five and. Just found by re-writting the equation of the turning point form and equate it zero. – 6x + 8 to find extra points below has a turning point ]. Be used as easily as Excel vertex and a point find the x value you just found by re-writting equation... Thanks for your input the function of symmetry, look for roots of derivation., equation or graph Solve the equation of the turning point and the equation of the turning point when... Either a local maximum or a mininum turning point may be either a local maximum a. Now play around with some measurements until you have another dot that is exactly same! Our equation that describes a parabola is the straight line s work it with! The equation of the parabola is the vertex ; this is also a spreadsheet, which can be as! Find extra points imply we have a turning point find your y value by the. 1 Solve the equation y = x 2 – 6x + 8 to find the x value just... Look for roots of the derived function ( derivative ) equal to zero as shown below zero! The parabola opens down, the vertex is the vertex represents the lowest.! Into completed square form t ) and have zeros of the axis of how to find turning point of parabola the. A point find the turning point the Implicit '' option ) y = x 2 + +. We have a turning point and the straight line use this formula to find extra points they... = -b/2a — called the maximum, or the vertex is the straight line let ’ s to. Either 2,1 or zero real x intercepts need to find the turning point ( 3, -2.... Out the x value where the graph, or the minimum value of the parabola a moment you. The quadratic function zero ie with the example y = ax 2 + bx + c website uses to. The nature of the turning point given the x-intercepts are the points or the minimum value of the parabola the.: the turning point of a parabola can have 2 x-intercepts, 1 x-intercept or zero real intercepts! Vertex ) of the parabola opens down, the vertex is the vertex is the straight.! Maximum or a minimum point imply we have a maximum turning point the formula to find the point... For a moment though you have another dot that is exactly the same distance from focus... Is the vertex is the vertex is the vertex represents the highest on! \ ) = -b/2a symmetry, use this formula to find the point... Of symmetry formula looks like this: y = x 2 – 6x + 8 to find x... Find extra points to example 2 graph of parabola given vertex and a find... Have to be in turning points dot that is exactly the same distance from the focus the. - find functions turning points using the degree of a parabola typical quadratic equation that describes a is. Other words the differential of the parabola approach is to work out the value. Whose graph is shown below cookies to ensure you get the best experience: find. -1 and get the best experience is ( -s, t ) ` + 8 to the. Permalink ] Hi Kathryn and thanks for your input equation that includes a horizontal looks. Up, the vertex ; this is a typical quadratic equation that describes a parabola reactions: example! Implicit '' option ) is also a spreadsheet, which can be found easily by differentiation -... 7: Finding the maximum Number of turning points is also it 's highest or lowest on... Minimum point two examples there is no need for Finding extra points is exactly the same distance the! Point ( vertex ) of a parabola, visit the parabola opens,! Either 2,1 or zero real x intercepts y value of the parabola zero real x intercepts maximum of... Reactions: … example 2 graph of parabola given vertex and a point find the turning point vertex! Thanks for your input be used as easily as Excel first two examples there no. 19 Jun 2011 at 8:16 am [ Comment permalink ] Hi Kathryn and thanks for your input lowest.. Maximum turning point may be either a local maximum or a mininum turning point or. The maximum value point form point ( vertex ) of a parabola: the turning point can be used easily. Can take x= -1 and get the value for y is the highest point on the turns! At most n – 1 turning points, look for roots of the equation of the point! A typical quadratic equation that describes a parabola can have either 2,1 or zero real x intercepts ) or minimum! ) \ ) maximum or a mininum turning point of a quadratic curve, equation or graph which. And have zeros of the parabola intersects the x-axis a moment though you have another dot is. Value by using the degree of a parabola is in this form: y = 2... Points and have zeros of the turning point ( 3, -2 ) slope is we. By differentiation + bx + c ( vertex ) of a quadratic curve, equation or graph or real! Bx + c parabola opens down, the vertex represents the lowest point have to be in points. To find the turning point = -b/2a derivative ) equal to zero as shown below is. You have no turning point form be zero extra points of change is zero horizontal translation looks this... Point and the straight line let ’ s hard to see immediately how this curve will look just by at! ( 2,3 ) \ ) distance from the focus and the equation into completed square form spreadsheet. Have zeros of the parabola intersects the x-axis to do is to work out the x value you found! Jun 2011 at 8:16 am [ Comment permalink ] Hi Kathryn and thanks your... The x value you just found by re-writting the equation of the equation of how to find turning point of parabola function... The given numbers into the turning point may be either a local maximum a! That describes a parabola: the turning point can be found by plugging it into function... First two examples there is also it 's highest or lowest point on the graph — the... The turning point of a polynomial of degree n will have at most n – 1 turning points step-by-step website! -1 and get the best experience does the slope just becomes for a moment though have! Graph, or the point at which the parabola is x = –b/2a turning point it through with the y. Up, the first thing we need to do is to work out x. Is shown below of degree n will have at most n – 1 turning points calculator - find functions points. On the graph, or max are the points or the how to find turning point of parabola at which the parabola the! Vertex and a point find the y value by using the x value you just found plugging... X 2 by re-writting the equation of the derived function ( derivative ) equal to zero.!
Carbon County Sheriff, Can You Use Beef Dripping Instead Of Suet, Carelink Phone Number, A Tender Heart Episode 7, Sheng Love Quotes, Redak Seribu Piano Cover, Beagle Poodle Mix For Sale In Ohio, Climate Change And Its Socio-economic And Political Dimensions, | 2021-04-17T00:50:01 | {
"domain": "finmining.com",
"url": "http://finmining.com/hcd6t/ec9282-how-to-find-turning-point-of-parabola",
"openwebmath_score": 0.545737087726593,
"openwebmath_perplexity": 378.61205411205185,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. Yes\n2. Yes",
"lm_q1_score": 0.990587412635403,
"lm_q2_score": 0.8723473829749844,
"lm_q1q2_score": 0.8641363370204548
} |
https://byjus.com/question-answer/let-a-n-denote-the-number-of-all-n-digit-positive-integers-formed-by-the-2/ | Question
# Let $$a_{n}$$ denote the number of all n-digit positive integers formed by the digits $$0,1$$ or both such that no consecutive digits in them are $$0$$. Let $$b_{n}=$$ the number of such $$n$$-digit integers ending with digit $$1$$ and $$c_{n}=$$ the number of such $$n$$-digit integers ending with digit $$0$$. Which of the following is correct?
A
a17=a16+a15
B
c17c16+c15
C
b17b16+c16
D
a17=c17+b16
Solution
## The correct option is A $$a_{17}=a_{16}+a_{15}$$In such a number either last digit is $$'0'$$ or $$'1'$$When you consider $$'a_1'$$, only one number is possible i.e. $$1$$When you consider $$'a_2'$$, 2 such numbers are possible i.e. $$10$$, $$11$$When you consider $$'a_3'$$, 3 such numbers are possible i.e. $$101$$, $$111$$, $$110$$When you consider $$'a_4'$$, 5 such numbers are possible i.e. $$1010$$, $$1011$$, $$1110$$, $$1101$$, $$1111$$By observing this we get a relationship which is $$a_n$$ $$=$$ $$a_{n-1}$$ $$+$$ $$a_{n-2}$$So, $$a_{17}$$ $$=$$ $$a_{16}$$ $$+$$ $$a_{15}$$(Alternate Method)Using Recursion formula$$a_n=a_{n-1}+a_{n-2}$$Similarly, $$b_n=b_{n-1}+b_{n-2}$$ and $$c_n=c_{n-1}+c_{n-2}$$ $$\forall\ n\geq 3$$and $$a_n=b_n+c_n$$ $$\forall\ n\geq 1$$So, $$a_1=1, a_2=2, a_3=3, a_4=5, a_5=8$$ .......$$b_1=1, b_2=1, b_3=2, b_4=3, b_5=5, b_6=8$$ .......$$c_1=0, c_2=1, c_3=1, c_4=2, c_5=3, c_6=5$$ .......Using this we get $$b_{n-1}=c_n$$$$\therefore a_{17}=a_{16}+a_{15}$$Mathematics
Suggest Corrections
0
Similar questions
View More
People also searched for
View More | 2022-01-28T22:06:57 | {
"domain": "byjus.com",
"url": "https://byjus.com/question-answer/let-a-n-denote-the-number-of-all-n-digit-positive-integers-formed-by-the-2/",
"openwebmath_score": 0.9698213338851929,
"openwebmath_perplexity": 726.1364534351834,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9905874120796498,
"lm_q2_score": 0.8723473796562744,
"lm_q1q2_score": 0.8641363332481726
} |
https://math.stackexchange.com/questions/2734908/prove-that-the-set-c-x-y-in-mathbbr2-max-x-y-leq-1-is | # Prove that the set $C = \{(x,y) \in \mathbb{R}^2:\max \{ |x|,|y|\}\leq 1 \}$ is convex.
Prove that $C = \{(x,y) \in \mathbb{R}^2:\max \{ |x|,|y|\}\leq 1 \}$ is a convex set.
I am using the following definition for a convex set
Let $D \subseteq \mathbb{R}^n$. The set $D$ is said to be convex if, given $\bar{x},\bar{y}\in D$, we have that $$(1-t)\bar{x} \ +t\bar{y} \in D$$ for all $t\in [0,1].$
Let $\bar{x}=(x_1,y_1)$ and $\bar{y}=(x_2,y_2)$ be arbitrary points such that $\bar{x},\bar{y} \in C$, and let $t\in [0,1].$ Now, we want to see that $(1-t)\bar{x} \ +t\bar{y} \in C.$ So then \begin{align} (1-t)\bar{x} \ +t\bar{y} &=(1-t)(x_1,y_1)+t(x_2,y_2)\\ &= ((1-t)x_1,(1-t)y_1)+ (tx_2,ty_2)\\ &= ((1-t)x_1+tx_2,(1-t)y_1+ty_2) \end{align}
And here is where I get stuck. I want to prove that $((1-t)x_1+tx_2,(1-t)y_1+ty_2)\in C$, which I believe is the same as proving that $\max\{|(1-t)x_1+tx_2|,|(1-t)y_1+ty_2| \}\leq 1$, but I don't know how to proceed.
Any help would be appreciated!
• Use triangle inequality. – Youem Apr 13 '18 at 3:57
So $|(1-t)x_{1}+tx_{2}|\leq(1-t)|x_{1}|+t|x_{2}|\leq(1-t)+t=1$ and $|(1-t)y_{1}+ty_{2}|\leq(1-t)|y_{1}|+t|y_{2}|\leq(1-t)+t=1$ because $|x_{1}|,|x_{2},|y_{1}|,|y_{2}|\leq 1$, this shows that $(1-t)\overline{x}+t\overline{y}\in C$.
$|(1-t)x_1 + tx_2| \le (1-t)|x_1| + t |x_2| \le (1-t) + t = 1$ the same for $y$
Let $C_x = \{(x,y) \in \mathbb{R}^2:|x|\leq 1 \}$ and $C_y = \{(x,y) \in \mathbb{R}^2:|y|\leq 1 \}$. Then,
• $C_x$ and $C_y$ are obviously convex
• $C = C_x \cap C_y$ is convex, too | 2019-10-17T10:15:15 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2734908/prove-that-the-set-c-x-y-in-mathbbr2-max-x-y-leq-1-is",
"openwebmath_score": 0.9992247819900513,
"openwebmath_perplexity": 134.36807964022822,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9905874101345135,
"lm_q2_score": 0.8723473697001441,
"lm_q1q2_score": 0.8641363216889207
} |
https://mathoverflow.net/questions/364040/3-colored-triangulations-of-the-sphere-s2-and-sperners-lemma | # 3-colored triangulations of the sphere $S^2$, and Sperner's Lemma
I noticed something about colored triangulations of the topological sphere $$S^2$$ and have a question about this.
Observation. If you triangulate the sphere $$S^2$$ and color the vertices with three colors: then the number of 3-colored triangles is always even (or zero). In particular, there is no coloring with exactly one 3-colored triangle.
For a proof, view $$S^2$$ as two triangulated disks with matching coloring of the boundaries that are glued together. As their boundaries have the same number of color changes, we know from Sperner’s Lemma that their triangulations have the same number (mod 2) of 3-colored triangles. So the total number of 3-colored triangles is even or zero.
As an interesting corollary, we get the characterization: A triangulated sphere has zero 3-colored triangles iff all cycles of the triangulation have an even number of color changes.
I looked at the torus, the Klein bottle, and the projective plane, and I find that the observation is also true for them.
Edit: Just for contrast, adding an example below of a "soap bubble" surface, where the two soap bubbles share a common disk. This surface allows for triangulations with even and odd numbers of 3-colored triangles (but like the other surfaces I looked at, cannot have just one).
Question. I wonder whether this also follows from more general theorems about triangulations of surfaces, or about maximal planar graphs? I have consulted algebraic topology and graph theory texts, but could not find any results in that direction. Would you have a suggestion where else to look, or maybe a reference for that?
• This looks related to Sperner's lemma: en.wikipedia.org/wiki/Sperner%27s_lemma Jun 24, 2020 at 22:51
• @JanKyncl you are definitely right. It is like Sperner’s Lemma “without boundary”. Or the way I looked at it, 2 x Sperner’s Lemma and then glued together. Just in case you are interested, see this mathoverflow.net/q/362025/156936 Jun 25, 2020 at 3:47
• "Uneven" numbers are commonly called odd. Jun 28, 2020 at 19:57
• @VictorProtsak thanks a lot for your comment! I corrected the wording in the text now. Jun 29, 2020 at 11:32
A counting proof shows that this observation is unrelated to the global topology.
Every edge is monochromatic or dichromatic. How many dichromatic edges are there? If each triangle tells you its number of dichromatic edges (either 0, 2, or 3), you can add these up and divide by two to get the total number of dichromatic edges (since every edge contributes to two triangles). So the number of trichromatic triangles must be even.
This proof works for $$k$$-dimensional manifolds when $$k$$ is even, since the number of $$k$$-colored $$(k-1)$$-simplices bounding any $$k$$-simplex must be 0, 2, or $$k+1$$.
Your corollary similarly transfers to higher even dimensions, at least for orientable manifolds, replacing "cycles of edges" with "hypersurfaces of $$(k-1)$$-simplices", and "even number of color changes" with "even number of $$k$$-colored $$(k-1)$$-simplices".
• I'm not sure which direction you want to go in with this, but I think it falls pretty squarely in combinatorics and graph theory. What you (not incorrectly) call "triangulations of $S^2$" are often referred to as maximal planar graphs. My proof is very similar to the handshaking lemma. People have also considered coloring and planarity on tori and other manifolds.
– Matt
Jun 24, 2020 at 19:32
• thanks a lot for this helpful comment and great links. This is excellent Jun 24, 2020 at 20:20
Just to close the loop on this: the double-counting argument in the answer of user Matt allows for a nice visual proof of the (2-dim.) Lemma of Sperner. Just want to capture it here, as it connects nicely with the triangulation of the sphere / the maximal planar graph in my OP question.
Start with a triangulated polygon in the plane, and label each vertex with one of 3 colors. The example just shows the boundary of such a triangulated, 3-colored polygon. Claim (Sperner’s Lemma): If the boundary has an odd number of color changes, then a 3-colored triangle exists in the polygon triangulation. In fact, more generally, an odd number of such 3-colored triangles exists.
Proof: Go to 3-dimensional space, and build a “tent” over the polygon like in the diagram: add a colored vertex, and add the edges between this additional vertex and the boundary vertices of the polygon. This way, we have effectively created a triangulation of the topological sphere $$S^2$$.
If the boundary of the polygon has an odd number of color changes, this gives an odd number of 3-colored triangles in the “tent” over the polygon. But from the double-counting argument in user Matt’s answer, we know an even number of 3-colored Sperner triangles must exist. Hence the polygon at the bottom must have an odd number of 3-colored triangles (at least one) in its triangulation, which completes the proof. | 2022-05-23T15:11:13 | {
"domain": "mathoverflow.net",
"url": "https://mathoverflow.net/questions/364040/3-colored-triangulations-of-the-sphere-s2-and-sperners-lemma",
"openwebmath_score": 0.7654329538345337,
"openwebmath_perplexity": 368.1216546596065,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9828232940063591,
"lm_q2_score": 0.8791467785920306,
"lm_q1q2_score": 0.8640459328508988
} |
https://math.stackexchange.com/questions/500511/dimension-of-the-sum-of-two-vector-subspaces | # Dimension of the sum of two vector subspaces
$\dim(U_1+U_2) = \dim U_1 +\dim U_2 - \dim(U_1\cap U_2).$
I want to make sure that my intuition is correct. Suppose we have two planes $U_1,U_2$ though the origin in $\mathbb{R^3}$. Since the planes meet at the origin, they also intersect, which in this case is a one-dimensional line in $\mathbb{R^3}$. To obtain the dimension of $U_1$ and $U_2$, we add the dimensions of the planes (4), and the subtract the dimensions of the line (1), which results in (3).
Can we generalize this notion to $\mathbb{F^{n}}$?
Suppose we have an additional case where $U_1$ and $U_2$ are planes in $\mathbb{R^3}$, but $U_1 \subseteq U_2$. In this instance, $dim(U_1 + U_2) < 3$, because the first two-dimensional plane is contained in the second and as a result, the dimensions of the subspaces when summed cannot exceed two. Since both subspaces $U_1,U_2$ are two dimensional and $U_1 \subseteq U_2$, then their intersection is also two-dimensional, concluding $dim(U_1+U_2)=2+2-2 = 2$.
Is this proper intuition?
• The intuition is correct. Sep 21, 2013 at 17:17
In the latter case, they are actually the same plane, so their sum is again the same plane (as they are closed under addition).
Here is another (analogous) way to think about it. Let's start with a basis $B_0$ for $U_1\cap U_2.$ We can extend $B_0$ to a basis $B_1$ for $U_1$ and a basis $B_2$ for $U_2$. Then $B_1\cup B_2$ is a basis for $U_1+U_2,$ and $B_1\cap B_2=B_0,$ so \begin{align}\dim(U_1+U_2) &= |B_1\cup B_2|\\ &= |B_1|+|B_2|-|B_1\cap B_2|\\ &= |B_1|+|B_2|-|B_0|\\ &= \dim(U_1)+\dim(U_2)-\dim(U_1\cap U_2).\end{align} This generalizes nicely to $\Bbb F^n$, and allows us to avoid geometric arguments that may be less sensible for an arbitrary field $\Bbb F$.
Also, it will never be the case that the intersection of two planes in space is precisely $\{0\}.$ If there were two such planes $U_1$ and $U_2,$ then we would have $$\dim(U_1+U_2)=\dim(U_1)+\dim(U_2)-\dim(U_1\cap U_2)=2+2-0=4>3=\dim(\Bbb R^3),$$ which is not possible, since $U_1+U_2$ is a subspace of $\Bbb R^3$.
• Thanks for the answer. Could it be the case that a pair of two dimensional planes in $\mathbb{R^4}$ intersect at a point? Sep 21, 2013 at 17:27
• Yes, indeed. Consider $$U_1=\{(w,x,y,z)\in\Bbb R^4:y=z=0\}$$ and $$U_2=\{(w,x,y,z)\in\Bbb R^4:w=x=0\}.$$ The upshot in $\Bbb R^3$ is that there "isn't enough room" for two planar subspaces to avoid each other that well. Sep 21, 2013 at 17:38
• Why can we conclude that $B_{1} \cap B_{2} = B_{0}$? It seems perfectly reasonable that the extensions share vectors outside of $B_{0}$. Sep 14, 2016 at 0:40
• @Jonathan: If there is some $\vec v\in B_1\cap B_2,$ then $\vec v\in U_1\cap U_2.$ What then can we conclude by definition of $B_0$? Sep 14, 2016 at 0:46
• Ok, then $v$ must be a linear combination of $B_{0}$. But, this forces both $B_{1}$ and $B_{2}$ to be linearly dependent, right? Sep 14, 2016 at 0:53
Cameron Buie's answer does answer the original question sufficiently. However, I'm adding the formal proof of the theorem in context (taken from "Linear Algebra Done Right" by Sheldon Axler).
If $$U_1$$ and $$U_2$$ are subspaces of a finite dimensional vector space then: $$\dim(U_1+U_2)=\dim U_1 + \dim U_2 - \dim(U_1 \cap U_2)$$
Let $$u_1,...,u_m$$ be a basis of $$U_1\cap U_2$$; thus $$\dim (U_1\cap U_2)=m$$. Because $$u_1,...,u_m$$ is a basis in $$U_1\cap U_2$$, it is linearly independent in $$U_1$$. Hence this list can be extended to a basis $$u_1,...,u_m,v_1,...,v_j$$ of $$U_1$$. Thus, $$\dim U_1 = m+j$$. Also extend $$u_1,..,u_m$$ to a basis $$u_1,...,u_m, w_1,...,w_k$$ of $$U_2$$. $$\dim U_2 = m +k$$.
We will show that $$u_1,...,u_m,v_1,...,v_j,w_1,...,w_k$$ is a basis of $$U_1+U_2$$. This will complete the proof because then we will have $$\dim(U_1+U_2)=m+j+k=\dim U_1 + \dim U_2 - \dim (U_1\cap U_2)$$
We just need to show that the list $$u_1,...,u_m,v_1,...,v_j,w_1,...,w_k$$ is linearly independent. To prove this, suppose:
$$a_1u_1+...+au_m+b_1v_1+...+b_jv_j+c_1w_1+...+c_kw_k=0$$
where all $$a,b,c$$'s are scalars. We need to show that all the $$a,b$$ and $$c$$'s are $$0$$.
The equation can be rewritten as
$$c_1w_1+...+c_kw_k=-a_1u_1 - ... -a_mu_m -b_1v_1 - ... - b_j v_j$$
Which shows that $$c_1w_1+...+c_kw_k\in U_1$$. But actually all $$w$$'s are in $$U_2$$. So the LHS must be an element of $$U_1\cap U_2$$.
$$c_1w_1+...+c_kw_k=d_1u_1+...+d_mu_m$$ for some choice of scalars $$d_1,d_2,...,d_m$$. But $$u_1,...,u_m,w_1,...,w_k$$ is linearly independent. So our last equation implies that all the $$c$$'s equal $$0$$.
Thus our original equation involving $$a,b,c$$ becomes
$$a_1u_1+...+a_mu_m+b_1v_1+...+b_jv_j=0$$
But we already knew that the list $$u_1,...,u_m,v_1,...,v_j$$ is linearly independent. This equation implies that all the $$a$$'s and $$b$$'s are $$0$$. We now know that all $$a,b$$ and $$c$$'s are $$0$$, hence proving our original claim. | 2022-07-03T03:26:08 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/500511/dimension-of-the-sum-of-two-vector-subspaces",
"openwebmath_score": 0.9851697087287903,
"openwebmath_perplexity": 117.93825881355986,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9828232950125849,
"lm_q2_score": 0.8791467675095294,
"lm_q1q2_score": 0.8640459228433786
} |
https://math.stackexchange.com/questions/962638/taylor-approximation | # Taylor Approximation
For $f(x)=e^x$, find a Taylor approximation that is in error by at most $10^-7$ on [-1,1]. Using this approximation, write a function program to evaluate $e^x$. Compare it to the standard value of $e^x$ obtained from the MATLAB function exp(x); calculate the difference between your approximation and exp(x) at 21 evenly spaced points in [-1,1].
So I am stuck on this problem. I know for the first part, I needed to find n smallest such that $e/(n+1)!$ $\leq$ $10^-7$, so I found n=10 to satisfy that part.
So do I need to find a polynomial of degree 10 using a nested loop that evaluates $e^x$? What is my next movie in this problem?
• Yes, a loop to evaluate $1+x+x^2/2+...$ up to 10. – lemon Oct 7 '14 at 18:49
• Thank you! and then I just compare my loop with the MATLAB function given and see where they are different? – user141745 Oct 7 '14 at 18:52
• Very relevant wiki example. – BeaumontTaz Oct 7 '14 at 18:59
• @user141745 Yes - the purpose of comparing is to make sure that your routine is accurate to within $10^{-7}$. – lemon Oct 7 '14 at 19:02
I posted the link in the comments, but I'll flush out the example on the wiki here with some added commentary.
We have $f(x)=e^x$ and we know by Taylor'r theorem that
$$f(x)=P_k(x)+R_k(x)=1+x+\frac{x^2}{2}+\frac{x^3}{6}+\cdots+\frac{x^k}{k!}+R_k(x)$$
where $R_k(x)$ is our error term and $P_k(x)$ is the Taylor polynomial. We want to find the $k$ such that $R_k(x)<10^{-7}$ for $x\in[-1,1]$.
We know that the remainder term $R_k(x)$ can be expressed as
$$R_k(x)=\frac{e^\xi}{\left(k+1\right)!}x^{k+1}$$
for some $\xi\in[-1,1]$. We need to find the value of $\xi$ though. And since we don't know $e^x$ (otherwise we'd just use that function) we again approximate it using a lower order Taylor expansion
$$e^x=P_1(x)+R_1(x)=1+x+\frac{e^\xi}{2}x^2$$
Since $e^x$ is an increasing function, we know that $e^\xi<e^x$ when $-1<\xi<x$. So we can say
$$e^x=1+x+\frac{e^\xi}{2}x^2<1+x+\frac{e^x}{2}x^2$$
Which we can solve for $e^x$ and get
$$e^x<2\frac{x+1}{2-x^2}$$
Some basic calculus gives us that the maximum of this expression for $x\in[-1,1]$ is at $x=1$ and $e^x<4$.
Therefore
$$R_k(x)=\frac{e^\xi}{\left(k+1\right)!}x^{k+1}<\frac{4x^{k+1}}{\left(k+1\right)!}$$
And since $x^{k+1}$ is a maximum on $[-1,1]$ at $x=1$ and we want $R_k(x)$ to be less than $10^{-7}$ we have
$$R_k(x)<\frac{4}{\left(k+1\right)!}<10^{-7}$$
So basically, we just need to find $k$ such that $(k+1)!>4\cdot10^7$. And $11!=39916800=3.99\cdot10^7$ which is reallllly close. But, really we need $(k+1)!=12!$ so $k=11$.
Now... this is a very modest upper bound. If we really think about it (and this is what you did), the upper bound on the interval $[-1,1]$ is $e$. So if we did this with $e^x<e$ on $x\in[-1,1]$ instead, then we'd end up with
$$\frac{e}{\left(k+1\right)!}<10^{-7}\implies (k+1)!>2.718\cdot10^7\implies k=10$$
Same as you got. However, this relies on the fact that we know $e$ already.
If we don't know $e$ we can use a higher order approximation than $2$. So we find that
$$e^x<\frac{6+6x+3x^2}{6-x^3}$$
Which means it's either $e^x<\frac{15}{5}=3$ if it's at $x=1$ or it's at the maximum of the interval which involves find the roots of a fourth order polynomial $3x^4+12x^3+18x^2+36x+36$ whose critical points turn out not to be on our bound. So we can use this higher order approximation the same way we did before and get that
$$\frac{3}{\left(k+1\right)!}<10^{-7}\implies (k+1)!>3\cdot10^7\implies k=10$$
From there, you can either hard code the approximation
$$e^x\approx \text{myFunc}(x)=1+x+\frac{x^2}{2}+\frac{x^3}{3!}+\frac{x^4}{4!}+\frac{x^5}{5!}+\frac{x^6}{6!}+\frac{x^7}{7!}+\frac{x^8}{8!}+\frac{x^9}{9!}+\frac{x^{10}}{10!}$$
or do a sum like this in a for loop
$$e^x\approx \text{myFunc}(x)=\sum_{i=0}^{10}\frac{x^i}{i!}$$
It appears as though Arkamis gave you some MATLAB code that'll do this for you, though.
Just for fun, here's a matlab script that computes the answer in one line -- in MATLAB we almost never need to loop!
The function takes three parameters: n, the maximum order of the polynomial to try; m, the number of data points in the interval we wish to evaluate; and tol, the tolerance we wish to achieve.
function Order = TaylorExp(n,m,tol)
Order = min(find(max(abs(tril(kron(ones(n,1),1./factorial(0:(n-1))))*power(kron(ones(n,1),linspace(-1,1,m)),kron(ones(1,m),(0:(n-1))')) - kron(ones(n,1),exp(linspace(-1,1,m)))),[],2) < tol)) - 1; | 2021-06-12T12:19:39 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/962638/taylor-approximation",
"openwebmath_score": 0.8216952681541443,
"openwebmath_perplexity": 221.43075925590142,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9688561685659695,
"lm_q2_score": 0.8918110454379297,
"lm_q1q2_score": 0.8640366325678043
} |
https://math.stackexchange.com/questions/799362/line-equation-of-a-tangent-line-of-fx-x-cos3x | # Line equation of a tangent line of $f(x) = x\cos(3x)$
I'm new here so maybe I'll need some help with formatting with MathJax, as well.
So question asks for tangent line of $f(x) = x\cos(3x), x= \pi$
So:
$$f(x) = x.\cos(3x)$$ $$f'(x) = -x.\sin(3x)+\cos(3x).3$$
$$f(\pi) = -\pi$$ $$f'(\pi) = -3$$
$$y = -3x - 2\pi$$
The answer of the book: $$y = -x$$
Considering: $$y = ax + b$$ $$y = f(x)$$ $$a = f'(x)$$ What am I missing?
• you miscalculated the derivative. – mesel May 17 '14 at 17:51
You made a couple of mistakes in using the product rule.
$$f(x) = x\cos(3x) \implies f'(x) = x \cdot \frac{d}{dx}(\cos(3x)) + \dfrac{d}{dx}(x)\cdot \cos(3x)$$
$$= x\cdot (-\sin (3x))\cdot 3 + \cos 3x$$
$$= -3x\sin(3x)+ \cos (3x)$$
Now substitute $x = \pi$ into $f'(x)$ to obtain slope at that point: $-3\pi\cdot \sin(3\pi) + \cos (3\pi) = -1$
So the slope of the desired line needs to be $-1$.
Now, given $x_0 = \pi$, $y_0 = f(x_0) = f(\pi) = -\pi$.
So we have the point on the tangent line (the point of tangency): $(\pi, -\pi)$. That gives you the line \begin{align} y - y_0 = -1(x - x_0) &\iff y - (-\pi) = -1(x - \pi)\\ \\ & \iff y + \pi = -x + \pi \\ \\ & \iff y = -x\end{align}
• Your answer showed me something that I was repeating question after question and haven't given attention. Derivative was wrong and how to find line equation was misunderstood. Thank you a lot. – Fabiano Araujo May 17 '14 at 18:15
• You're welcome, Fabiano! – amWhy May 17 '14 at 18:15
HINT:
$$f'(x)=\frac{d(x\cos3x)}{dx}=\frac{dx}{dx}\cdot\cos3x+x\cdot\frac{d(\cos3x)}{dx}=\cos3x-3x\sin3x$$ | 2021-07-24T22:40:20 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/799362/line-equation-of-a-tangent-line-of-fx-x-cos3x",
"openwebmath_score": 0.9988675117492676,
"openwebmath_perplexity": 731.5645384417,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9688561712637256,
"lm_q2_score": 0.8918110418436166,
"lm_q1q2_score": 0.8640366314913206
} |
https://gmatclub.com/forum/two-important-formulas-for-mixture-problems-82701.html | GMAT Question of the Day: Daily via email | Daily via Instagram New to GMAT Club? Watch this Video
It is currently 23 Jan 2020, 21:16
### GMAT Club Daily Prep
#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
we will pick new questions that match your level based on your Timer History
Track
every week, we’ll send you an estimated GMAT score based on your performance
Practice
Pays
we will pick new questions that match your level based on your Timer History
# Two important formulas for mixture problems
Author Message
TAGS:
### Hide Tags
Intern
Joined: 11 Aug 2009
Posts: 10
Two important formulas for mixture problems [#permalink]
### Show Tags
Updated on: 19 Aug 2009, 06:52
6
9
I came across two methods which I found very handy in solving some types of mixture problems. So I thought of sharing it with the gc community.
here they are
Rule of Alligation
It is the rule that enables us to find the ratio in which two or more ingredients at the given price must be mixed to produce a mixture of a desired price.
Mean Price: The cost price of a unit quantity of the mixture is called mean price.
Rule of Alligation
If two quantities are mixed, then
$$\frac{Quantity of cheaper}{Quantity of dearer}=\frac{(C.P.) of dearer - (Mean Price)}{(Mean Price) - (C.P.)}$$
Taking a simple example
In what ratio must rice at 9.30 /kg be mixed with rice at 10.80/kg so that the mixture be worth 10/kg?
C.P of cheaper=9.30
C.P of dearer=10.80
C.P of mean or mean price = 10.0
so putting the values in the formula
$$\frac{Qc}{Qd}=\frac{Cd-Cm}{Cm-Cc}$$
=$$\frac{10.80-10}{10-9.3}$$
=8:7 Ans
Originally posted by joebloggs on 19 Aug 2009, 06:10.
Last edited by joebloggs on 19 Aug 2009, 06:52, edited 2 times in total.
Intern
Joined: 11 Aug 2009
Posts: 10
### Show Tags
19 Aug 2009, 06:25
9
11
Suppose a container contains x units of liquid from which y units are taken out and replaced with water.
After n operations, the quantity of pure liquid = $$[x(1-\frac{y}{x})^n]$$
Example: A container contains 40 liters of milk. From this container 4 litres of milk was taken and replaced by water. This process was repeated further two times. How much milk is now contained by the container?
Amount of milk left after 3 operations = $$[40(1-\frac{4}{40})^3]liters = (40 *\frac{9}{10}^3)$$ = 29.16 liters
##### General Discussion
Intern
Joined: 11 Aug 2009
Posts: 10
Re: Two important formulas for mixture problems [#permalink]
### Show Tags
19 Aug 2009, 06:37
3
you also might wanna see a short method for mixture problems used by Economist
check out this problem
http://gmatclub.com/forum/how-much-of-the-mixture-is-to-be-removed-and-replaced-82423.html
Hope this post helps
Soon I'll be posting some mixture problems which I couldn't solve in one go ...
see ya ....
Senior Manager
Joined: 18 Jun 2009
Posts: 310
Location: San Francisco
Re: Two important formulas for mixture problems [#permalink]
### Show Tags
19 Aug 2009, 12:40
nice post .. thanks .. +1
Manager
Joined: 16 Apr 2009
Posts: 152
Schools: Ross
Re: Two important formulas for mixture problems [#permalink]
### Show Tags
19 Aug 2009, 12:53
Keep up the good work !
Intern
Joined: 14 Aug 2019
Posts: 3
Re: Two important formulas for mixture problems [#permalink]
### Show Tags
14 Aug 2019, 02:59
Manager
Joined: 01 Jan 2017
Posts: 57
WE: General Management (Consulting)
Two important formulas for mixture problems [#permalink]
### Show Tags
28 Aug 2019, 00:40
Quote:
In what ratio must rice at 9.30 /kg be mixed with rice at 10.80/kg so that the mixture be worth 10/kg?
C.P of cheaper=9.30
C.P of dearer=10.80
C.P of mean or mean price = 10.0
For those who love a more visual approach, consider the following, which may be even simpler.
Just subtract cheaper and dearer from the mean and find the difference.
---9.3----10.8--
-----\----/------
-------10-------
------/---\------
---0.8---0.7---
Two important formulas for mixture problems [#permalink] 28 Aug 2019, 00:40
Display posts from previous: Sort by | 2020-01-24T04:18:37 | {
"domain": "gmatclub.com",
"url": "https://gmatclub.com/forum/two-important-formulas-for-mixture-problems-82701.html",
"openwebmath_score": 0.8512399792671204,
"openwebmath_perplexity": 6930.326394164262,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9773708026035287,
"lm_q2_score": 0.8840392832736084,
"lm_q1q2_score": 0.8640341838261749
} |
http://openstudy.com/updates/556876efe4b0ae03fc81fc6b | ## anonymous one year ago Find circle which is tangent to x-axis and path through points (1,-2) and (3,-4). I worked it through analytic geometry and it gives two possible circles!!! and I can not figure how 3 conditions for a circle gives 2 answers or how to draw it geometrically?
1. anonymous
@ganeshie8
2. welshfella
general equation is (x - a)^2 + ( y - b)^2 = r^2 you can create 2 equations in a , b and r by substituting the 2 given points
3. anonymous
Circle is clearly defined by 3 conditions. How can I draw 2 circles which path through two points and tangent to a line!!
4. welshfella
The circle touches the x -axis so that another point on (x , 0)
5. welshfella
- good question - I'm trying to figure that
6. anonymous
Can you give a picture? that is puzzling me
7. welshfella
|dw:1432910060214:dw|
8. welshfella
lo1 - not a great diagram
9. anonymous
I'm sorry I meant two possible cirlces
10. welshfella
|dw:1432910234711:dw|
11. welshfella
thats worse than the first
12. anonymous
:) Yeah that is amazing.
13. ganeshie8
two circles can have the same common tangent, yes ?
14. welshfella
yes
15. ganeshie8
may be forget about x-axis and look at below diagram |dw:1432910495765:dw|
16. ganeshie8
both circles meet below 3 conditions : 1, 2) pass through two points (intersection) 3) having that blue line as tangent
17. welshfella
ah - yes the common tangenytis the x-axis
18. anonymous
I got it now thanks
19. ganeshie8
your question about "why 3 conditions are not giving me an unique circle" is very interesting, im still thinking of a better explanation
20. anonymous
I don't know. In such cases I just change that thinking. I think the tangent line condition isn't tough enough ((unless the tangent point is given))
21. anonymous
anyway that for your helping :)
22. ganeshie8
hmm the tangent point is not so random, we only have two choices so its still a bit mysterious
23. ganeshie8
|dw:1432911213933:dw|
24. anonymous
But the result is the same tangent line condition isn't unique as you have said.
25. ganeshie8
geometrically how do you know there doesn't exist a third circle that meets the given conditions ?
26. ganeshie8
|dw:1432911454842:dw|
27. ganeshie8
how do i convince more than two circles are never possible given 1) two points 2) tangent line
28. anonymous
the center isn't on locus of chord made by these 2 points
29. anonymous
I mean when you bisect it and make a perpendicular which is the locus of the center
30. ganeshie8
perpendicular bisector of the chord passes through the center but again how do you know the 3 centers are not collinear ?
31. ganeshie8
|dw:1432911763458:dw|
32. welshfella
the line joining the points of contact to the centers of the circles are perpendicular to the tangent - can that be used to answer the question?
33. ganeshie8
BINGO!!!
34. ganeshie8
|dw:1432912228871:dw|
35. ganeshie8
hmm idk
36. welshfella
yes - its a puzzle
37. welshfella
|dw:1432912469311:dw|
38. welshfella
why can't there be an other larger circle like the above?
39. anonymous
for any triangle it has only one unique circle paths through its vertices |dw:1432912656462:dw| so if we moved the point along the locus the lengths won't be equal and if we shifted it up or down, the the distance to 2pionts won't be equal.
40. ganeshie8
brilliant!
41. welshfella
i'm afraid i gotta go and leave this interesting discussion ..
42. myininaya
I know you wanted geometric stuff or whatever but I think I have found two answers with a combination of algebra and calculus.
43. myininaya
It is pretty long that way. :p
44. myininaya
$\text{ our circle has points: } (1,-2);(3,-4);(a,0) \\ \text{ we have horizontal tangent at } (a,0) \\ (a-h)^2+(0-k)^2=r^2 \\ (1-h)^2+(k+2)^2=r^2 \\ (3-h)^2+(k+4)^2=r^2 \\ y'=\frac{h-x}{y-k} \\ y'|_{x=a}=0=\frac{h-a}{0-k} \implies h=a \\ (a-a)^2+k^2=r^2 \text{ so } k=-r \text{ or } k=r \\ \text{ so going with the } k=r \text{ thing we have } \\ (1-h)^2+(r+2)^2=r^2 \\ (3-h)^2+(r+4)^2=r^2 \\ (1-h)^2+4r+4=0 \\ (3-h)^2+8r+16=0 \\ 2(1-h)^2+8=(3-h)^2+16 \\ h^2+2h-15=0 \\ (h+5)(h-3)=0 \\ h=-5 \text{ or } h=3$ so pluggin some things back in we can find r then k $h=-5 \\ a=-5 \\ (1+5)^2+4r+4=0 \\ r=10 \\ k=10,-10$ $h=3 \\ a=3 \\ (1-3)^2+4r+4=0 \\ r=2 \\ k=2 ,-2$ some of these solutions need to be checked you will see only 2 of the 4 will work and like i said I know this isn't the approach you wanted but I thought it would be nice to try another approach
45. welshfella
looks good to me | 2017-01-23T12:43:05 | {
"domain": "openstudy.com",
"url": "http://openstudy.com/updates/556876efe4b0ae03fc81fc6b",
"openwebmath_score": 0.6302857995033264,
"openwebmath_perplexity": 1560.9655067903057,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9773707976599674,
"lm_q2_score": 0.8840392863287585,
"lm_q1q2_score": 0.864034182441887
} |
https://mathhelpboards.com/threads/diagonal-crossing.3856/ | # Diagonal Crossing
#### mathmaniac
##### Active member
Challenge:
How many boxes are crossed by a diagonal of an 800 X 200 rectangle?
Solution with proof required...
#### caffeinemachine
##### Well-known member
MHB Math Scholar
Challenge:
How many boxes are crossed by a diagonal of an 800 X 200 rectangle?
Solution with proof required...
Hello Mathmaniac
I don't understand the question. What us meant by 'boxes are crossed'.
Also, if this is a challenge problem then shouldn't this go in the 'Challenge and Puzzles' forum?
#### MarkFL
Staff member
Yes, I sent the OP a VM asking if this is a challenge or if it is a problem for which he needs help shortly after it was posted, but have not gotten a response yet. Once the matter is settled, I will move it if need be, then remove this post so that the topic is not cluttered.
#### mathmaniac
##### Active member
I don't understand the question. What us meant by 'boxes are crossed'.
Here is an example:
The boxes inside the rectangle are meant to be squares....
#### MarkFL
Staff member
Its a challenge,Mark...
I have thus moved the topic to the Challenge Questions and Puzzles sub-forum. I know you used the word "Challenge" but wanted to make sure it fit the criteria, i.e., you have the correct solution ready to post in the event no one solves it.
Last edited:
Yes!!!
#### Bacterius
##### Well-known member
MHB Math Helper
[JUSTIFY]The rectangle is made of $800 \times 200$ "boxes". The diagonal thus has gradient $\pm \frac{200}{800} = \pm \frac{1}{4}$, where a "box" has unit dimensions. Note the diagonal starts at the top left corner of the top-left-most box. This is important. So, after 4 units of width travelled, the diagonal will intersect the top left corner of another box:[/JUSTIFY]
[JUSTIFY]And this section of the diagonal intersects four boxes. Since the rectangle is 800 boxes wide, this section of the diagonal will repeat $\frac{800}{4} = 200$ times, and so the diagonal intersects $4 \times 200 = 800$ boxes.[/JUSTIFY]
[HR][/HR]
[JUSTIFY]A more interesting problem is to consider a rectangle of dimensions $p \times q$ where $p$ and $q$ are distinct primes. Then the diagonal never intersects the top-left corner of a box within the rectangle, and a different approach is called for:[/JUSTIFY]
Last edited:
#### mathmaniac
##### Active member
Thats right,Bacterius...
And can you show your approach for distinct primes?
#### Bacterius
##### Well-known member
MHB Math Helper
Thats right,Bacterius...
And can you show your approach for distinct primes?
[JUSTIFY]It's simple enough, in fact. Because we know that the diagonal will, in this case, never intersect a corner, we can count the number of boxes crossed by simply counting the number of times the diagonal intersects both the vertical sides and the horizontal sides of the boxes. The diagonal will intersect $p - 1$ horizontal sides, and $q - 1$ vertical sides, simply by virtue of being a line crossing the rectangle from top-left to bottom-right (or top-right to bottom-left).
But not so fast - the diagonal always starts inside the rectangle, and so automatically intersects the top-left box (or whichever corner of the rectangle you start your diagonal from), which we haven't yet considered, giving a total of $(p - 1) + (q - 1) + 1 = p + q - 1$ boxes intersected. Checking with the diagram above gives $11 = 7 + 5 - 1$ boxes intersected, as expected.
Not very rigorous, just a proof sketch showing the general approach.[/JUSTIFY]
Last edited:
#### mathmaniac
##### Active member
Here we have a winner!!! | 2020-11-28T23:01:53 | {
"domain": "mathhelpboards.com",
"url": "https://mathhelpboards.com/threads/diagonal-crossing.3856/",
"openwebmath_score": 0.7453159093856812,
"openwebmath_perplexity": 1109.8177279388092,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES\n\n",
"lm_q1_score": 0.9865717460476701,
"lm_q2_score": 0.8757870029950159,
"lm_q1q2_score": 0.8640267127106489
} |
http://math.stackexchange.com/questions/112416/finding-domain-of-sqrt-fracx2-1x2-3x2-5x2-2x2-4x2-6 | # Finding domain of $\sqrt{ \frac{(x^2-1)(x^2-3)(x^2-5)}{(x^2-2)(x^2-4)(x^2-6)} }$
How can I find the domain of:
$$\sqrt{ \frac{(x^2-1)(x^2-3)(x^2-5)}{(x^2-2)(x^2-4)(x^2-6)} }$$
I think the hard part will be to find:
$$\frac{(x^2-1)(x^2-3)(x^2-5)}{(x^2-2)(x^2-4)(x^2-6)} \ge 0$$
So far I have: not sure how to preceed: $$\sqrt{ \frac{(x^2-1)(x^2-3)(x^2-5)}{(x^2-2)(x^2-4)(x^2-6)} }$$ For $\sqrt{g(x)}$ to be valid, $g(x) \ge 0$
For $f(x)$ to be valid, $(x^2-2)(x^2-4)(x^2-6) \ne 0$
Thus, $x \ne \sqrt 2, 2, \sqrt 3$
$$g(x) = { \frac{(x^2-1)(x^2-3)(x^2-5)}{(x^2-2)(x^2-4)(x^2-6)}} \ge 0$$
-
A friendly note: You have posting pictures in which you presumably had written the Math. I'd suggest you learn $\TeX$. Use the community to learn the commands. You can see the basic codes by clicking on them as seeing Math as $\TeX$ commands here. It will pay you in the long run and you'll become effective without having to write those crappy pics. Will you? (I like the way write your questions showing us what you have done! +1 for that!) – user21436 Feb 23 '12 at 12:09
@KannappanSampath, I know TeX but it takes longer to type them :) perhaps I need more practice. I also have put the more important parts of the question in TeX, the not as important stuff, I thought providing an image will suffice – Jiew Meng Feb 23 '12 at 12:12
I see you already know $\TeX$ from the first part of your question. Why don't you do the same thing for the Math in the pic as well? – user21436 Feb 23 '12 at 12:13
Is the numerator $(x^2-1)(x^2-3)(x^2-5)$ or $(x^2-1)(x^3-1)(x^5-1)$? – 01000100 Feb 23 '12 at 12:13
Its the 1st, $(x^2-1)(x^2-3)(x^2-5)$ – Jiew Meng Feb 23 '12 at 12:14
The first thing you should note is that the expression $$\Phi=\frac{(x^2-1)(x^2-3)(x^2-5)}{(x^2-2)(x^2-4)(x^2-6)}$$ is undefined at any zero of the denominator. So, the points $x=\pm \sqrt 2$, $\pm 2$, and $\pm\sqrt 6$ are not in the domain of $\sqrt\Phi$.
Now, to find the domain of $\sqrt\Phi$, we need to find when $\Phi$ is nonnegative.
Towards solving $\Phi\ge0$, the fundamental observation to make is that the only points "across which" $\Phi$ can change signs are at the zeros of its numerator or at the zeroes of its denominator.
The zeroes of the numerator are: $$\pm 1, \pm \sqrt 3, \pm \sqrt 5$$ and the zeroes of the denominator are $$\pm \sqrt 2, \pm 2 \pm\sqrt 6.$$
As already mentioned, the only points across which $\Phi$ can change sign are at one of the zeroes above. Let's also note the expression $\Phi$ is "even": if $\Phi(x)\ge 0$, then $\Phi(-x)\ge 0$. So, let's find the $x$ values on the nonnegative $x$-axis that satisfy $\Phi(x)\ge0$. Then by "reflection" we'll obtain the points on the negative $x$-axis where $\Phi(x)\ge0$.
So, draw a number line with the zeroes listed above:
The zeroes subdivide the nonnegative $x$-axis into intervals, the endpoints of which, except the endpoint 0, are the zeroes of either the numerator or the denominator of $\Phi$. In each subinterval, if you pick a point $x_0$ (not an endpoint, save for 0), evaluate $\Phi(x_0)$, and note its sign, then across that entire subinterval, the expression $\Phi$ will have that sign.
For example in $[0,1)$, picking $x=1/2$ it is easy to see that the sign of $\Phi(1/2)$ is
$$\frac{((1/2)^2-1)((1/2)^2-3)((1/2)^2-5)}{((1/2)^2-2)((1/2)^2-4)((1/2)^2-6)} ={ (-)(-)(-)\over(-)(-)(-)} \ge 0$$ So on all of $[0,1)$, the expression $\Phi$ is positive. (Note, you only need to find the sign, there is no need to do the actual arithmetic.)
The complete "sign chart" is shown below:
And we see that $\Phi>0$ on $$[0, 1)\cup(\sqrt2,\sqrt3)\cup(2,\sqrt5)\cup(\sqrt6,\infty).$$ By symmetry, $\Phi>0$ on $$( -\infty,-\sqrt6)\cup(-\sqrt5,2)\cup (-\sqrt3,-\sqrt2)\cup (-1,0].$$
So, the domain of $\sqrt\Phi$ is the union of the two sets above, together with the zeroes of the numerator of $\Phi$ that aren't zeros of the denominator of $\Phi$: $x=\pm1$, $x=\pm \sqrt3$, and $x=\pm \sqrt5$.
Below is a plot of $y=\Phi$ and $y=\sqrt\Phi$. Note that the zeroes of the denominator of $\Phi$ are vertical asymptotes of the graph of $y=\Phi$ and the zeroes of the numerator of $\Phi$ are the zeroes of $\Phi$.
-
1. $\frac{f(x)}{g(x)} \ge 0$ is not so different from $f(x)\times g(x) \ge 0$ (except for zeros of $g$.)
2. With $(x^2-1) = (x-1)(x+1)$ etc, your problem reduces to the form of $(x-a)(x-b)(x-c)(x-d)...(x-z) \ge 0$
Edit: oops I only read the hand-written part! Anyways thanks to the monotonicity of $x^5-1$ etc, you can still use similar argument.
Edit 2: Plot it in google.
-
+1 for the link. I didn't know Google could plot. – user23211 Feb 23 '12 at 13:37
$(x^2-1)$ is negative iff $x\in(-1,1)$. Similarly, $(x^2-2)$ is negative for $x\in(-\sqrt{2},\sqrt{2})$, $(x^2-3)$ for $x\in(-\sqrt{3},\sqrt{3}), \dots,(x^2-6)$ for $x\in(-\sqrt{6},\sqrt{6})$.
Consider the open intervals $(-\infty,-\sqrt{6}), (-\sqrt{6},-\sqrt{5}),(-\sqrt{5},-2),\dots$ separately. Don't forget to look at how $f(x)$ behaves on the boundaries. E.g $x=\pm\sqrt{n}$ for $n=1,2,3,4,5,6$.
-
Ok, now I get the domain as $-\sqrt{5} \lt x \lt -2$, $-\sqrt{3} \lt x \lt -\sqrt{2}$, $-1 \lt x \lt 1$ ... but how do I find out without graph about what happens $x \lt -\sqrt{6}$ and $x \gt \sqrt{6}$ – Jiew Meng Feb 23 '12 at 14:23
When x>$\sqrt{6}$ all the factors in the numerator and denominator are positive, so the whole expression is positive. The situation is the same for $x<−\sqrt{6}$ – 01000100 Feb 23 '12 at 14:49 | 2015-07-07T22:46:16 | {
"domain": "stackexchange.com",
"url": "http://math.stackexchange.com/questions/112416/finding-domain-of-sqrt-fracx2-1x2-3x2-5x2-2x2-4x2-6",
"openwebmath_score": 0.9384967088699341,
"openwebmath_perplexity": 249.44829644022835,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.98657174604767,
"lm_q2_score": 0.8757869948899665,
"lm_q1q2_score": 0.864026704714436
} |
https://cozilikethinking.wordpress.com/2013/09/01/71/ | Let $f:X\to Y$ be a mapping. We will prove that $f^{-1}(Y-f(X-W))\subseteq W$, with equality when $f$ is injective. Note that $f$ does not have to be closed, open, or even continuous for this to be true. It can be any mapping.
Let $W\subseteq X$. The mapping of $W$ in $Y$ is $f(W)$. As for $f(X-W)$, it may overlap with $f(W)$, we the mapping be not be injective. Hence, $Y-f(X-W)\subseteq f(W)$.
>Taking $f^{-1}$ on both sides, we get $f^{-1}(Y-f(X-W))\subseteq W$.
How can we take the inverse on both sides and determine this fact? Is the reasoning valid? Yes. All the points in $X$ that map to $Y-f(X-W)$ also map to $W$. However, there may be some points in $f^{-1}(W)$ that do not map to $Y-f(X-W)$.
Are there other analogous points about mappings in general? In $Y$, select two sets $A$ and $B$ such that $A\subseteq B$. Then $f^{-1}(A)\subseteq f^{-1}(B)$ | 2017-09-23T20:12:11 | {
"domain": "wordpress.com",
"url": "https://cozilikethinking.wordpress.com/2013/09/01/71/",
"openwebmath_score": 0.9339148998260498,
"openwebmath_perplexity": 74.47047190814499,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. Yes\n2. Yes",
"lm_q1_score": 0.9884918502576514,
"lm_q2_score": 0.8740772384450967,
"lm_q1q2_score": 0.864018226698692
} |
https://math.codidact.com/questions/278629 | Q&A
# Why does the decimal expansion of $1/(10n - 1)$ have this neat pattern?
+10
−0
I was playing around with the reciprocals of some positive integers and found these interesting patterns:
$$\frac{1}{19} = 0.\overline{052631578947368421}$$
Now, this repeating decimal can also be obtained by "concatenating" the powers of $2$ successively to the left as follows:
\begin{align} 1& \\ 21& \\ 421& \\ 8421& \\ {\color{red}{1}}68421 \\ {\color{red}{3}}{\color{green}{3}}68421 \\ \vdots\quad & \end{align} Notice that here I think of the red $\color{red}{1}$ of $16$ and $\color{red}{3}$ of $32$ as being "carried over", so the units digit of $32$ and the tens digit of $16$ add to give me the green $\color{green}{3}$. The sequence gets increasingly complicated as more terms are concatenated in this manner, but it definitely looks like it's converging to $\dotsc 052631578947368421$, where the ellipsis indicates that the pattern repeats forever towards the left. This is a bit surprising because (informally) this would mean that if I perform this pattern infinitely far out to the right of the decimal point, then I get the decimal expansion of $1/19$.
How can I go about making this idea precise?
Some more data for this pattern: \begin{align} \vdots\quad & \\ {\color{red}{3}}{\color{green}{3}}68421 \\ {\color{red}{6}}{\color{green}{7}}368421 \\ {\color{red}{1}}{\color{green}{34}}7368421 \\ {\color{red}{2}}{\color{green}{69}}47368421 \\ {\color{red}{5}}{\color{green}{38}}947368421 \\ {\color{red}{10}}{\color{green}{77}}8947368421 \\ \vdots\quad & \end{align}
In this pattern, one can see that at each stage one new digit from the required sequence is correctly added, despite all the carrying-over.
I have also observed this to be the case for the decimal expansion of $1/29$: $$\frac{1}{29} = 0.\overline{0344827586206896551724137931}$$ In this case, we concatenate the powers of $3$ in a similar fashion.
Is there any significance to the fact that $19 = {\color{red}{2}}*10 - 1$ and $29 = {\color{red}{3}}*10 - 1$ to the use of powers of $2$ and $3$, respectively, in these computations?
I also checked for $1/39$, and though the repeating part of its decimal expansion is not as impressively long as for the other two cases, the pattern still holds up: $$\frac{1}{39} = 0.\overline{025641}$$ and concatenating the powers of $4$ indeed gives $\dotsc 025641$.
The last case I checked was $1/49$, and it also obeys this pattern: $$\frac{1}{49} = 0.\overline{020408163265306122448979591836734693877551}$$ and concatenating the powers of $5$ gives us this very repeating set of digits.
Of course, the pattern for $1/49$ makes it obvious that there is a concatenation that works in the forward direction: namely, the powers of $2$ concatenated in bunches of two digits. But this just means that $$\frac{1}{49} = \frac{2}{100} + \frac{2^2}{100^2} + \frac{2^3}{100^3} + \dotsb$$ which is true by the formula for the sum of an infinite geometric series. So, "forward concatenating" patterns can be explained in this manner, but I'm stumped regarding how to explain the "backward concatenating" ones.
If anyone can throw some light on this, it would be greatly appreciated!
Why does this post require moderator attention?
Why should this post be closed?
+5
−1
First of all, there is indeed a pattern.
To figure out why, there's an easier example than what you've found: $$0.\bar{1} = \frac{1}{9}.$$
How does that work? $1$ is the only power of $1$: $1^n = 1$.
Now, how do we prove this? if $x = 0.\bar{1}$, then $10x = 1.\bar{1}$ and so, $9x=1$.
Hidden in that proof lies the answer for the other cases - you have some repeating number and in order to show what fraction that repeating number is equal to, here $1/\left(10n-1\right)$, you multiply it by $10n$ and subtract the number (again, I'll just call it $x$).
To take your example of $1/19$, we have that the fraction is $x = 0.\overline{052631578947368421}$, so we multiply by $20$ to get $20x = 1.\overline{052631578947368421}$, subtract $x$ and $19x = 1$. Crucially, the number left on the RHS after subtracting is exactly $1$, as everything after the decimal point cancels. It must do this, because the fraction is some integer divided by some other integer. That is, if $x=n/m$, then $mx=n$.
As we're in a decimal system, multiplying by $10$ is shifting one digit to the left. So, in doing this multiplication by $10n$, you're shifting the digit to the left, then multiplying by $n$, which is exactly the procedure outlined in the question.
Now, each particular digit (after this multiplication procedure) must cancel with the digit to the left so at this point, they must be equal and we have the exact behaviour outlined in your question.
To explain this generally and in more detail (taking $x<1$ wlog.) I'll use a fraction $$x = \frac{m}{10n-1}.$$
When written in decimal format, this is $x = 0.x_1x_2\ldots x_k\ldots$, with $x_{k+r}=x_k$ for some $r$, where each $x_k$ is a single digit (i.e. an integer in the range $0-9$ as we're in a decimal basis).
Now, we know that $\left(10n-1\right)x = m$, or $10nx - x = m$. However, m is an integer, so all the digits after the decimal point (the 'fractional part', in other words) are $0$.
This means that the digits in the fractional part of $10nx - x$ must also be $0$.
So, we look at the digits $x_r$ and $x_1\ldots x_{r-1}$.
The fractional part of $10nx -$ the fractional part of $x$ equals $0$, or the fractional part of $10nx$ equals the fractional part of $x$. For this to be the case, all the digits must be equal.
So, we take the digit $x_r$. To calculate $x_{r-1}$, we use the properties of the fractional parts being equal and multiplication by 10 as shifting the digit to the left to give that the fractional part of $10n\left(0.x_1\ldots x_r\right) - 0.x_1\ldots x_r = 0.0\ldots x_r$ (where the $0$s after the point are repeated $r-1$ times).
This is exactly what's written in the question, just in a different way: $nx_r \mod 10 = x_{r-1}$. Or, the digit to the left of $x_{r-1}$ is $nx_r$, with change. Accounting for this change gives that $x_{r-j} = n^jx_r$, which is where the powers of $n$ come from, the change being what needs to be added to digits further to the left.
To explain what I mean by phrases such as "Accounting for this change", let's take the initial stream of digits again and write them out more explicitly, where the number in brackets to the right of each line represents the number of times the 0 is repeated after the decimal point:
Now, we apply this procedure of multiplying by $10n$. It is a requirement that, because the fractional part of $x$ must equal the fractional part of $10nx$, $10nx-m=x$, that is
\begin{align*}10nx - m &= 0.0\ldots x_k \qquad(k-1)\\ &+ 0.0\ldots x_{k-1} \qquad(k-2)\\ &+ 0.0\ldots x_{k-2} \qquad(k-3) + \ldots\end{align*}
Taking this line by line (where the term in brackets on the LHS has $j-1$ $0$s after the decimal point and the superscripts denote that this series arises from the $j^{th}$ term in the similar expansion of $x$) gives that
We can add this to the next term in the expansion of $x$ to get that (unfortunately at this point, notation gets very confusing but the first term on the left hand side has $j-1$ $0$s and the second, $j-2$) \begin{align*}10n\left(0.0\ldots x_j + 0.0\ldots x_{j-1}\right) &= 0.0\ldots x_{k-1}^{(j)} \qquad(k-2)\\ &+ 0.0\ldots x_{k-2}^{(j)} \qquad(k-3)\\ &+ 0.0\ldots x_{k-2}^{(j-1)} \qquad(k-3)\\ &+ 0.0\ldots x_{k-3}^{(j)} \qquad(k-4)\\ &+ 0.0\ldots x_{k-3}^{(j-1)} \qquad(k-4) + \ldots\end{align*}
Now, having done this, the $k^{th}$ term is exactly $$\sum_{j>k}0.0\ldots x_k^{(j)} \qquad(k-1),$$
which is the sum over $10n\times$ all the digits to the right of the $k^{th}$ digit, where you're only summing the resulting $k^{th}$ digit.
However, you can recursively apply this to get that the $k^{th}$ digit is the sum over $\left(10n\right)^p\times$ all the digits, $p$ positions to the right of the $k^{th}$ digit, where you're only summing the resulting $k^{th}$ digit.
This is precisely what's done in the question, although written in a different way and shows that the behaviour arises because the terms are required to be sums of powers of $10n$ of previous terms because this is a fraction with a denominator of $10n-1$.
Why does this post require moderator attention?
I'm confused how this answers the question of the pattern of digits. You only use the fact that x = 1/19 in your answer and don't explain what the significance of the powers of n is. (Or maybe my reading comprehension skills are poor...) Quintec about 1 month ago
Thank you for your answer! I hope you won't mind if I say that I somehow feel this answer doesn't go all the way towards explaining why this "backwards concatenation" process appears. Specifically, I do understand that if $x = 0.\overline{x_1 x_2 x_3 \dotso x_r}$, then $x$ is a rational number equal to some $n/m$ that can be found as you outlined. However, why does this method of specifically concatenating the powers of $n$ work when considering $1/(10n - 1)$? Abheri Ragam about 1 month ago
Secondly, though I say this "works", how do I adequately make sense of that? After all, the string that I get by my method of concatenation strictly speaking gives an "infinite number" such as $\dotsc 052631578947368421$. So perhaps, my claim is something like $$\frac{1}{10n-1} = \lim_{k \to \infty} \frac{(10n)^0 + (10n)^1 + (10n)^2 + \dotsb + (10n)^k}{10^k}\ ?$$ I'm not sure... But I do think there's a bit more to be said from where you leave off in your post :) Abheri Ragam about 1 month ago
I've updated my answer (although honestly, I feel that the first bit is about 100 times clearer). I've included the bit about the powers of $n$ and what you're referring to as 'backwards concatenation' is what I'm referring to as 'multiplying a digit by $n$ to get the digit to the left'. It works because the '-1' is the bit that causes the fractional part to cancel, hence be equal Mithrandir24601 about 1 month ago
But, $x_{r-j}$ is not equal to $n^j x_r$! (I presume you meant modulo $10$?) For instance, for the decimal expansion of $1/19$, $x_{r-5} = 3$ but $2^5 x_r = 32 \neq 3 \pmod{10}$. In fact, they are not equal precisely because of the carrying-over happening in the concatenation process. I'm sorry, but I'm still not satisfied that your answer fully explains this phenomenon. Abheri Ragam about 1 month ago
+2
−0
I was pretty curious about this, so I posted a question on Math.SE. Most of this answer will draw from the idea of J. W. Tanner's answer there.
There is actually a simple reason why this pattern holds.
Lets start by examining how the digits are generated: each digit is a power of two (with carrying). We can withhold decimal shifting for a second and simply look at a simplified expression with the same digits, only generated to the left of the decimal point:
\begin{aligned}\sum_{k=0}^{n-1} 2^k\cdot 10^k&=1+20+400+16000+320000+\cdots+2^{n-1}\cdot10^{n-1}\\ &=\cdots7368421\end{aligned}
You can see how the pattern generated is the same. Let's look at it another way, using the geometric series formula.
\begin{aligned}\sum_{k=0}^{n-1} 2^k\cdot10^k&=\frac{1(1-20^n)}{1-20}\\ &=\frac{20^n-1}{19}\end{aligned}
At this point, it's pretty clear why the digits generated become the repeated decimal of $1/19$. You can see the denominator of $19$ right there!
If you're not satisfied with that observation, we can further note the following:
\begin{aligned}\frac{20^n-1}{19}&=\frac{20^n}{19}-\frac{1}{19}\\ &=\frac{2^n}{19}\cdot10^n-\frac{1}{19}\end{aligned}
Let's specifically focus on $2^n/19$. Since we are interested in repeated groups of digits, let's let $n$ be a multiple of the totient of $19$, which is $18$. The reason we chose the totient is because of a useful property of modular arithmetic: $a^b\equiv 1\mod c$ if $a$ and $c$ are coprime and $b$ is a multiple of the totient of $c$ (Euler's theorem).
Clearly, $2$ is coprime to $19$, so letting $n$ be a multiple of $18$ gives us a remainder of 1 when dividing $2^n$ by $19$. Therefore, the digits after the decimal point of $2^n/19$ are the same as the digits of $1/19$.
Going back to the whole expression, we then multiply by $10^n$, bringing $n$ of those repeated digits over to the left of the decimal point. Everything to the right is canceled by the subtraction of $1/19$ (the digits must cancel, since the expression is an integer).
The result is the final number has its last $n$ digits be the first $n$ digits of $1/19$ when $n$ is a multiple of $18$, which is what we wanted to prove. (It's not difficult to generalize this for any $n$, but that's beyond this answer).
A similar result can be produced for any $10c-1$, where the digits will repeat every totient of $10c-1$ (though it may repeat before that) and the repeating portion will be the same as the digits of $1/(10c-1)$. Since it's basically the same process, I won't repeat it here.
Why does this post require moderator attention?
#### 1 comment
Thank you! I've been considering what you say in your answer, and I'm now satisfied with the explanation :) Abheri Ragam about 1 month ago
+0
−0
I think the simplest way to see how it works is as follows:
Given $x=\frac{1}{10n-1}$, it is easy to check that $\frac{x+1}{10}=nx$.
Now $\frac{x+1}{10}$ means shifting the digits to the right, with an $1$ added as the first decimal. For example, in the case of $x=1/19$, we have $$\frac{x+1}{10} = 0.1\overline{052631578947368421}.$$ But now we see that the additional digit matches the one at the end of the period, so we just can shift the period one to the left. At the same time on the left we use the equation derived above: $$2\cdot\frac{1}{19} = 0.\overline{105263157894736842}.$$ Thus multiplying by $2$ (or, in the general case, by $n$) is equivalent to shifting the digits one position to the right (and adding a $1$ at the first decimal, which gives the carry from the multiplication). Thus since the last digit of the original period was $1$, the digits to the left of it are successive powers of $2$ (with carry), or successive powers of $n$ in the general case.
So the only remaining question is why the period always ends in $1$. Well, since multiplying the number with $19$ (or, in the general case, with $10n-1 = 10(n-1)+9$) has to give $1=0.\overline{999999999999999999}$, the last digit of the period, when multiplied with the last digit of the denominator, that is $9$, must give $10k+9$ for some integer $k$. But that is clearly only possible if that last digit is $1$.
Why does this post require moderator attention? | 2020-11-30T20:41:38 | {
"domain": "codidact.com",
"url": "https://math.codidact.com/questions/278629",
"openwebmath_score": 0.9742663502693176,
"openwebmath_perplexity": 243.84589595101738,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9904406014994152,
"lm_q2_score": 0.8723473746782093,
"lm_q1q2_score": 0.8640082584927213
} |
https://math.stackexchange.com/questions/1236347/if-a-and-b-are-positive-integers-and-4ab-1-mid-4a2-1-then-a-b/1236370 | # If $a$ and $b$ are positive integers and $4ab-1 \mid 4a^2-1$ then $a=b$.
Prove that if $a$ and $b$ are positive integers and $$(4ab-1) \mid (4a^2-1)$$ then $a=b$.
I am stuck with question, no idea. Is there any way to prove this using Polynomial Division Algorithm? Would appreciate any help.
• This actually holds even with the weaker assumption that $4ab - 1 \mid (4a^2 - 1)^2$. – George V. Williams Apr 15 '15 at 19:48
• I added a generalization to my answer which makes it crystal clear how this is nothing but the uniqueness of inverses. – Bill Dubuque Apr 15 '15 at 22:02
Note that $4ab\equiv 1\pmod {4ab-1}$ and if $4ab-1\mid 4a^2-1$ then $4a^2\equiv 1\pmod{4ab-1}$. So $$b\equiv (4a^2)b=a(4ab) \equiv a\pmod{4ab-1}.$$
Is that possible if $a\neq b$?
Without using modular arithmetic, you can write this as:
$$a-b = b(4a^2-1)-a(4ab-1)$$
So $4ab-1\mid a-b$.
• The proof is just a special case of the uniqueness of inverses - see my answer. – Bill Dubuque Apr 15 '15 at 20:01
• Well, yes, but you still arrive at $4ab-1\mid a-b$. @BillDubuque – Thomas Andrews Apr 15 '15 at 20:05
• The point is that viewing it this way makes everything obvious, even the requisite inequality (omitted in your answer). I expanded my remark to emphasize this - giving the natural generalization of the OP's theorem. Hopefully that makes my point clearer. – Bill Dubuque Apr 15 '15 at 21:57
Clearly, $a \geq b$, since we need $4a^2-1 \geq 4ab-1$. We have $$\dfrac{4a^2-1}{4ab-1} = k \in \mathbb{Z}$$ Hence, $$k = \dfrac{4a^2-1}{4ab-1} = \dfrac{4a^2-4ab+4ab-1}{4ab-1} = 1 + \dfrac{4b(a-b)}{4ab-1}$$ Now note that $\gcd(4ab-1,4b)=1$, since $(4b)a - (4ab-1) = 1$. Hence, $4ab-1$ divides $a-b$. However $0 \leq a-b < 4ab-1$. Hence, $a-b=0 \implies a=b$.
Note $\,\ {\rm mod}\,\ 4ab\!-\!1\!:\,\ \overbrace{(4a)\color{#c00}a\equiv 1\equiv(4a)\color{#c00}b}^{\ \ \ \large \color{#c00}a\, \equiv\, (4a)^{-1}\equiv\,\color{#c00} b}\,\Rightarrow\, \color{#c00}{a\equiv b}\$ by uniqueness of inverses (of $\,4a\,$ here)
Remark $\$ For completeness, here is the standard proof of uniqueness of inverses:
$$\ ca\equiv 1\equiv cb \,\Rightarrow\, a\equiv a(cb)\equiv (ac)b\equiv b\quad\ \$$
The OP Theorem becomes obvious when expressed in this general form, amounting simply to the uniqueness of inverses mod $\,n\,$ within the standard rep system $\,\{0,1,\ldots,n\!-\!1\},\,$ namely
Theorem $\$ If $\, \color{#0a0}{a< bc}\,$ and $\, bc\!-\!1\mid ac\!-\!1\$ then $\ a = b,\$ for integers $\,a,b,c > 0$
Proof $\ \ {\rm mod}\,\ n\!=\!bc\!-\!1\!:\,\ bc\equiv 1\equiv ac\,\Rightarrow\, a\equiv c^{-1}\!\equiv b.\$ $\,bc\!-\!1\mid ac\!-\!1\,\Rightarrow\, b\le a \le \color{#0a0}{bc\!-\!2}\,$ (by $\,b\not\equiv 0).\,$ So $\,a\equiv b\pmod{n}\,$ and $\,a,b\in \{0,1,\ldots,\color{#0a0}{n\!-\!1}\}\Rightarrow\, a=b\,$ (else $\,n\,$ divides the smaller natural $\,a\!-\!b> 0,\,$ contradiction). $\ \$ QED
The OP is the special case $\ c = 4a,\$ where $\ a < 4ab = bc,\,$ so the Theorem applies.
Note how translating the theorem into the language of congruences has simplified it so much that we immediately recognize it as a special case of a well-known result about uniqueness of inverses. This is yet another example of a ubiquitous principle that I frequently emphasize here, namely uniqueness theorems provide powerful tools for proving equalities.
Note that any integer $m \ge 2$ will do, instead of 4.
For example, take Thomas Andrew's solution, and put $m$ for $4$ everywhere:
Note that $mab\equiv 1\pmod {mab-1}$ and if $mab-1\mid ma^2-1$ then $ma^2\equiv 1\pmod{mab-1}$. So $$b\equiv (ma^2)b=a(mab) \equiv a\pmod{mab-1}.$$
Is that possible if $a\neq b$?
Without using modular arithmetic, you can write this as:
$$a-b = b(ma^2-1)-a(mab-1)$$
So $mab-1\mid a-b$.
My note:
To show that $mab-1 > a-b$ for $m \ge 2$, $ab-a+b-1 =(a+1)(b-1) \ge 0$.
Note that if $m=b=1$, then $mab-1 = a-1$.
• Yes: $\ (ma)a\equiv 1\equiv (ma)b\,\Rightarrow\, a\equiv (ma)^{-1}\equiv b\,$ by uniqueness of inverses, see my answer. To get the general result replace $\,ma\,$ by $\,c\,$ above. – Bill Dubuque Apr 15 '15 at 20:23
• Update: even the inequality has a natural interpretation when viewed from this standpoint: it is simply what's needed for the inverses to lie in the standard rep range. So the theorem is precisely equivalent to the uniqueness of inverses in the standard rep range, except the congruence language has been removed, being replaced by equivalent divisibility language, which obscures the essence of the matter: inverse unqueness (and it is further obfuscated by choice of a specific modulus). See the edit to my remark.for details. – Bill Dubuque Apr 16 '15 at 0:01 | 2019-08-26T06:49:38 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/1236347/if-a-and-b-are-positive-integers-and-4ab-1-mid-4a2-1-then-a-b/1236370",
"openwebmath_score": 0.9476520419120789,
"openwebmath_perplexity": 303.29098091829053,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9904405999474861,
"lm_q2_score": 0.8723473713594991,
"lm_q1q2_score": 0.8640082538519148
} |
http://creativenet.ca/24dcs5jl/python-distance-between-two-coordinates-92a9fd | The bearing outputs negative but should be between 0 – 360 degrees. Distance Calculator is use to calculate the distance between coordinates and distance between cities. An $$m_B$$ by $$n$$ array of $$m_B$$ original observations in an $$n$$-dimensional space. To calculate the distance between two points we use the inv function, which calculates an inverse transformation and returns forward and back azimuths and distance. As per wiki definition. geopy makes it easy for Python developers to locate the coordinates of addresses, cities, countries, and landmarks across the globe using third-party geocoders and other data sources. , where the latitude is $$\varphi$$, the longitude is denoted as $$\lambda$$ and $$R$$ corresponds to Earths mean radius in kilometers (6371). pip install geopy Geodesic Distance: It is the length of the shortest path between 2 points on any surface. In Python split() function is used to take multiple inputs in the same line. For example there is the Great-circle distance, which is the shortest distance between two points on the surface of a sphere. MATH. It is a great package to work with map projections, but in there you have also the Geod class which offers various geodesic computations. Examples: Input : x1, y1 = (3, 4) x2, y2 = (7, 7) Output : 5 Input : x1, y1 = (3, 4) x2, y2 = (4, 3) Output : 1.41421 Inputs are converted to float type. Another similar way to measure distances is by using the Haversine formula, which takes the equation, Write a Python program to compute the distance between the points (x1, y1) and (x2, y2). This article focused on introduction to the tools a data scientist can use to learn geocoding in Python. Calculate Distance Between Two Points ( Co-ordinates), Python Program to Check Palindrome Number, Python Program to Find Factorial of a Given Number, Python Program to Calculate HCF (GCD) & LCM, Python Program to Calculate HCF (GCD) by Euclidean Algorithm, Python Program to Check Armstrong (Narcissistic) Number, Python Program to Check Whether a Number is Strong or Not, Python Program to Generate Fibonacci Series, Python Program to Check Triangular Number, Python Program to Check Automorphic (Cyclic) Number, Python Program to Generate Prime Numbers in Interval, Python Program to Generate Armstrong (Narcissistic) Number, Python Program to Generate Strong Numbers in an Interval, Python Program to Generate Perfect Numbers in an Interval, Generate Triangular Numbers in an Interval, Sum of Digit of Number Until It Reduces To Single Digit, Python Program to Find Factorial Using Recursive Function, Calculate HCF (GCD) Using Recursive Function, Python One Line Code To Find Factorial (3 Methods), Number to Words Conversion in Python (No Library Used), Remove Duplicate Items From a Python List. w3resource. In this article, we will see how to calculate the distance between 2 points on the earth in two ways. You can also use geopy to measure distances. An $$m_A$$ by $$n$$ array of $$m_A$$ original observations in an $$n$$-dimensional space. The two points must have the same dimension. TL;DR - Vincenty's inverse formula provides an accurate method for calcualting the distance between two latitude/longitude pairs. Python provides several packages for data manipulation that are easy to use and are supported by a large community of contributors. We can take this function now and apply distances to different cities. Python | Get a google map image of specified location using Google Static Maps API. Python Math: Distance between two points using latitude and longitude Last update on February 26 2020 08:09:18 (UTC/GMT +8 hours) Python Math: Exercise-27 with Solution. It is a method of changing an entity from one data type to another. The angular distance between two points in 3 D. import math # function to find distance between two in! In km classes for the OpenStreetMap Nominatim, google geocoding API ( V3 ), and calculated distance an. Package, which is the length of the shortest path between 2 points on a sphere some cities! Two latitude/longitude pairs points is given by the MYSQL st_distance_sphere formula the on! Suppose you have two lists of locations and you want to calculate between... Google also calculates the same distance 28.15 km as calculated by the MYSQL st_distance_sphere formula with,... Inverse formula ) Posted at — December 14, 2016 API to this. And distance between two points in Euclidean space becomes a metric space in consecutive rows various to. Called geopy GPS coordinates using Vincenty like the attempt below... # Python program calculates between... Formula to calculate the distance between coordinates and distance between two points or using. Numpy library the most used distance metric and it is the most used distance metric and it simply. And apply distances to different cities implemented for us in a Python module geopy! Angles, and some metrics like great circle should be between 0 – 360 degrees to calculate the from! Ocean if this is what you intend ordinary ” straight-line distance between two latitude/longitude pairs sphere given their and. The MYSQL st_distance_sphere formula two GPS points are a few months back was. Implementation of Haversine formula, inputs are taken as GPS coordinates using Vincenty the! Distance between points two co-ordinates ( x1, y1 ) and ( x2, y2 of... ( 6371km for … distance between points is given by user using distance formula 3 D. import math function! To ‘ sphere ’ python distance between two coordinates kilometers, miles, nautical miles or feet.. distance. Science / data Visualization / GIS / Geometric Modelling earth in two ways GPS coordinates using Vincenty like the below. A Matrix of ALL combinations between coordinates and distance between two coordinates ( i.e distance and... Different cities distance from point to point article focused on introduction to tools! Euclidean metric is the “ ordinary ” straight-line distance between two series opposed to tools. For calculating distance between two sets of GPS coordinates using Vincenty like the attempt below 28.15 km calculated. Driving distance between two points in Euclidean space V3 ), and that Haversine! Example to sail the ocean if this is what you intend ) of a sphere 3 import. Science / data Visualization / GIS / Geometric Modelling this formula now apply. The Haversine formula, inputs are taken as GPS coordinates, and many other geocoding services when... On any surface google Static Maps API the radius of the sphere set... A map calculate distance on the earth in two ways \endgroup $– Yasmin 20... Your code editor, featuring Line-of-Code Completions and cloudless processing p1 ( )... Code editor, featuring Line-of-Code Completions and cloudless processing path between 2 points any. Using the same: example 1: filter_none is to find the bearing doesn ’ t quite work yet! Calculates the same distance 28.15 km as calculated by the formula: we can use to distance... Travel distance and time is taken to reach a destination Maps API ; Signal processing data! Line ( shp ) and p2 ( k ) is now stored in the Haversine returns. To reach a destination distance ( Euclidean ) between these two points any... To use and are supported by a large community of contributors approximate sphere... Do n't know your location, use the numpy array as dist [ k ] D. import math function!, Practice and Solution: write a Python module called geopy is formula! Library that makes geographical calculations easier for the OpenStreetMap Nominatim, google geocoding (... On introduction to the theoretical distance returned by GeoDjango the distances from London to some other cities x2... That provides tutorials and examples on popular programming languages thus, it is free... ) edit retag flag offensive close merge delete the python distance between two coordinates ’ s Inverse formula provides an method... And cloudless processing the theoretical distance returned by GeoDjango so you should use a formula to this! Python | get a google map image of specified location using google Static Maps API and transform (! Two sets of GPS coordinates using Vincenty like the attempt below TRIALS ; see ALL ….! Between # two points, as opposed to the tools a data scientist can use various methods compute. Circle should be between 0 – 360 degrees can generate a Matrix of ALL combinations between and! - GCS '', the Euclidean distance is the great-circle distance, we will see how to calculate distance... Are taken as GPS coordinates, and many other geocoding services miles or feet.. Driving distance between is., y2 ) of a sphere ) distance between points is given the. Tl ; DR - Vincenty 's Inverse formula provides an accurate method for the... \Endgroup$ – Yasmin Apr 20 at 1:41 Kite is a service that provides tutorials and examples on popular languages. Flag offensive close merge delete ) Type Casting this distance, which the..., the distance between them project of visualizing geo-location data ( i.e, v [, w compute! Post we will use the where am I right now to find the distance between two coordinates you... Expert TESTIMONY ; RANDOMIZATION ; CLINICAL TRIALS ; see ALL … PRIVACY metric and it is the ordinary (. Coordinates ( i.e distance to meter you need to know the radius of the shortest distance in.! London to some other cities provides tutorials and examples on popular programming python distance between two coordinates. An approximate value coordinates using Vincenty like the attempt below doesn ’ t quite work yet! Exercises, Practice and Solution: write a Python library that makes geographical calculations easier for same! Pretty similary to what does descriptormatcher.match ( ).split ( ) Type Casting set python distance between two coordinates! Like great circle should be between 0 python distance between two coordinates 360 degrees which I have to take a look at distances! Meter you need to know the radius of the shortest path between points... But should be used the where am I right now to find the bearing doesn ’ t work... With the Kite plugin for your code editor, featuring Line-of-Code Completions and cloudless processing straight-line ) distance two... If you do n't know your location, use the where am I right now to find out sphere. Ordinary ” straight-line distance between two GPS points with Python ( Vincenty ’ s formulae is described! Have to take the radians of the shortest path between 2 points on any.. All combinations between coordinates and distance between two 1-D arrays and latitude are angles, and that is formula. Specified location using google Static Maps API like the attempt below two.... Points are decimal the Kite plugin for your code editor, featuring Line-of-Code Completions and cloudless.! Co-Ordinates ( x1, y1 ) and transform it ( ETRS89 ) angular distance between two 1-D arrays been. Tl ; DR - Vincenty 's Inverse formula ) Posted at — December 14, 2016 the. Shortest distance between them some metrics like great circle should be used when the points are decimal learn in! The Kite plugin for your code editor, featuring Line-of-Code Completions and cloudless processing featuring Line-of-Code and!, which is the longitude calcualting the distance between two python distance between two coordinates using latitude and longitude it! To use and are supported by a large python distance between two coordinates of contributors Type to another google distance Matrix API to this., loc2 ) Output: 5.229712941541709 community of contributors geocoding in Python ), and land thus much! When the points on the earth in two ways MYSQL and Python distance 28.15 km calculated. A formula to calculate the distance between two latitude/longitude pairs: it is the length of the distance... In 3D space ) compute the squared Euclidean distance or Euclidean metric is the most used distance metric it! Apr 20 at 1:41 Kite is a Python program to find out calculates distance... On each list so you should use a formula to calculate the distance between 2 points on each list out... Between points few ways to handle this calculation problem need to know to. Edit retag flag offensive close merge delete set ellipse to ‘ sphere ’ metric is the length of the distance! Minkowski distance between two points calculations easier for the users close merge delete latitude. Is to find distance is what you intend of specified location using Static! On popular programming languages 's pretty similary to what does descriptormatcher.match ( ) Type Casting ( 28.394231,77.050308 ) hs.haversine loc1. After the transformation I calculate the distance between them similary to what does descriptormatcher.match ( ).split ( with... In consecutive rows, but let ’ s Inverse formula ) Posted at — December 14,.! Important to note is python distance between two coordinates we have to take multiple inputs in the Haversine formula, are! By user using distance formula becomes a metric space wminkowski ( u, v, v ) the! By the MYSQL st_distance_sphere formula code editor, featuring python distance between two coordinates Completions and cloudless processing Haversine. Edit retag flag offensive close merge delete I was working on a freelance of! As True distance or Euclidean metric is the length of the longitude and are. 3 D. import math # function to find the distance ( Euclidean ) between these two using... Is Haversine formula, inputs are taken as GPS coordinates, and land thus traveling much further install geopy distance. Project of visualizing geo-location data ( i.e theoretical distance returned by GeoDjango ( shp ) and x2...
Getaway Movie 2020 Release Date, Sound Effects App For Android, Ramshorn Snail Anatomy, Cara Menghitung Expected Return Dengan Excel, Red Degeneration Of Fibroid Histology, Afton Family Past Vs Present Singing Battle Gacha Life, Chief Sales Officer Salary, Gaucho Rock In 12v Jeep, Fallout 76 Gold Bullion Items List, | 2021-05-08T22:47:05 | {
"domain": "creativenet.ca",
"url": "http://creativenet.ca/24dcs5jl/python-distance-between-two-coordinates-92a9fd",
"openwebmath_score": 0.28711771965026855,
"openwebmath_perplexity": 1859.2880088230952,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES\n\n",
"lm_q1_score": 0.9755769113660689,
"lm_q2_score": 0.8856314813647587,
"lm_q1q2_score": 0.8640016251983875
} |
https://math.stackexchange.com/questions/944568/modular-arithmetic | # Modular arithmetic
Hello,
What is the remainder when the following sum is divided by 4? $1^5 + 2^5 + 3^5 +...+ 99^5 + 100^5$
I feel like it has to do with modular arithmetic... I am trying to decompose every number but it seems to long and unnecessary. Any ideas?
P.S. thank you for your ideas. I got it. Please don't post solutions
• It's $0$, I believe. – Akiva Weinberger Sep 24 '14 at 17:04
• There's no need to compute all the numbers. Modular Arithmetic is the way, but you have also to get some regularity. Usually, the first thing to do is to try smaller numbers, to see if there are patterns – Exodd Sep 24 '14 at 17:07
• Hint: Any even number squared is divisible by 4 and any odd number power will give remainder 1. So count how many odds there are. – Ali Caglayan Sep 24 '14 at 17:08
HINT : Note that in mod $4$, $$1^5\equiv1,\ \ 2^5\equiv 0,\ \ 3^5\equiv (-1)^5=-1\equiv 3,\ \ 4^5\equiv 0$$ and that $$1+0+3+0\equiv 0,\ \ 100=4\times 25.$$
hint :take {1,2,3,4},{5,6,7,8} .....{97,98,99,100} as a set now each corresponding term in each set has same remainder when divided by 4 , so you effectively need to calculate only the remainder of $1^5+2^5+3^5+4^5$ w.r.t 4 and then multiply it by 25 and again find that numbers remainder w.r.t 4
$$1^5 \equiv 1 \pmod{4}$$ $$4\mid 2^5 \Rightarrow 2^5 \equiv 0 \pmod{4}$$ $$3^5 \equiv (-1)^5 \equiv -1 \pmod{4}$$ $$4^5 \equiv 0^5 \equiv 0 \pmod{4}$$
This means that every even number, when raised to the fifth power, is $0 \pmod{4}$. Thus the sum you asked about is equal to the number of $1 \pmod{4}$ numbers in $\{1,2,\dots 100\}$ minus the number of $3 \pmod{4}$ numbers in $\{1,2,\dots 100\}$.
Every fourth number from $1$ to $97$, inclusive, is $1 \pmod{4}$. There are $25$ of these.
Every fourth number from $3$ to $99$, inclusive, is $3 \pmod{4}$. There are $25$ of these as well, so
$$\displaystyle\sum\limits_{n=1}^{100} n^5 \equiv 0 \pmod{4}$$ | 2019-09-18T21:49:49 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/944568/modular-arithmetic",
"openwebmath_score": 0.7862219214439392,
"openwebmath_perplexity": 262.99803592972114,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9755769071055402,
"lm_q2_score": 0.8856314813647587,
"lm_q1q2_score": 0.8640016214251292
} |
https://math.stackexchange.com/questions/2238134/matrix-size-for-error-correcting-linear-code | # Matrix size for error-correcting linear code
This is Exercise 21 of the textbook "Abstract Algebra: Theory and Applications" by Thomas W. Judson, 2016; Page 111. Chapter 8 "Algebraic Coding Theory" mainly deals with binary linear code with Hamming code as an example.
Exercise 8.21: If we are to use an error-correcting linear code $C$ to transmit the 128 ASCII characters, what size matrix must be used?
The screenshot is as follows:
My Attempt: I consider the parity check matrix $H_{(n-k) \times n} = [P_{(n-k)\times k}\mid I_{n-k}]$. Let $m = n - k$, the number of parity bits. First of all, the data bit is $k = \log_2 128 = 7$.
Let the error-correcting capability be $t = 1$. The minimum Hamming distance of the linear code $C$ is at least $3$. Therefore, the zero column and $e_i$'s columns are not in $P_{(n-k) \times k}$ (because $H$ contains no idential columns). Thus, we have $2^{m} - m - 1 \ge k$, which gives $m \ge 4$. That is, the matrix size is $4 \times 11$ (Note: not $4 \times 7$ as pointed out in the comment by @Jyrki Lahtonen).
Is the argument above correct?
Also, how to solve this problem for any parameter $t$, the error-correcting capability of $C$?
• The dimensions of $H$ are $(n-k)\times n$. So the number of columns should be $n=k+m$. Not $k$ as your final answer suggests. In general ($t>1$) it will be more difficult to judge the number of redundant bits needed to correct $t$ errors. It may turn out that the answer is known for $7$-dimensional codes, but I can only give bounds (e.g. what you would get using a BCH-code). Apr 17 '17 at 9:45
• @JyrkiLahtonen Thanks. I will modify my answer. I think the problem for finding the matrix size for the general case of $t > 1$ is related to the lemma that "If $H$ is the parity check matrix of $C$, then the minimum Hamming distance of $C$ equals the minimum number of columns of $H$ that are linearly dependent." Is it right? By the way, a bound on the matrix size is also appreciated. Apr 17 '17 at 9:52
• " what matrix size must be used?" Is that really the full text of the exercise? What are the error detection-correction capabilities desired? Is the code binary? There seems to be some missing data. BTW, the link does not work for me (what about a screenshot?) Apr 17 '17 at 22:04
• @leonbloy Yes, it is "what size matrix must be used" (I have reordered two words by mistake). The code is binary. This is implied by the text in the chapter. Thanks for pointing this out. I will update this post right now. Apr 18 '17 at 3:03
I assume that by "an error-correcting linear code", they meant a code capable of correcting one (bit) error (per coded symbol).
In that case your reasoning is on the right track (and it's the reasoning used to construct a Hamming code). We know $k=7$, the matrix $H$ will have up to $2^m-1=n$ columns. The smallest Hamming code in our case is then $(15,11)$ ($11$ bits of information plus $4$ of redundacy).
Because this give a code with higher $k$ than needed, we can trim the $11-7=4$ unused data bits, and we are left with a $(11,7)$ code ($7$ bits of information plus $4$ of redundacy).
(Equivalently, the Hamming construction gives the -sufficient- condition of $n\le 2^{n-k}-1$; it's easy to check that, for $k=7$, $n=11$ is the minimum number that fulfill the condition)
If we only need one error detection, a single parity bit is enough, so we have a $(8,7)$ code.
• Thanks. By the way, is this problem much harder for general $t$, the error-correcting capacity? Apr 18 '17 at 3:35
• Yes, see BCH codes for example. Apr 18 '17 at 4:57
Answer my question: I realized that my argument in the post relies on the standard parity-check matrix $H$. I show another argument here and ask for reviews.
First, the information bit $k = \log_2 128 = 7$.
Let $r = (n-k)$.
The parity-check matrix $H_{(n-k) \times n}$ has $r$ rows. Therefore, $H$ has at most $2^{r} - 1$ columns (the zero column is excluded).
To achieve the an-error-correcting capability, the code should be able to correct all the possible $n = 7 + r$ one-bit errors, each corresponding to one column of $H$. Therefore, we have $$2^r - 1 \ge 7 + r.$$ That is, $r \ge 4$ and the size of $H$ is at least $4 \times 11$. | 2022-01-23T10:59:19 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2238134/matrix-size-for-error-correcting-linear-code",
"openwebmath_score": 0.8746059536933899,
"openwebmath_perplexity": 202.5856900283433,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.975576912786245,
"lm_q2_score": 0.8856314632529871,
"lm_q1q2_score": 0.8640016087867141
} |
https://ipso-facto.joseaniceto.com/pi-monte-carlo.html | # The Monte Carlo method
Monte Carlo methods are a group of computational algorithms that rely on repeated random sampling to obtain numerical results. The underlying concept is to use randomness to solve problems that might be deterministic in principle. They are often used in physical and mathematical problems and are most useful when it is difficult or impossible to use other approaches. Monte Carlo methods are mainly used in optimization problems, numerical integration, and to generate draws from a probability distribution.1
# Estimating the value of $$\pi$$
Consider the circle in the diagram. If we generate a sufficiently large number of $$(x, y)$$ points in the domain $$-1 \leqslant x \leqslant 1$$ and $$-1 \leqslant y \leqslant 1$$, then the fraction of points that fall inside the circle will be equal to the ratio between the area of the circle and area of the square.
$$\frac{\textrm{number of points that fall inside the circle}}{\textrm{total number of points}} = \frac{\textrm{circle area}}{\textrm{square area}} =$$
$$= \frac{\pi R^2}{(2R)^2} = \frac{\pi}{4}$$
A point falls inside the circle if it complies to the following condition:
$$x^2 + y^2 \leqslant R^2$$
By counting the number of random points that fall within the circle we can estimate $$\pi$$ as:
$$\pi = 4 \times \frac{\textrm{number of points that fall inside the circle}}{\textrm{total number of points}}$$
## The algorithm:
We can thus devise an algorithm that will:
1. Initialize a counter of the points that fall inside the circle (circle_points).
2. Generate a random point $$(x, y)$$.
3. Check if the point falls within the circle by evaluating $$x^2 + y^2 \leqslant R^2$$.
4. If the abose condition is true then increment the counter circle_points.
5. Calculate $$\pi$$ .
6. Repeat from step 2 for the desired number of runs.
In principle, the higher the number of runs the better the estimation will be (closer to the real value of $$\pi$$).
## The code
Putting the above algorithm to pratice we get the following code2:
import random
def run_simulation(runs=1000):
simulation = []
circle_points = 0
for i in range(runs):
# Create a (x, y) point at random
x, y = random.uniform(-1, 1), random.uniform(-1, 1)
# Check if the point falls within the circle
if x**2 + y**2 <= 1:
circle_points += 1
# Calculate current pi value
pi_estimate = 4 * circle_points/(i+1)
# Save simulation step
simulation.append([x, y, pi_estimate])
# Print final pi value
print('Result: Pi =', simulation[-1][2])
return simulation
sim = run_simulation(runs=10000)
Here is the result of the simulation from 1000 runs to 100000 runs. At 100000 runs the estimation ($$\pi = 3.142720$$) is already very close the actual value ($$\pi = 3.141593$$).
And if you are curious, here is how the estimation approaches the real value from the first run to 10000th run.
A final remark: We do not need to perform the simulation above using a full circle. By selecting a quarter of a circle and the corresponding square we could achieve the same result with a fourth of the computational effort. | 2022-11-30T19:42:37 | {
"domain": "joseaniceto.com",
"url": "https://ipso-facto.joseaniceto.com/pi-monte-carlo.html",
"openwebmath_score": 0.7709189057350159,
"openwebmath_perplexity": 502.95441580252526,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9924227580598142,
"lm_q2_score": 0.8705972600147106,
"lm_q1q2_score": 0.8640005339431163
} |
https://tex.stackexchange.com/questions/264425/reducing-space-between-for-some-of-the-equations | # Reducing space between for some of the equations
I need to display a few equations as below
The code I have written is :-
\documentclass{report}
\usepackage{amsmath}
\begin{document}
$$\label{Equ. 3.9} x_{i+1}=\cos(a_i) \cdot [x_i-y_i \cdot 2^{-i} \cdot d_i] \tag{3.9}$$
$$\label{Equ. 3.10} y_{i+1}=\cos(a_i) \cdot [y_i+x_i \cdot 2^{-i} \cdot d_i] \tag{3.10}$$
$$\label{Equ. 3.11} \cos(\alpha)=\dfrac{1}{\sqrt [2]{1+{\tan(\alpha)}^2}} \tag{3.11}$$
$$\label{Equ. 3.12} K_i=\cos(arctan(2^{-i}))= \dfrac{1}{\sqrt [2]{1+\tan(arctan(2^{- i}))}}=\dfrac{1}{\sqrt[2]{1+2^{-2i}}} \tag{3.12}$$
The product of $K_i$ represents the so-called K factor (Equ. \ref{equ: 3.13})
$$\label{equ: 3.13} K=\prod K_i=\prod_{i=0}^{n-1} \dfrac{1}{\sqrt{1+2^{-2i}}} \tag{3.13}$$
\end{document}
The result I am getting with the above code is as below
I need to reduce the space between the equations so the result looks like the 1st screenshot. Please guide how I can achieve this?
The equation that caused the numbering problem is:
$$\label{equ:matrix} V= \begin{bmatrix} x'\\ y'\\ \end{bmatrix} \begin{bmatrix} x \cdot \cos(a) - y \cdot \sin(a)\\ y \cdot \cos(a) + x \cdot \sin(a)\\ \end{bmatrix} \tag{3.6}$$
When i remove the tag command from this it throws an error
• The equations displayed are also aligned by =, so the align environment would be best. You can still label and tag each equation individually, – John Kormylo Sep 2 '15 at 19:05
• Please don't post a substantially new query as an addendum to an existing posting. For one, relatively few people may realize that you've modified an existing query to ask a follow-up question. Instead, please post a new query. – Mico Sep 4 '15 at 16:20
• @Mico Sure... Sorry about that.. I am on it – Shray Sharan Sep 4 '15 at 16:22
Use the gather environment and the \intertext command. Btw, you don't have to put the equation numbers by yourself. Also, I propose to load the cleveref package: in cross references, you won't even have to type ‘equ.’, since cleveref knows (most) counters, and adds the counter name before its value.
\documentclass{report}
\usepackage{mathtools}
\begin{document}
\setcounter{chapter}{3}\setcounter{equation}{8}
\begin{gather}
\label{Equ. 3.9}
x_{i+1}=\cos(a_i) \cdot [x_i-y_i \cdot 2^{-i} \cdot d_i] \\
\label{Equ. 3.10}
y_{i+1}=\cos(a_i) \cdot [y_i+x_i \cdot 2^{-i} \cdot d_i] \\
\label{Equ. 3.11}
\cos(\alpha)=\dfrac{1}{\sqrt [2]{1+{\tan(\alpha)}^2}}\\
\label{Equ. 3.12}
K_i=\cos(\arctan(2^{-i}))= \dfrac{1}{\sqrt [2]{1+\tan(\arctan(2^{- i}))}}=\dfrac{1}{\sqrt[2]{1+2^{-2i}}}\\
\intertext{The product of $K_i$ represents the so-called K factor (equ. \eqref{equ: 3.13})}
\label{equ: 3.13}
K=\prod K_i=\prod_{i=0}^{n-1} \dfrac{1}{\sqrt{1+2^{-2i}}}
\end{gather}
\end{document}
• I used the tag command in one of the equations in between and from their it has stopped taking care of the numbering... Can i post the code for that equation in this post for you check it? – Shray Sharan Sep 4 '15 at 15:27
• Please do, since it is linked to this question. – Bernard Sep 4 '15 at 15:29
• I added the code for that equation.. – Shray Sharan Sep 4 '15 at 15:32
• I've inserted your equation code amidst the other equations and the result is normal, except number 3.6 between 3.12 and 3.13 looks weird. Could you post a complete code showing the problem (perhaps you should initiate a new thread)? – Bernard Sep 4 '15 at 16:07
Especially since you're already loading the amsmath package, you should look into using that package's gather environment to typeset a collection of displayed, numbered equations. Use \intertext{...} to intersperse text between some of the equations.
Some side remarks: For the sake of good (math) typography, consider getting rid of all \cdot directives and getting rid of the 2 radicands for the square root ops.
\documentclass{report}
\usepackage{amsmath}
\allowdisplaybreaks
\begin{document}
\begin{gather}
x_{i+1}=\cos(a_i) \cdot [x_i-y_i \cdot 2^{-i} \cdot d_i]
\tag{3.9} \label{Equ. 3.9}\\
y_{i+1}=\cos(a_i) \cdot [y_i+x_i \cdot 2^{-i} \cdot d_i]
\tag{3.10} \label{Equ. 3.10}\\
\cos(\alpha)=\dfrac{1}{\sqrt [2]{1+{\tan(\alpha)}^2}}
\tag{3.11} \label{Equ. 3.11} \\
K_i=\cos(\arctan(2^{-i}))= \dfrac{1}{\sqrt [2]{1+\tan(\arctan(2^{- i}))}}=\dfrac{1}{\sqrt[2]{1+2^{-2i}}}
\tag{3.12} \label{Equ. 3.12}\\
\intertext{The product of $K_i$ represents the so-called $K$ factor (Equ. \ref{equ: 3.13})}
K=\prod K_i=\prod_{i=0}^{n-1} \dfrac{1}{\sqrt{1+2^{-2i}}}
\tag{3.13} \label{equ: 3.13}
\end{gather}
\end{document} | 2021-05-16T08:12:32 | {
"domain": "stackexchange.com",
"url": "https://tex.stackexchange.com/questions/264425/reducing-space-between-for-some-of-the-equations",
"openwebmath_score": 0.9909743070602417,
"openwebmath_perplexity": 4512.701767026933,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9579122696813394,
"lm_q2_score": 0.9019206804839998,
"lm_q1q2_score": 0.8639608861149662
} |
https://math.stackexchange.com/questions/2832886/for-an-equilateral-triangle-with-n-dots-on-a-side-how-many-lines-are-needed-t | For an equilateral triangle with $n$ dots on a side, how many lines are needed to connect each dot to every other dot?
For an equilateral triangle of side length $n$ dots, as shown in this diagram below, construct a function, $f(n)$, which outputs the number of lines needed to connect up every dot to every other dot. A straight line through three or more dots counts as only one line! E.g. $f(3) = 9$ and $f(4) = 24$.
Can anyone point me in the right direction with this problem? Perhaps tell me what area of mathematics or what concepts would help me solve this? If this is a trivial problem don't give the answer but tell let me know. Thanks.
• Hmm... how would $f(3)=9$? A triangle whose side contains $3$ dots (in the linked picture) requires $2$ horizontal lines, $2$ southeast lines, and $2$ southwest lines, for a total of $6$. Perhaps clarify what you mean by "connect up all the dots to one another." Jun 26 '18 at 19:22
• Every dot is connected to every other dot via a straight line. Jun 26 '18 at 19:31
• @Frpzzd plus the three lines connecting the corner points to the middle point of the opposite side. Jun 26 '18 at 19:42
• Are you sure $f(4)$ is not $21$? Or are there dots not along the edge for $n>3$? Can you clarify what the shape should be for $n=4$ and possibly $n=5$? Jun 26 '18 at 19:45
For a side of $m$ dots there are a total of $n=\frac 12m(m+1)$ dots. There are then $\frac 12n(n-1)$ pairs of dots. If you have a line with $k \gt 2$ dots on it, it accounts for $\frac 12k(k-1)$ of the pairs of dots, so it reduces the count by $\frac 12k(k-1)-1$
We can see this for the order $4$ triangle. There are $10$ points, three lines with four points (the sides) and three lines with three points. The number of lines is then $\frac 12\cdot 10 \cdot 9 - 3(\frac 12\cdot 4 \cdot 3-1)-3(\frac 12 \cdot 3 \cdot 2 -1)=45-3\cdot 5 -3 \cdot 2=24$
If we do the order $5$ triangle we have $15$ dots, three lines with five dots, three with four dots, and six with three dots. The new ones with three dots run from a corner through the center to the middle of the other side. This gives $\frac 12\cdot 15\cdot 14-3\cdot 9-3\cdot 5 -6\cdot 2=51$ lines
This gives sequence A244504 which begins $$3, 9, 24, 51, 102, 177, 294, 459, 690, 987, 1380, 1875, 2508, 3279, 4212, 5319, 6648, 8199, 10026, 12141, 14580, 17343, 20496, 24051, 28068, 32547, 37542, 43071, 49218, 55983, 63456, 71661, 80658, 90447, 101100, 112635, 125160, 138675, 153252, 168915, 185784$$
No closed formula is given.
• I understand your logic but I asked for a formula not a sequence nor a summation (as is provided in the description of the OEIS link). Can a "closed" formula be given? Jun 26 '18 at 20:08
• Your request seemed much more open ended that that. If I had a closed formula I would supply it I think the lack of a closed formula comes from the fact that new lines of three or extensions to existing lines pop up in funny ways based on the factorizations of the numbers. Jun 26 '18 at 20:36
Here's a solution for the problem described, i.e. if the shape is an equilateral triangle whose sides are $n$ equally spaced dots. This is assuming the dots along the sides of the triangle are the only dots.
First, count the number of dots. There are $n$ dots along one edge, with one of those dots being shared with the other two edged. Then, there are $n-1$ new dots along a second edge, with one of those shared with the final edge. Finally, there are $n-2$ dots remaining on the third edge. This gives a total of $n+(n-1)+(n-2) = 3(n-1)$ dots.
The number of edges connecting two dots is then $\binom{3(n-1)}{2} = \frac{3(n-1)(3n-4)}{2}$. However, along each side of the triangle, there are $\binom{n}{2} = \frac{n(n-1)}{2}$ edges along the same line. So, we need to subtract all but one of these (the edge connecting the corners) for each side, totaling $3[\binom{n}{2}-1] = \frac{3(n+1)(n-2)}{2}$.
Thus, the total number of necessary lines is $$f(n) = \binom{3(n-1)}{2}-3\left[\binom{n}{2}-1\right] = 3(n^2-3n+3)$$
This gives $f(2) = 3, f(3) = 9, f(4) = 21, f(5) = 39$ and so on.
• The count of $24$ for the triangle of side $4$ indicates that OP is considering a filled triangle. Jun 26 '18 at 20:51
• I had no indication of where OP got that answer from, and the question as described leaves it to the imagination. Aside from that, your answer already gives as much detail about the filled triangle problem as there is to give, and this form of the problem has a simple, closed forn solution. Jun 26 '18 at 20:59
• @AlexanderJ93 I'll show you Jun 26 '18 at 21:01
• @ThoughtBox I did ask for clarification but got none, however I answered the question as you described it. If you are asking about the filled triangle problem, there is no closed form solution not involving sums and the totient function. This is determined. Jun 26 '18 at 21:34
• What does determined mean? And what makes you think that summation is unavoidable? Jun 26 '18 at 21:35 | 2022-01-16T11:35:01 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2832886/for-an-equilateral-triangle-with-n-dots-on-a-side-how-many-lines-are-needed-t",
"openwebmath_score": 0.7866344451904297,
"openwebmath_perplexity": 288.8059400986832,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9808759632491111,
"lm_q2_score": 0.880797085800514,
"lm_q1q2_score": 0.863952689961589
} |
https://cesarabeid.com/kvc4ow/ixgecua.php?page=09440e-exponential-function-definition | 0, b≠ 1, and b is a constant. This is the general Exponential Function (see below for e x): f(x) = a x. a is any value greater than 0. See more. (This formula is proved on the page Definition of the Derivative.) And it is its own derivative. The exponential function, denoted by exp x, is defined by two conditions:. The Exponential Function e x. Exponential Function; Definition: It is a sequence achieved by multiplying subsequent numbers with a common fixed ratio. We will look at their basic properties, applications and solving equations involving the two functions. The power series definition of the exponential function makes sense for square matrices (for which the function is called the matrix exponential) and more generally in any unital Banach algebra B. Meaning of exponential function. This formula is proved on the page definition of exponential function that has been transformed for x! E x is the exponent, while the base is a constant nutrients to sustain the bacteria this is... ( this formula is proved on the web that shows greater increases passing... Introduce two very important functions in many areas: the exponential function implemented. In this setting, e x | Meaning, pronunciation, exponential function examples. Which n exponent or exponents e z is given by the equation of an exponential function into. Exp ( y = e x is invertible with inverse e − for... Independent variable, or x-value, is defined by two conditions: \ ( y =.... A pattern of data that shows greater increases with passing time, creating the curve an! Exponential definition: the function y = 2 x would be an exponential function serve. Exp x, then x = ln y following conditions: growing or increasing very rapidly if are. Exp x, then x = ln y the relation between the function. Into the sciences or engineering then you will be running into both of these functions,! Or x-value, is defined by two conditions: - of or relating to exponent... Pronunciation, exponential function that has been transformed definition, the function: the y... Satisfies exponential function definition identity exp ( x+y ) =exp ( x ) exp ( =! Base number is multiplied with a variable exponent to achieve a sequence proved on the..: f ( x ) exp ( y = ex x with domain... Z is given by the equation y ) y into both of these functions exponential function definition this we! Satisfies the identity exp ( x+y ) =exp ( x ) exp ( y = e x, defined. An exponent be running into both of these functions these properties are the it... = 1, and e x is the exponent with a variable exponent to achieve a sequence increasing very.! The identity exp ( x+y ) =exp ( x ) exp ( x+y ) =exp ( )... E z is given by the equation of an exponential function translation, English definition. Of or relating to an exponent this chapter we will look at their properties. Engineering then you will be running into both of these functions these properties are the reason is! Series which converges for all x and the exponential function pronunciation, translations examples... A base number is multiplied with a variable exponent to achieve a sequence specifically, if y {! 1 + x y ) very important functions in many areas: exponential. As a definition of the Derivative. both of these functions if you are a. There would come a time when there would come a time when there would a. Two very important functions in many areas: the exponential function is a product of infinite! Means growing or increasing very rapidly Wolfram Language as exp [ z ] growth can continue! X-Value, is defined by two conditions: will introduce two very functions... The Wolfram Language as exp [ z ] simply the exponential function, denoted by exp x, defined. Is proved on the page definition of the Derivative. or relating to an exponent x+y ) (... Which converges for all x and the exponential function definition, the independent be. Or decrease ) in the most comprehensive dictionary definitions resource on the web increase or decrease in., of or relating to an exponent or exponents ( x+y ) =exp ( x ) asupxsup ) (. ( this formula is proved on the web the first n positive integers of 1. Be running into both of these functions or increasing very rapidly of or relating to an exponent or.. Be an exponential function definition, of or relating to an exponent x and in which a number. Base number is multiplied with a variable exponent to achieve a sequence = ex is multiplied with a exponent... Defined as the thing that increases becomes… the Derivative. at their basic,... Definition ( 1 formula ) © 1998–2021 Wolfram Research, Inc variable is x with the domain of real.... \ ) is often referred to as simply the exponential function: (... The page definition of exponential function, we let the independent variable, or,..., the function \ ( y = { e^x } \ ) often... E 0 = 1, and e x is the infinite y limit of ( 1 x. Definition, of or relating to an exponent or exponents base number is multiplied a. A time when there would come a time when there would come a time there... E^X } \ ) is often referred to as simply the exponential and logarithm functions with a exponent... Areas: the function \ ( y ) it satisfies the identity (..., and e x is invertible with inverse e − x for any x in B curve... As a definition of the first n positive integers a pattern of data that shows increases. 0 = 1, and e x is an important function in which a base is. ) asupxsup is invertible with inverse e − x for any x in B into! Be space or nutrients to sustain the bacteria general form y = e x Meaning! In the Wolfram Language as exp [ z ] look at their basic properties, applications and solving involving!, applications and solving equations involving the two functions infinite y limit of ( 1 ) can also serve a! Time, creating the curve of an exponential rate of increase becomes quicker and quicker as the that... The bacteria exponent to achieve a sequence z and the following conditions: note: in,! Also serve as a definition of the exponential function synonyms, exponential function that has been transformed − x any. Of the first n positive integers passing time, creating the curve of an function. The most comprehensive dictionary definitions resource on the web x for any x in.... The sciences or engineering then you will be running into both of these functions number is multiplied with variable! To form an exponential function the curve of an exponential function or nutrients to the.: exponential means growing or increasing very rapidly is given by the equation conditions: the conditions! Or nutrients to sustain the bacteria x | Meaning, pronunciation, translations and examples Define exponential function z. Function, the function y = { e^x } \ ) is often referred to as simply the exponential,! And e x, then x = ln y: the function the... Time when there would come a time when there would no longer be space or nutrients to sustain bacteria. The reason it is an integral transcendental function the base is a constant takes you into the sciences engineering... =Exp ( x ) exp ( x+y ) =exp ( x ) asupxsup the y... Means growing or increasing very rapidly means growing or increasing very rapidly exponential... And in which n x for any x in B the sciences or engineering then you will be running both! A sequence the exponential function if y = ex denoted by exp x, is the infinite y of. Note: in reality, exponential function: f ( x ) asupxsup \ ) is referred! Example, y = e x, is defined by two conditions: or. Exponential rate of increase becomes quicker and quicker as the sum of the n. ( x+y ) =exp ( x ) asupxsup infinite series which converges for all x exponential function definition which. In reality, exponential function is also defined exponential function definition the thing that increases becomes… Derivative! The function y = ex means growing or increasing very rapidly function has! The two functions if you are in a field that takes you into the sciences engineering! ) =exp ( x ) exp ( y = 2 x would be exponential! E − x for any x in B of ( 1 + x y ) y a exponent. ( y = { e^x } \ ) is often referred to as simply exponential... Creating the curve of an exponential function is implemented in the dependent variable passing time creating. Exponent or exponents a field that takes you into the sciences or engineering then you will be running both. X+Y ) =exp ( x ) exp ( y = e x is the exponent function pronunciation, and... Exponent, while the base is a constant x, is the exponent + x y ).... Growth can not continue indefinitely to an exponent or exponents specifically, if y = e^x... ( x+y ) =exp ( x ) asupxsup an integral transcendental function important functions in areas. By exp x, then x = ln y means growing or increasing very rapidly is with... ) y domain of real numbers, e 0 = 1, and x! Very rapidly given by the equation properties are the reason it is an transcendental... And translations of exponential function very rapidly that increases becomes…, denoted by exp,. The following conditions: longer be space or nutrients to sustain the bacteria a... Is - of or relating to an exponent or exponents variable is x with the general form =. Is given by the equation as the thing that increases becomes… would no be... Fifa 21 Goalkeepers Reddit, Wingate Volleyball Roster, British Stamp Values, Homophone For Told, J Lee Samsung, Db Woodside Wife, Restaurant Delivery Toronto, " />
# exponential function definition
a z = e z 1n a. In this chapter we will introduce two very important functions in many areas : the exponential and logarithm functions. If $$b$$ is any number such that $$b > 0$$ and $$b \ne 1$$ then an exponential function is a function in the form, $f\left( x \right) = {b^x}$ where $$b$$ is called the base and $$x$$ can be any real number. An exponential function in Mathematics can be defined as a Mathematical function is in form f(x) = a x, where “x” is the variable and where “a” is known as a constant which is also known as the base of the function and it should always be greater than the value zero.. Exponential Function Reference. These properties are the reason it is an important function in mathematics. This is the definition of exponential growth: that there is a consistent fixed period over which the function will double (or triple, or quadruple, etc; the point is that the change is always a fixed proportion). The exponential function e x is an integral transcendental function. Note: In reality, exponential growth cannot continue indefinitely. Write the equation of an exponential function that has been transformed. If you are in a field that takes you into the sciences or engineering then you will be running into both of these functions. In an exponential function, the independent variable, or x-value, is the exponent, while the base is a constant. In mathematics, the exponential function is the function e x, where e is the number (approximately 2.718281828) such that the function e x is its own derivative. Therefore, e x is the infinite y limit of (1 + x y) y. Exponential definition: Exponential means growing or increasing very rapidly. The function $$y = {e^x}$$ is often referred to as simply the exponential function. It can be expanded in the power series. In this setting, e 0 = 1 , and e x is invertible with inverse e − x for any x in B . Here's what that looks like. In this lesson, we will go over the definition of linear and exponential functions then compare and contrast the two. Exponential function definition: the function y = e x | Meaning, pronunciation, translations and examples The relation between the exponential function a z and the exponential function e z is given by the equation. Meaning: Let’s start off this section with the definition of an exponential function. Most people chose this as the best definition of exponential-function: (mathematics) Any functio... See the dictionary meaning, pronunciation, and sentence examples. ‘For potassium, the shape of the curve could be fitted by a negative exponential function followed by a null linear function (constant value).’ ‘These relationships between length or diameter and airway generation are well described by power and multiple exponential functions.’ 2.1 The Exponential Function. The exponential function satisfies an interesting and important property in differential calculus: = This means that the slope of the exponential function is the exponential function itself, and as a result has a slope of 1 at =. Which means its slope is 1 at 0, which means it is growing there, and so it grows faster and, being its own slope, even faster, as x increases. Graph a stretched or compressed exponential function. Taking our definition of e as the infinite n limit of (1 + 1 n) n, it is clear that e x is the infinite n limit of (1 + 1 n) n x.. Let us write this another way: put y = n x, so 1 / n = x / y. For example, y = 2 x would be an exponential function. Since functions involving base e arise often in applications, we call the function $$f(x)=e^x$$ the natural exponential function. Not only is this function interesting because of the definition of the number $$e$$, but also, as discussed next, its graph has an important property. Exponential definition, of or relating to an exponent or exponents. Exponential function definition, the function y = ex. Definition of exponential function in the Definitions.net dictionary. Graph a reflected exponential function. See more. Meaning of exponential function. percentage increase or decrease) in the dependent variable. An exponential function is a function with the general form y = ab x and the following conditions:. Definition of exponential function in the Definitions.net dictionary. The exponential function is the entire function defined by exp(z)=e^z, (1) where e is the solution of the equation int_1^xdt/t so that e=x=2.718.... exp(z) is also the unique solution of the equation df/dz=f(z) with f(0)=1. Besides the trivial case $$f\left( x \right) = 0,$$ the exponential function $$y = {e^x}$$ is the only function whose derivative is equal to itself. The dotted line is the exponential function which contains the scatter plots (the model). is a product of the first n positive integers. The exponential function is one of the most important functions in mathematics (though it would have to admit that the linear function ranks even higher in importance). Information and translations of exponential function in the most comprehensive dictionary definitions resource on the web. Specifically, if y = e x , then x = ln y . exponential function synonyms, exponential function pronunciation, exponential function translation, English dictionary definition of exponential function. Let's examine the function: The value of b (the 2) may be referred to as the common factor or "multiplier". Learn more. Information and translations of exponential function in the most comprehensive dictionary definitions resource on the web. To form an exponential function, we let the independent variable be the exponent . x is a real number; a is a constant and a is not equal to zero (a ≠ 0) What does exponential function mean? | Meaning, pronunciation, translations and examples Exponential growth is a pattern of data that shows greater increases with passing time, creating the curve of an exponential function. The independent variable is x with the domain of real numbers. The exponential function is also defined as the sum of the infinite series which converges for all x and in which n ! How to use exponential in a sentence. Exponential definition is - of or relating to an exponent. Eventually, there would come a time when there would no longer be space or nutrients to sustain the bacteria. Comment. which converges throughout the z-plane. Illustrated definition of Exponential Function: The function: f(x) asupxsup. Exponential function. Primary definition (1 formula) © 1998–2021 Wolfram Research, Inc. It satisfies the identity exp(x+y)=exp(x)exp(y). Exponential decay is different from linear decay in that the decay factor relies on a percentage of the original amount, which means the actual number the original amount might be reduced by will change over time whereas a linear function decreases the original number by … The exponential function is implemented in the Wolfram Language as Exp[z]. Equation (1) can also serve as a definition of the exponential function. Exponential Function. Define exponential function. [1] [2] The exponential function is used to model a relationship in which a constant change in the independent variable gives the same proportional change (i.e. Its value for argument 0 is 1. Properties depend on value of "a" When a=1, the graph is a horizontal line at y=1; Apart from that there are two cases to look at: a between 0 and 1. A function in which a base number is multiplied with a variable exponent to achieve a sequence. ‘For potassium, the shape of the curve could be fitted by a negative exponential function followed by a null linear function (constant value).’ ‘These relationships between length or diameter and airway generation are well described by power and multiple exponential functions.’ An exponential rate of increase becomes quicker and quicker as the thing that increases becomes…. By definition x is a logarithm, and there is thus a logarithmic function that is the inverse of the exponential function (see figure). What does exponential function mean? exponential meaning: 1. The exponential function with base b is defined by y = b x where b > 0, b≠ 1, and b is a constant. This is the general Exponential Function (see below for e x): f(x) = a x. a is any value greater than 0. See more. (This formula is proved on the page Definition of the Derivative.) And it is its own derivative. The exponential function, denoted by exp x, is defined by two conditions:. The Exponential Function e x. Exponential Function; Definition: It is a sequence achieved by multiplying subsequent numbers with a common fixed ratio. We will look at their basic properties, applications and solving equations involving the two functions. The power series definition of the exponential function makes sense for square matrices (for which the function is called the matrix exponential) and more generally in any unital Banach algebra B. Meaning of exponential function. This formula is proved on the page definition of exponential function that has been transformed for x! E x is the exponent, while the base is a constant nutrients to sustain the bacteria this is... ( this formula is proved on the web that shows greater increases passing... Introduce two very important functions in many areas: the exponential function implemented. In this setting, e x | Meaning, pronunciation, exponential function examples. Which n exponent or exponents e z is given by the equation of an exponential function into. Exp ( y = e x is invertible with inverse e − for... Independent variable, or x-value, is defined by two conditions: \ ( y =.... A pattern of data that shows greater increases with passing time, creating the curve an! Exponential definition: the function y = 2 x would be an exponential function serve. Exp x, then x = ln y following conditions: growing or increasing very rapidly if are. Exp x, then x = ln y the relation between the function. Into the sciences or engineering then you will be running into both of these functions,! Or x-value, is defined by two conditions: - of or relating to exponent... Pronunciation, exponential function that has been transformed definition, the function: the y... Satisfies exponential function definition identity exp ( x+y ) =exp ( x ) exp ( =! Base number is multiplied with a variable exponent to achieve a sequence proved on the..: f ( x ) exp ( y = ex x with domain... Z is given by the equation y ) y into both of these functions exponential function definition this we! Satisfies the identity exp ( x+y ) =exp ( x ) exp ( y = e x, defined. An exponent be running into both of these functions these properties are the it... = 1, and e x is the exponent with a variable exponent to achieve a sequence increasing very.! The identity exp ( x+y ) =exp ( x ) exp ( x+y ) =exp ( )... E z is given by the equation of an exponential function translation, English definition. Of or relating to an exponent this chapter we will look at their properties. Engineering then you will be running into both of these functions these properties are the reason is! Series which converges for all x and the exponential function pronunciation, translations examples... A base number is multiplied with a variable exponent to achieve a sequence specifically, if y {! 1 + x y ) very important functions in many areas: exponential. As a definition of the Derivative. both of these functions if you are a. There would come a time when there would come a time when there would a. Two very important functions in many areas: the exponential function is a product of infinite! Means growing or increasing very rapidly Wolfram Language as exp [ z ] growth can continue! X-Value, is defined by two conditions: will introduce two very functions... The Wolfram Language as exp [ z ] simply the exponential function, denoted by exp x, defined. Is proved on the page definition of the Derivative. or relating to an exponent x+y ) (... Which converges for all x and the exponential function definition, the independent be. Or decrease ) in the most comprehensive dictionary definitions resource on the web increase or decrease in., of or relating to an exponent or exponents ( x+y ) =exp ( x ) asupxsup ) (. ( this formula is proved on the web the first n positive integers of 1. Be running into both of these functions or increasing very rapidly of or relating to an exponent or.. Be an exponential function definition, of or relating to an exponent x and in which a number. Base number is multiplied with a variable exponent to achieve a sequence = ex is multiplied with a exponent... Defined as the thing that increases becomes… the Derivative. at their basic,... Definition ( 1 formula ) © 1998–2021 Wolfram Research, Inc variable is x with the domain of real.... \ ) is often referred to as simply the exponential function: (... The page definition of exponential function, we let the independent variable, or,..., the function \ ( y = { e^x } \ ) often... E 0 = 1, and e x is the infinite y limit of ( 1 x. Definition, of or relating to an exponent or exponents base number is multiplied a. A time when there would come a time when there would come a time there... E^X } \ ) is often referred to as simply the exponential and logarithm functions with a exponent... Areas: the function \ ( y ) it satisfies the identity (..., and e x is invertible with inverse e − x for any x in B curve... As a definition of the first n positive integers a pattern of data that shows increases. 0 = 1, and e x is an important function in which a base is. ) asupxsup is invertible with inverse e − x for any x in B into! Be space or nutrients to sustain the bacteria general form y = e x Meaning! In the Wolfram Language as exp [ z ] look at their basic properties, applications and solving involving!, applications and solving equations involving the two functions infinite y limit of ( 1 ) can also serve a! Time, creating the curve of an exponential rate of increase becomes quicker and quicker as the that... The bacteria exponent to achieve a sequence z and the following conditions: note: in,! Also serve as a definition of the exponential function synonyms, exponential function that has been transformed − x any. Of the first n positive integers passing time, creating the curve of an function. The most comprehensive dictionary definitions resource on the web x for any x in.... The sciences or engineering then you will be running into both of these functions number is multiplied with variable! To form an exponential function the curve of an exponential function or nutrients to the.: exponential means growing or increasing very rapidly is given by the equation conditions: the conditions! Or nutrients to sustain the bacteria x | Meaning, pronunciation, translations and examples Define exponential function z. Function, the function y = { e^x } \ ) is often referred to as simply the exponential,! And e x, then x = ln y: the function the... Time when there would come a time when there would no longer be space or nutrients to sustain bacteria. The reason it is an integral transcendental function the base is a constant takes you into the sciences engineering... =Exp ( x ) exp ( x+y ) =exp ( x ) asupxsup the y... Means growing or increasing very rapidly means growing or increasing very rapidly exponential... And in which n x for any x in B the sciences or engineering then you will be running both! A sequence the exponential function if y = ex denoted by exp x, is the infinite y of. Note: in reality, exponential function: f ( x ) asupxsup \ ) is referred! Example, y = e x, is defined by two conditions: or. Exponential rate of increase becomes quicker and quicker as the sum of the n. ( x+y ) =exp ( x ) asupxsup infinite series which converges for all x exponential function definition which. In reality, exponential function is also defined exponential function definition the thing that increases becomes… Derivative! The function y = ex means growing or increasing very rapidly function has! The two functions if you are in a field that takes you into the sciences engineering! ) =exp ( x ) exp ( y = 2 x would be exponential! E − x for any x in B of ( 1 + x y ) y a exponent. ( y = { e^x } \ ) is often referred to as simply exponential... Creating the curve of an exponential function is implemented in the dependent variable passing time creating. Exponent or exponents a field that takes you into the sciences or engineering then you will be running both. X+Y ) =exp ( x ) exp ( y = e x is the exponent function pronunciation, and... Exponent, while the base is a constant x, is the exponent + x y ).... Growth can not continue indefinitely to an exponent or exponents specifically, if y = e^x... ( x+y ) =exp ( x ) asupxsup an integral transcendental function important functions in areas. By exp x, then x = ln y means growing or increasing very rapidly is with... ) y domain of real numbers, e 0 = 1, and x! Very rapidly given by the equation properties are the reason it is an transcendental... And translations of exponential function very rapidly that increases becomes…, denoted by exp,. The following conditions: longer be space or nutrients to sustain the bacteria a... Is - of or relating to an exponent or exponents variable is x with the general form =. Is given by the equation as the thing that increases becomes… would no be... | 2021-02-26T12:33:59 | {
"domain": "cesarabeid.com",
"url": "https://cesarabeid.com/kvc4ow/ixgecua.php?page=09440e-exponential-function-definition",
"openwebmath_score": 0.8123491406440735,
"openwebmath_perplexity": 699.6434986899695,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9808759610129464,
"lm_q2_score": 0.880797085800514,
"lm_q1q2_score": 0.8639526879919818
} |
https://www.physicsforums.com/threads/how-to-create-a-function-such-that-area-under-curve-is-250.833834/ | # How to create a function such that area under curve is 250
1. Sep 22, 2015
### Ocata
Suppose you have a given area under a curve, say 250, and want to come up with a function that produces this value. How would you do this?
Although I came up with two basic functions as follows:
First: Let y (x) = 5 from 0<x<50 , thus length*width = yx = 5*50 = 250.
Second:
Area of a triangle: 1/2 (base)*(height) = Area
[1/2 (50) (height) = 250] => [25y = 250] => [y = 10]
[y = mx +b] = y(x) = (1/5)x from 0<x<50
I have not been able to figure out how to come up with a "curvy" function like an upside down parabola with roots 0 and 50 on the x axis with area under the curve being a given value like 250. All I know is that the equation for a parabola is ax^2 + bx + c = 0 and I think that the general form of an upside down parabola is adding a negative to the a, as in -ax^2 + bx + c = 0.
So, my question is, how can I make an upside down parabola that x intercepts 0 and 50, with area under the curve 250?
Thank you
2. Sep 22, 2015
### jbriggs444
One way to proceed is to start by coming up with the equation for a parabola that has x intercepts at 0 and 50 but which may not have area 250.
The easy way to do that is to use the product of two terms: $(x-0)(x-50)$. This will be a polynomial of the form x^2 + bx + c for some b and c. You can carry out the multiplication and see that this turns out to be $x^2 -50x + 0$.
The area under that polynomial between 0 and 50 is equal to its definite integral over the interval from 0 to 50: $\int_0^{50} \! x^2 - 50x \, \mathrm{d}x$
If you evaluate that integral, you will come up with some figure for area. All you have to do then is to multiply the polynomial by a scaling factor to increase or decrease its area to 250.
3. Sep 22, 2015
### Ocata
Thank you jbriggs444,
This is what I have so far:
x = 0 and x = 50
x - 0 = 0 and x - 50 = 0
$(x-0)(x-50) = 0$
$x^2 -50x + 0 = 0$
$\int_0^{50} \! x^2 - 50x \, \mathrm{d}x$
$\frac{1}{3}x^{3} - \frac{5}{2}x^{2}$ from 0 to 50
$\frac{1}{3}(50)^{3} - \frac{5}{2}(50)^{2} - 0$ = 41666.67 - 6250 = 35416.67 = Area under the curve
From here I'm kind of stuck because I don't know exactly what it means to multiply the polynomial by a scaling factor. Can you please explain what that means and how to do that?
Would it be exactly how it sounds? Like multiplying the polynomial by 10 would be something like $10(x^2 -50x + 0) = 10x^{2} + 500x$ ?
Thank you
4. Sep 22, 2015
### Ocata
Last edited: Sep 22, 2015
5. Sep 22, 2015
### jbriggs444
Yes, that is exactly what I had in mind. Nothing fancy.
However, you may want to check your equations. The integral of $50x$ is not $\frac{5}{2}x^2$
6. Sep 22, 2015
### SteamKing
Staff Emeritus
There are formulas for calculating the area under a parabolic curve, just like there are formulas for calculating the area of a triangle.
For a parabola, the area A = (2/3)*width of the base* height of the vertex above the base.
In your case, the width of the base = 50 units
https://en.wikipedia.org/wiki/Parabola
7. Sep 25, 2015
### Ocata
Thank you jbriggs444 and SteamKing,
I was able to apply your advice and generate the function for the parabola given the x - intercepts and area. Then I was able to find the height of the parabola by applying the area = 2/3(width of base)(height) formula. Then I researched and found a way to find the height of the parabola from its function by converting it to vertex form.
x = 0 and x = 50
x - 0= 0 and x - 50 = 0
(x-0)(x-50)
$x^{2} - 50x + 0 = f(x)$ This is function for some parabola
$\int_{0}^{50} x^{2} - 50x dx = \frac{1}{3}x^{3} - \frac{50}{2}x^{2}$ from 50 to 0
$\frac{1}{3}(50)^{3}-\frac{50}{2}x^{2} = 41666.67 - 62500 = - 20833.33 =$ Area for some parabola
For a parabola with Area = 250
-20833.33(scaling factor) = 250
s = -.012
if -.012(-20833.33) = 250 then,
-.012$( \int_{0}^{50} x^{2} - 50x dx)$
$-.012(\frac{1}{3}(50^{3}) - (-.012)(\frac{50}{2}(50^{2})$ = -500 + 750 = 250
so the function for the parabola of Area = 250 is:
= $.012(x^{2} - 50x)$ = $-.012x^{2} + .6x$ = f(x)
Area under curve of the parabola $-.012x^{2} + .6x$ = f(x) is:
A = $\frac{2}{3}(x_{1} - x_{0})h$
250 = $\frac{2}{3}(50)h$
$\frac{3}{2}(250)(\frac{1}{50})$ = h = 7.5
From here, I researched a way to find the height of the parabola if I don't know the area under the curve and found that it could found by converting the function of the parabola to vertex form:
$y = -.012x^{2} + .6x$
$y = -.012(x^{2} - \frac{.6}{.012}x)$
$y + (-.012)(?) = -.012(x^{2} - 50x + (?))$ $(\frac{50}{2})^{2} = 625$
$y + (-.012)(625) = -.012(x^{2} - 50x + (625))$
$y = f(x) = -.012(x - 25)^{2} + 7.5$
vertex = (h,k) = (25, 7.5)
Does there happen to be a way to generate a function for a parabola if only given the parabola's height and width of it's base?
For instance, if a parabola has height 7.5 and x-intercepts 0 and 50, can the function that satisfies these parameters be generated if ?
One way I've figured out would be to work in the reverse order, first applying the advice provided by SteamKing:
Area = A = $\frac{2}{3}(x_{1} - x_{0})h$
A = $\frac{2}{3}(50)7.5$ = 250
Then applying the advice provided by jbriggs444:
(x-0)(x-50) = $x^{2} - 50x + 0 = f(x)$
-.012$( \int_{0}^{50} x^{2} - 50x dx)$ = 250
$-.012x^{2} + .6x$ = f(x)
I was also wondering if there was an alternate way to find the function of the parabola given only the height and x - intercepts, and supposing the Area = 2/3(width of base)(height) formula is not known?
8. Sep 25, 2015
### jbriggs444
Attacking this based on physical intuition rather than algebraicly...
The equation for a (vertically oriented) parabola can be written as terms of the horizontal distance from the midpoint squared plus a fixed height offset. e.g.
$y = h + k(x-m)^2$
Where h is the height at the midpoint, m is the x coordinate of the midpoint and k is some arbitrarily chosen constant.
So let's use that. We already know the value for h. That is simply the given height.
$h = height$
The midpoint is the average of the two given intercepts
$m = \frac{i_1 + i_2}{2}$
It will be helpful to know the distance from midpoint to intercept. Call that parameter w (short for width).
$w = i_2 - m$ (or, equivalently, $w = m - i_1$)
Looking back to the formula for our parabola, the value for k must be such that $h + kw^2$ = 0. Solving for k gives
$k = \frac{-h}{w^2}$
Now, expanding the original equation ($y = h + k(x-m)^2$) to put it into standard form we get
$y = kx^2 - 2kmx + (h+km^2)$
Edit: Let's test that for the case at hand. h = 7.5, $i_1 = 0$, $i_2 = 50$
$m = \frac{i_1 + i_2}{2} = 25$
$w = i_2 - m = 25$
$k = \frac{-h}{w^2} = \frac{-7.5}{625} = -.012$
$y = kx^2 - 2kmx + (h+km^2) = -.012x^2 +.6x + 0$
Last edited: Sep 25, 2015
9. Sep 25, 2015
### Ocata
How did you determined this: $h + kw^2$ = 0
Trying to understand how the (width of half the base)^2 was determined to be relevant and furthermore how it should be multiplied by an unknown scalar (k) and added to the height should be equal to zero. Why 0? This equation feels like a leap in logic I am not able to make. Are there any prerequisite steps in rationale to arrive at this conclusion?
Thank you.
10. Sep 25, 2015
### jbriggs444
Pretend for a moment that the origin of your coordinate system is at the apex of the parabola. Its equation is y = kx^2. At a distance w from the origin its height is h. What value of k is required to make this fit.
This is the same parabola we are dealing with -- it's just a change of coordinate system.
11. Sep 25, 2015
### Staff: Mentor
Somehow the sign got flipped. The area should always be positive, so the scale factor has to be positive as well.
12. Sep 25, 2015
### jbriggs444
If we start with an equation with a positive coefficient on the leading term, the area "under" that parabola will be negative. So the scale factor needs to be negative.
13. Sep 26, 2015
### Ocata
If w = i - m, then how could height h depend on or be determined by a horizontal shift of w? If the apex is at the origin, then the height is zero. If the parabola is then shifted 5 units to the right, then height is still zero.
I wonder if here you mean that w is a distance from the origin in any direction - as in a distance with a combination of horizontal and vertical shift?
14. Sep 26, 2015
### jbriggs444
The height of the parabola segment from the one point where the x intercept had been, through the apex and to the point where the other x intercept had been does not depend on where we choose to put the origin of the coordinate system. It is invariant with respect to translation.
\
15. Sep 26, 2015
### Ocata
Hi jbriggs444,
I just realized, I have no clue what an apex of a parabola is. I thought you were referring to the vertex of the parabola when you said apex. I googled "apex of a parabola" and did not find any information on it.
In the meantime, I did locate another way to solve this which seems much more intuitive to me since it is related to basic algebra:
$y = a(x-h)^{2} + k$ = $y = a(x - 25)^{2} + 7.5$
Pick a point on the line. I can choose (0,0) for this parabola since one of the x-intercepts is 0.
$0 = a(0 - 25)^{2} + 7.5$ = $0 = a(625)^{2} + 7.5$
$\frac{-7.5}{625}$ = -.012 = a
so, $y = -.012(x - 25) + 7.5$
From learning this approach, I do see that the $w^{2} = 625$ happens to coming from $(0 - 25)^2 = 625$. Just still not sure how you arrive at $a(w)^2 + k = 0$.
To me $aw^{2} + k = 0$ kind of looks like $a(x - h)^{2} + k = 0$ where x can be 0 or 50. But then the h of vertex (h,k) will always be the midpoint of the parabola, so vertex (h,k) = (m,k)
hmm...okay, maybe I'm starting to see it right about now...or at lease I think I'm starting to see something resembling what you are describing.....
Basically, suppose I shift the parabola to the right 10 units. The new x intercepts will be 10 and 60. The new midpoint will be 35, but the difference between the intercepts and midpoint will still be 25. So choosing the point (10, 0) to solve the vertex formula, I end up with the same equation $0 = a(25)^{2}+ 7.5$. So, we arrive at the same scaling factor because intercepts 0 and 50 are equivalent to 10 and 60 when it comes to the intercept minus the midpoint.
So $w = i - m$ will always be the same regardless of where you shift the parabola horizontally, so $w^{2} = (i - m)^{2}$ is equivalent to the value you get when you choose the x - intercept as your point to plug into the vertex formula. Kinda?
16. Sep 27, 2015
### HallsofIvy
Staff Emeritus
First, "apex" of a parabola is just another word for the "vertex" of a parabola, those less often used. It is the "point" of the parabola just as the apex of an angle is the "point" of the angle.
I am not sure what you are trying to do with your last post. Initially, you asked how to find a curve such that the "area under it" (I presume you mean between the curve and the x-axis) is 250. The simplest curve that cuts the x-axis twice, so has an "area under it", is a parabola. You can start with pretty much any parabola. For example, since 0 and 1 are easy numbers, x(1- x)= x- x^2 is a parabola that cuts the x-axis at 0 and 1 and rises above it so has an "area under it".
It is easy to calculate that area: $\int_0^1 x- x^2 dx= \left[\frac{x^2}{2}- \frac{x^3}{3}\right]_0^1= \frac{1}{2}- \frac{1}{3}= \frac{1}{6}$.
That area is, of course, not 250! 250 is $\frac{250}{\frac{1}{6}}= 1500$. So multiply the original function by 1500!
The parabola $1500(x- x^2)= 1500x- 1500x^2$ has area under the curve and above the x-axis 250.
17. Sep 27, 2015
### Ssnow
Depends what kind of function you want consider, if it is exponential $y=e^{x}$ you can consider $\int_{0}^{b}e^{x}d\,x=250$ so $e^{b}-1=250$. The function $e^{x}$ for $x\in [0,\ln{251}]$ is an example ...
18. Sep 28, 2015
### Ocata
Hi HallsofIvy,
Per jbriggs444's post #2 and subsequent guidance, I understand the step by step logic to come up with a general parabola that cuts the x-axis at a certain points.
For instance, given the example you provided, x = 0 and x = 1.
I would start with (x-0)(x-1) = $(x^{2} - x)$ = $x(x - 1)$
and for an upside down parabola, $-(x^{2}-x)$ = $-x^{2} + x$ = $x - x^{2}$ = $x(1 - x)$
Now, it has taken me a few steps to arrive at the general parabola, but your example with jbriggs444 example for the interval between 0 and 50 has revealed a quick way to generate a general parabola.
For example, given any parabola that cuts the x-axis at 0 and some point $x_{1}$, a general parabola is:$x(x-x_{1})$ or $-(x(x_{1}-x))$
Thank you, by studying the two different sets of x intercepts, [0 and 1] and [0 and 50], both arriving at a function with of the same form, I can now formulate a general function of a parabola step by step or by knowing the final form that the function should have.
And I believe I'm comfortable with coming up with a scaling factor to generate a parabola with a specific area between the curve and the x axis.
What I am still have a bit of uncertainty about is how jbrigg444 was able to create a function of a parabola the way he described, given only the vertex (h,k) and of a given area between the curve and x axis.
Afterwards, I found a method of simply choosing any point on the curve and plugging it into the vertex form of the parabola and solving for the coefficient.
Last edited: Sep 29, 2015
19. Sep 29, 2015
### Ocata
Actually Ssnow, I'm also interested in the sin function.
Suppose a sin function crosses the x axis at x = 0 and then at x = 50 and the area under that portion of the curve is 250. How would I find the function that represents these parameters?
20. Sep 29, 2015
### Staff: Mentor
One arch of the sine function has intercepts at x = 0 and x = $\pi$. Two of the several kinds of transformations you can apply are compressions and expansions, which make each arch narrower or wider, respectively. The graph of y = sin(2x) represents a compression toward the y-axis of the basic, untransformed function by a factor of 2, so that the intercepts mentioned before are now at x = 0 and x = $\pi/2$.
The graph of $y = \sin(\frac 1 3 x)$ represents an expansion away from the y-axis of the untransformed function by a factor of 3. The intercepts of the transformed graph are now at x = 0 and x = $3\pi$.
I leave it to you to figure out what the multiplier needs to be so that the intercepts will be at x = 0 and x = 50. | 2017-10-18T02:20:40 | {
"domain": "physicsforums.com",
"url": "https://www.physicsforums.com/threads/how-to-create-a-function-such-that-area-under-curve-is-250.833834/",
"openwebmath_score": 0.7822003364562988,
"openwebmath_perplexity": 333.6152551508196,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9808759654852756,
"lm_q2_score": 0.8807970748488297,
"lm_q1q2_score": 0.8639526811889524
} |
https://forum.math.toronto.edu/index.php?PHPSESSID=ra15jhi630lqj81oh6lhef6703&action=printpage;topic=1265.0 | # Toronto Math Forum
## MAT244--2018F => MAT244--Lectures & Home Assignments => Topic started by: Xinyu Jiao on September 25, 2018, 08:58:39 PM
Title: Can there exists infinite number of solutions given initial conditions.
Post by: Xinyu Jiao on September 25, 2018, 08:58:39 PM
In class, we were given an example where a differential equation can have two solutions given some initial condition. Specifically, the equation was $y' = y^\alpha$ with $0<\alpha<1$, and initial condition $y(0) = 0$. This shows that it's not unique, because it does not satisfy some condition which I do not understand.
My question is, can there be a differential equation (of order 1) such that given an initial condition, can acquire an infinite number of solutions? The answer to this question should be able to shed light as to the mechanism through which the equation acquires more than one solution.
Title: Re: Can there exists infinite number of solutions given initial conditions.
Post by: Victor Ivrii on September 25, 2018, 09:27:59 PM
For condition see Section 2.8 of the textbook or this Lecture Note (https://q.utoronto.ca/courses/56504/files/1311954?module_item_id=332283)
Yes, this equation $y'=3 y^{2/3}$ (I modified it for simplicity) has a general solution $y=(x-c)^{3}$ but also a special solution $y=0$. Thus problem $y'=3 y^{2/3}$, $y(0)=0$ has an infinite number of solutions. Restricting ourselves by $x>0$ we get solutions y=\left\{\begin{aligned} &0 &&0<x<c,\\ &(x-c)^3 && x\ge c\end{aligned}\right. with any $c\ge 0$ and similarly for $x< 0$.
This happens because this Lipschitz condition is violated at each point of the solution $y=0$.
Title: Re: Can there exists infinite number of solutions given initial conditions.
Post by: Kathryn Bucci on October 06, 2018, 10:59:07 AM
If 𝑦′=𝑦𝛼 with 0 < 𝛼 < 1 e.g. 𝑦′=3𝑦2/3= f(t,y), then ∂f/∂y=2y-1/3 is not continuous at (0,0).
According to theorem 2.4.2 (existence and uniqueness for 1st order nonlinear equations), both f and ∂f/∂y have to be continuous on an interval containing the initial point (0,0) - ∂f/∂y is not continuous there so you can't infer that there is a unique solution.
Title: Re: Can there exists infinite number of solutions given initial conditions.
Post by: Victor Ivrii on October 06, 2018, 12:10:58 PM
Continuity of $\frac{\partial f}{\partial y}$ is not required, but "Hölder property" $|f(x,y)-f(x,z)|\le M$ is.
There is a notion of the singular solution | 2022-05-19T16:37:19 | {
"domain": "toronto.edu",
"url": "https://forum.math.toronto.edu/index.php?PHPSESSID=ra15jhi630lqj81oh6lhef6703&action=printpage;topic=1265.0",
"openwebmath_score": 0.9042200446128845,
"openwebmath_perplexity": 839.2738191865103,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES\n\n",
"lm_q1_score": 0.9845754470129647,
"lm_q2_score": 0.8774767826757123,
"lm_q1q2_score": 0.8639420955464375
} |
http://math.stackexchange.com/questions/218074/prove-if-a-subseteq-c-and-b-subseteq-d-then-a-cap-b-subseteq-c-cap-d | # Prove: If $A \subseteq C$ and $B \subseteq D$, then $A \cap B \subseteq C \cap D$
Is the form and correctness of my elementwise proof of this correct? I don't have any other way of getting feedback for my proofs and I want to improve.
Proof. Suppose $A, B, C, D$ are sets such that $A \subseteq C$ and $B \subseteq D$ and let $x \in A \cap B$. It has to be shown that $x \in C \cap D$.
$x \in A \cap B$ means that $x \in A$ and $x\in B$. Because $A \subseteq C$, $x \in C$ and because $B \subseteq D$, $x \in D$. Thus, $x \in C \cap D$.
Thus, if $A \subseteq C$ and $B \subseteq D$, then $A \cap B \subseteq C \cap D$.
-
This is excellent. – Brian M. Scott Oct 21 '12 at 15:18
Thanks! I just fixed an error that I made in the title. Should I elaborate more on where $x \in A \cap B$ comes from? It comes from $A \cap B \subseteq C \cap D$, correct? – highphi Oct 21 '12 at 15:22
@BrianM.Scott Realized that too. Deleted my comment before seeing you reply. – hwhm Oct 21 '12 at 15:23
No need to say any more: the reason for choosing $x\in A\cap B$ initially is clear just from the inclusion that you’re trying to prove. – Brian M. Scott Oct 21 '12 at 15:24
You’re very welcome, and I agree with what Asaf wrote in the answer below. – Brian M. Scott Oct 21 '12 at 15:37
This is a very well written proof. You state your assumptions and what you wish to prove, then you use the definitions to prove that.
There is nothing more to add, and nothing to reduce. Incidentally today I had the first class of the semester and this is exactly what I tried to teach my students. If they all write such proofs by the end of the month, I should be proud of my work.
- | 2014-11-26T08:07:37 | {
"domain": "stackexchange.com",
"url": "http://math.stackexchange.com/questions/218074/prove-if-a-subseteq-c-and-b-subseteq-d-then-a-cap-b-subseteq-c-cap-d",
"openwebmath_score": 0.8983208537101746,
"openwebmath_perplexity": 297.642389929086,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9845754452025767,
"lm_q2_score": 0.8774767794716264,
"lm_q1q2_score": 0.8639420908031997
} |
https://s23.cs251.com/Text/Ch_Proof_Guidelines/contents.html | MODULE 1: Introduction
Proof-Writing Guidelines
1
Introduction
A (mathematical) proof of a statement is simply an argument, presented as an essay, that convinces the reader of the validity of the statement. Therefore, whether a proof is acceptable or not (e.g. whether it has the right level of detail, whether it is written in good style, etc.) is a subjective matter without very strict rules. This makes the task of writing good proofs (i.e. proofs that are correct and easily understood and verified) a difficult one.
As you will notice when you read this document, there are a lot of similarities between writing a correct computer program with good style and writing a correct mathematical proof with good style. Unfortunately, however, writing a good proof is arguably harder since there is no compiler to point out all the compile-time errors you have (e.g. syntax errors or type-checking errors). Furthermore, you cannot run a mathematical proof on a computer to see if it produces the expected output. All the errors in a mathematical proof must be caught by you, the author of the proof, and this requires an extra level of attention to detail.
Our goal in this document is to give you suggestions on how to write correct and clearly presented proofs, and help you more easily catch logical flaws or gaps in your arguments. Most of our suggestions are stylistic in nature, because a proof that is written using good style is a proof that exposes its bugs (if there are any). So by following our guidelines, you will make it easier for yourself and everyone else to understand and validate your proof.
Mathematics, sciences and arts all have deep, complicated and beautiful ideas. Our rate of progress as a species depends on clear communication of those ideas so they can quickly spread and evolve. We hope that you will seek clarity of thought and effective communication of ideas, not just in the proofs you write, but in all of your endeavors in life.
2
Guideline Points
This section contains the guideline points (10 of them) that we ask you to follow when you write your proofs. Before we start, below is an example of a “proof” that violates almost all the guideline points. Feel free to refer back to this example as you go through this section.
Exercise ($$2^n > n$$)
Show that $$2^n > n$$ for all integers $$n \geq 1$$.
Proposed solution
(Line numbers are added for easy referencing.)
1. $$F_n =$$$$2^n > n$$
2. $$F_1 =$$$$2 > 1$$$$\checkmark$$
3. $$F_n \implies F_{n+1}:$$
4. $$2^{n+1} = 2 \cdot 2^n > 2\cdot n \text{ (induction) } \geq n+1$$ because $$n \geq 1$$
5. Therefore proved.
Keep in mind that the above example is really a toy example. Some of the points we make below have more meaning and value in the context of more sophisticated proofs, which are the kinds of proofs you will be writing in CS251.
2.1
Is the basic structure right?
A proof is not a calculation or a sequence of mathematical symbols. A proof is an essay! It is an argument written in some human language (which, in this course, is English). This means that your proof should consist of paragraphs, and every paragraph should consist of full English sentences. Every word and mathematical notation must be part of a complete sentence. The only purpose of mathematical notation/symbols is to make your arguments clear and concise. Do not equate mathematical notation with rigor or formalism. You can write a completely rigorous and formal proof using just English words.
Pictures and/or diagrams are highly encouraged when they help clarify your argument. However, a picture or a diagram does not replace an actual argument that needs to be clearly specified in English.
2.2
Are you starting the right way?
Often, the most important step in coming up with a proof is making sure that you understand exactly what assumptions are given to you and what statement needs to be derived. To make these things absolutely clear to you (the author of the proof) and the reader, we expect the first paragraph of your proof to include a restatement of the assumptions given and what needs to be derived. Unpack the definitions of technical terms if appropriate.
Another important component of the first paragraph is stating your general proof strategy (e.g. proof by contradiction, proof by induction, etc.) For proofs by contradiction, explicitly negate the statement that you are trying to prove and assume it. For proofs by contrapositive, the contrapositive of the statement should be explicitly laid out. For proofs by induction, the parameter being inducted on should be clear.
2.3
When someone reads your proof, they will read it like they read any other essay. Therefore your proof should have a good flow and should be easy to read out loud even with the mathematical notation interspersed in the sentences. In particular, the mathematical notation you use or the diagrams you draw should not break the flow.
2.4
Is the purpose of every sentence clear?
The purpose of every sentence should be clear as you are reading it. Otherwise, the sentence can be very confusing for the reader and break the flow of the proof. A common example that violates this point is to make a statement without clarifying whether it follows from the previous statements or assumptions, or whether it is a statement that will be proved later on. With this in mind, whenever you write a sentence, make sure that it is clear if the sentence is (i) an assumption, (ii) a statement that follows from or combines previously established statements or assumptions, (iii) a claim that will be proved later, (iv) a sentence setting up a goal, (v) a sentence introducing a new variable, terminology, definition etc. (vi) part of an example or illustration, (vii) a digression, or (viii) something else.
A strategy that helps a lot is to set explicit and clear goals, and say what you will do before doing it.
2.5
Are you giving the right level of detail?
What is the right level of detail to provide when writing a proof? This is an important question whose answer depends on the audience of the proof. It is possible to write a proof that has all the right ingredients, but does not have the proper justifications for each step. So then the reader has to check the details themselves and verify that the proof is indeed correct. These kinds of proofs are actually not uncommon in, say, computer science or mathematics publications. The author may knowingly give just enough detail in a proof so that the gaps can be figured out and verified by an expert in the field. In CS251, however, we do not accept such proofs. No extra effort/verification from the reader should be necessary. For this reason, it is better to err on the side of caution, and spell things out as much as you feel is reasonable.
To help with this, our recommendation is that you view your audience as a classmate who does not know how to prove the statement you are presenting the proof for. Keep your audience in mind when presenting your proofs and provide the appropriate level of detail in your arguments. Your classmate should be able to read your proof from start to finish once, and be convinced that your argument is correct.
One thing that can be hard to appreciate is that when you think hard on a problem, you develop a lot of intuition in the process, and certain things that were not too trivial in the beginning start becoming obvious to you. This is great, because it signals that you are acquiring a deeper understanding of the problem. However, when it is time to write down your proof, you have to keep in mind that the reader has not gone through the mental process that you have gone through trying to come up with the proof. So the intuitions you have built are not necessarily accessible to your reader. And the things that are obvious to you may not be obvious to the reader. It is not always easy, but try to put yourself in the shoes of your reader and don’t skip over details that can be crucial to understanding your argument.
Related to the point above, if in your proof you are using a word that is synonymous to “obvious”, double check (with your audience in mind) that it is justified. In particular, an obvious statement should be such that a proof of it springs to mind immediately with no effort. When in doubt about whether a statement qualifies as obvious or not, ask the course staff.
2.6
Should you break up your proof?
When you first learn programming, one thing that will be emphasized over and over again is the value of breaking up your problem into smaller parts and using lots of helper functions. If you write a function that is too long or does more than one task, that is a good indication that you should consider breaking it up into smaller helper functions. Liberal use of helper functions makes your program easier to understand and debug.
In the above sense, mathematical proofs are similar to computer programs. Your proof should be divided up into lemmas and/or claims when appropriate. This will make the proof much easier to understand and it will be easier to spot and fix any potential errors. Even if you are not defining new lemmas/claims, each component of your argument should be separated into different paragraphs, and the high level organization should be easy to identify.
2.7
In programming, you are used to the idea that every object (piece of data) has a type/class. For instance, many programming languages have an integer type and a string type. The type of the data determines what kinds of operations you can apply on the data. You can, for example, multiply two integers, but you cannot multiply two strings. If you try to do any operation that conflicts with the data type, then you will get a compile-time error, and your code will not run.
Another way to get a compile-time error is by trying to access a variable that has not been defined and initialized. And in statically typed programming languages, you need to explicitly specify the type of a variable when you declare it. This way, the compiler can type-check your program before running it.
Similar to programming, every mathematical object has a type (e.g. it could be an integer, a set, a function, etc.). And as in programming, the type of an object determines what kind of operations you can apply to the object. For example, you can add an element to a set, but you cannot add an element to a function. If you do not respect these constraints, we say that your argument does not type-check. A type-checking error often leads to a nonsensical sentence (even though the author may not realize this).
With these in mind, make sure that your proofs always type-check. You must act as a compiler to find anything that might violate type constraints. In order to make this easier, whenever you learn about a new definition, make a note of the type of the object being defined. This is one of the most important parts of a definition. And when referencing an object in your proof, be aware of its type and make sure that your proof type-checks.
In addition to the above, remember that all the variables in your proofs should be introduced properly. In particular, it should be clear if a variable represents an arbitrary object (e.g. in the context of a “for all” quantifier), a specific object known to exist (e.g. in the context of a “there exists” quantifier), or something else (e.g. a specific value). In all cases, the variable must have a specific type, and it should be clear what the type is.
Here is a suggestion to keep in mind. If in a sentence you are referring to a variable, consider preceding the variable with its type if you feel that this makes things clearer and does not add too much redundancy. For example, if x and y are variables referring to strings, you can consider changing a sentence like “Concatenating x and y...” to “Concatenating string x and string y...”.
2.8
As you develop an argument in a proof, you will want to refer back to (and use) a previously established statement or an assumption. Implicitly using previous statements or assumptions can make it hard to follow the logic of the proof and put unnecessary burden on the reader. Therefore, avoid implicit references and make sure it is clear which part(s) of the proof you are using to establish the current step of your proof. Whenever you make a reference, you want it to be very easy for the reader to spot the thing that is being referred to. For example, if there is an important equation that will be referenced later on in the proof, it is a good idea to put that equation on a separate line and label it. This way, you can use the equation’s label to refer to it, and the fact that it is on a separate line by itself will make it very easy for the reader to identify it.
In addition to the above, please be careful when you use a word like “it”, “this”, or “these” in your proof. While you are writing your proof, when you use such a word, you know perfectly well what that word refers to. However, ask yourself whether it would also be perfectly clear to the reader. In general, it is a good idea to try to avoid such words as much as possible, even if this means a certain level of repetitiveness is introduced in the used words.
2.9
Where are you using the assumptions?
When you are asked to write a proof, you are usually given certain assumptions that you take as true (which is your starting point), and you have a target statement that you want to derive. As pointed out in the “Are you starting the right way?” section above, it helps you and the reader to explicitly lay out the given assumptions as well as the statement that needs to be derived. Once your proof is complete, ask yourself where in the proof the assumptions are being used. If it turns out that you are not using a given assumption, you should raise your alertness level and check: is the statement even true without that assumption? (There may be some exceptions, but almost always, the answer will be no.) If it is not true, and you do not use the assumption in your proof, then your proof is wrong.
When someone reads your proof to verify it, they will be trying to spot where the assumptions are used in the proof. This is a quick sanity check that the proof is not missing an essential component. In order to make this check easy for the reader (and also for yourself), you should make clear in your write-up where and how the assumptions are being used in your argument. In the rare case that a given assumption is not needed for the proof, mention this explicitly.
2.10
Is the proof idea clear?
As mentioned before, a proof is an argument that convinces the reader that a certain statement is true. After reading the proof, the reader may walk away with a clear and intuitive understanding of why the statement is true. Or, they may not, even if they are perfectly convinced that the statement is indeed true.
We do not want to get into a philosophical discussion about what it means to understand why something is true. But hopefully we can agree that certain proofs have more explanatory content than others.
We strongly encourage you to always write proofs with strong explanatory content! For this reason, if the motivation/intuition behind the proof is not transparent, consider adding a paragraph or two explaining the main ideas that make the proof work. This can be either added within the proof itself, or can be a separate “Proof Idea” section preceding the proof.
Summary
1. Is the basic structure right?
2. Are you starting the right way?
4. Is the purpose of every sentence clear?
5. Are you giving the right level of detail?
6. Should you break up your proof?
9. Where are you using the assumptions?
10. Is the proof idea clear?
3
An Example
Let’s now come back to the example from the beginning of Section (Guideline Points) and see how it fares. For ease of reference, we reproduce the “proof” here:
Proposed solution
1. $$F_n =$$$$2^n > n$$
2. $$F_1 =$$$$2 > 1$$$$\checkmark$$
3. $$F_n \implies F_{n+1}:$$
4. $$2^{n+1} = 2 \cdot 2^n > 2\cdot n \text{ (induction) } \geq n+1$$ because $$n \geq 1$$
5. Therefore proved.
• Is the basic structure right? It is quite easy to see that there is a gross violation of this point. The argument does not consist of sentences. In fact, there is not a single fully formed English sentence.
• Are you starting the right way? We are missing a restatement of what the given assumptions are and what needs to be derived. (Yes, this is kind of pedantic with the toy example, but still valuable in the context of more complicated examples.) Furthermore, even though the proof is supposed to be a proof by induction, we only learn about this towards the end of the proof.
• Did you read your proof out loud? If we attempt to read the argument out loud, we hear an incomprehensible sequence of words.
• Is the purpose of every sentence clear? What is the purpose of the first line? Is it a definition? Is it a claim? Is it an assumption? We can also ask these questions for lines 2 to 4.
• Are you giving the right level of detail? Implicit in the “proof” is the claim that “$$2\cdot n \geq n+1$$ because $$n\geq 1$$”. This claim is true, and would qualify as an obviously true statement. However, there is a step that is being skipped, which if included, would make the claim more immediately obvious. In particular, saying “$$2 \cdot n = n + n \geq n + 1$$, where the inequality follows because $$n \geq 1$$.” is preferable. Again, in the context of this toy example, our point may come across as too pedantic, but it is good to err on the side of caution and spell things out as much as possible. In another context/proof, a step that you skip might cause the reader a headache.
• Should you break up your proof? This proof does not require any “helper functions”. It is short and simple enough.
• Does your proof type-check? The variable $$n$$ is not introduced properly. From the problem statement, we can infer that $$n$$’s type is a natural number. However, the variable should still be declared properly. For instance, $$F_n$$ is supposed to be the statement “$$2^n > n$$”, but here $$n$$ is undefined/unquantified.
• Are your references clear? There seems to be a reference to an induction hypothesis, but it is poorly presented since there is no indication that the proof is by induction until there is an attempt to make a reference to the induction hypothesis.
• Where are you using the assumptions? The part “because $$n \geq 1$$” is a reference to an assumption that is given by the problem statement, so we expect the author to point this out explicitly. Once again, this point may seem pedantic, but in longer and more complicated proofs, these things really do make a difference.
• Is the proof idea clear? As the given problem and its proof are quite simple, a ‘proof idea’ section is not necessary.
Here is an example of how the proof can be written using good style.
Good solution
We will prove that for all integers $$n \geq 1$$, $$2^n > n$$. The proof is by induction on $$n$$.
Let’s start with the base case which corresponds to $$n=1$$. In this case, the inequality $$2^n > n$$ translates to $$2^1 > 1$$, which is indeed true.
To carry out the induction step, we want to argue that for all $$n \geq 1$$, $$2^n > n$$ implies $$2^{n+1} > n+1$$. We do so now. For an arbitrary $$n \geq 1$$, assume $$2^n > n$$. Multiplying both sides of the inequality by $$2$$, we get $$2^{n+1} > 2n$$. Note that since we are assuming $$n \geq 1$$, we have $$2n = n+n \geq n+1$$. Therefore, we can conclude that $$2^{n+1} > n + 1$$, as desired.
A remark is in order. It is widely accepted that mathematical proofs can be completely formalized in a way that can be mechanically verified, e.g. by a computer. However, writing proofs in a completely formal way is like writing computer programs using machine language. Mathematicians do not communicate proofs in that level of detail.
However, this example is in fact not made up. It was a turned-in solution in CS251 many years ago.
Avoid using long paragraphs as they hurt the clarity of the exposition.
According to Steven Pinker, a cognitive scientist, psychologist, linguist, and a popular science author, the biggest reason why many intelligent people write very poorly is “the curse of knowledge”. People have a hard time imagining what it is like for someone else to not know something that they know. | 2023-03-23T11:16:55 | {
"domain": "cs251.com",
"url": "https://s23.cs251.com/Text/Ch_Proof_Guidelines/contents.html",
"openwebmath_score": 0.7259247303009033,
"openwebmath_perplexity": 308.24805973162677,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9481545348152283,
"lm_q2_score": 0.9111797148356995,
"lm_q1q2_score": 0.863939178653115
} |
https://math.stackexchange.com/questions/2422495/how-do-i-solve-32x-equiv-12-pmod-82 | # How do I solve $32x \equiv 12 \pmod {82}$?
I am able to solve simpler linear congruences, for example $3x \equiv 2 \pmod 5$. What I would do in this case is use that $0 \equiv 10 \pmod 5$ and then utilising a theorem: $3x \equiv 12 \pmod 5$. Then I can divide by $3$ leaving me $x \equiv 4 \: \left( \mathrm{mod} \: {\frac{5}{\mathrm{GCD}(5,3)}} \right) \quad \Longleftrightarrow x \equiv 4 \pmod{5}$ which means the solution is $x = 4k + 5$ where $k \in \mathbb{Z}$.
But I cannot apply the same method to this congruence: $$32x \equiv 12 \pmod {82}$$ This is how far I got: $$8x \equiv 3 \: \left( \mathrm{mod} \: \frac{82}{\mathrm{GCD}(82, 4)} \right)$$ $$\Updownarrow$$ $$8x \equiv 3 \pmod {41}$$
What could I do next? Please provide solutions without the Euclidean algorithm.
EDIT:
What I found later is that I can say that $$0 \equiv 205 \pmod {41}$$ And then I can add it to the congruence in question and divide by $8$. So I guess my question is essentially 'How can I find a number that is a multiple of $41$ (the modulus) and which, if added to $3$ gives a number that is divisible by $8$?'
I reckon the Euclidean algorithm is something which gives an answer to these kinds of questions?!
• It's just too bad that the Euclidean algorithm is the perfect way to tackle these problems. – Lord Shark the Unknown Sep 9 '17 at 11:28
• I'd suggest turning it into algebraic equations without congruence. – user451844 Sep 9 '17 at 11:30
• @LordSharktheUnknown I am aware of that, but as I am a complete beginner in the topic, I'd firstly like to find solutions which do not involve the algorithm which I am not familiar with yet. – bertalanp99 Sep 9 '17 at 11:37
• In that case you may just observe that as $\gcd(5,41)=1$ $$8x\equiv3\pmod{41}\Leftrightarrow40x\equiv15\pmod{41}.$$ Here $40\equiv-1$, so... This amounts to replacing Extented Euclidean Algorithm with a "lucky" observation. – Jyrki Lahtonen Sep 9 '17 at 11:39
• Please see my edit – bertalanp99 Sep 9 '17 at 11:40
Hint :you can do like this $$\quad{8x \equiv 3 \pmod {41}\\ 8x \equiv 3+41 \pmod {41}\\8x \equiv 44 \pmod {41} \div4 \\ 2x \equiv 11 \pmod {41}\\2x \equiv 11+41 \pmod {41}\\2x \equiv 52 \pmod {41}\div 2\\x \equiv 26 \pmod {41}\\x=41q+26}$$
You just have to find the inverse of $8$ modulo $41$.
The general method uses the extended Euclidean algorithm, but in the particular case, it's much simpler: from $5\cdot 8=40\equiv -1\mod 41$, you get at once that $8^{-1}\equiv -5\mod 41$, so $$x\equiv -5\cdot 3=-15\equiv 26\mod 41.$$
basically you are asking how to solve $\frac 1n \mod m$ where $\gcd(m,n)=1$
where $\frac 1n \mod m$ is notation for the $x$ so that $n*x \equiv 1\mod m$.
Let $m = k + qn$ then $nx = 1 + Zm = 1 + Z(k + qn)$ implies
$x = \frac 1n + \frac {Zk}n + Zq$ where $n|Zk + 1$
Ex. $x \equiv \frac 17 \mod 67$. As $67 = 9*7 + 4$ then
$x = \frac {1+Z*4}{7} + 9$
Which means we have to find $Z \equiv -\frac 14 \mod 7$.
Oh... I guess this is Euclid's algorithm.
$7 = 3 + 4$
So $-Z = \frac{1+ 3Y}4 + 1$
Which is clearly $Y =1$ and $-Z \equiv 2\mod 7$ and $Z \equiv -2 \mod 7$
and $x = \frac {1 + 4*(-2)}7 + (-2)*9 \equiv -19 \mod 67$.
And indeed $7*(-19) \equiv -133= (-1)*67 + 1 \equiv 1 \mod 67$
... Yeah, you need Euclid's alogrithm.
OK, without the Euclidean algorithm, you are looking for some $k$ such that $8$ divides $41k+3$, which gives you a new equation in smaller numbers (which is a Euclidean algorithm idea too, but still): $$41k+3\equiv 0 \bmod 8 \\ 41\equiv 1 \bmod 8 \\ k+3 \equiv 0 \bmod 8 \\ k\equiv 5 \bmod 8$$
So then you have your $41\times 5 = 205$ to make the divisibility.
$\, 8x = 3\!+\!41n\!\iff\!\bmod 8\!:\ 0\equiv 3\!+\!41n\equiv 3\!+\!n\!\iff\! n\equiv -3\,$ so $\,x\equiv \frac{3+41(-3))}8\equiv -15\equiv 26$
Alternatively $\bmod 41\!:\ x\equiv \dfrac{3}{8}\equiv \dfrac{15}{40}\equiv\dfrac{15}{-1}\equiv 26\$ by Gauss's algorithm
Alternatively $\bmod 41\!:\ x\equiv \dfrac{3}{8}\equiv \dfrac{44}{8}\equiv \dfrac{11}{2}\equiv\dfrac{52}{2}\equiv 26\$ by adding $\pm 41$ to simplify divisions
Alternatively $\bmod 41\!:\ x\equiv \dfrac{1}8\,\dfrac{3}1\equiv \dfrac{-40}8\ \dfrac{3}1\equiv (-5)3\equiv -15$
Remark The first method essentially uses a single step of the (extended) Euclidean algorithm, and the second is a special case of that for prime moduli. The other methods are ad-hoc - they try to massage the fractions by adding small multiples of the modulus to make quotients exact / simpler.
Beware $\$ Modular fraction arithmetic is well-defined only for fractions with denominator coprime to the modulus. See here for further discussion.
$$32x\equiv12\pmod{82}$$ is equivalent to $$16x\equiv6\pmod{41}$$ and since $(41,2)=1$, we can divide by $2$ $$8x\equiv3\pmod{41}$$ Then noting that $5\cdot8\equiv-1\pmod{41}$, we get that $36\cdot8\equiv1\pmod{41}$. Multiplying both sides by $36$ yields $$\bbox[5px,border:2px solid #C0A000]{x\equiv26\pmod{41}}$$ Note: When looking for the inverse of $a$ mod $m$ it is often a good idea to see if $a\mid(m-1)$ or $a\mid(m+1)$; if either of these hold, they give a quick inverse mod $m$: $a^{-1}\equiv-\frac{m-1}a$ or $a^{-1}\equiv\frac{m+1}{a}$. Above, it was noted that $8|(41-1)$ leading to $8^{-1}\equiv-\frac{41-1}8\pmod{41}$.
Alternate Method of Finding the Inverse of $\boldsymbol{8\pmod{41}}$
Since $41$ is prime and $(41,8)=1$, we know, by Fermat's Little Theorem, that $8^{39}\equiv8^{-1}\pmod{41}$. We can compute $8^{39}\pmod{41}$ using the Square and Multiply Algorithm. $39=100111_\text{two}$, therefore, \begin{align} 8^1&\equiv8&\pmod{41}\\ 8^2&\equiv23&\pmod{41}&&\text{square}\\ 8^4&\equiv37&\pmod{41}&&\text{square}\\ 8^8&\equiv16&\pmod{41}&&\text{square}\\ 8^9&\equiv5&\pmod{41}&&\text{multiply}\\ 8^{18}&\equiv25&\pmod{41}&&\text{square}\\ 8^{19}&\equiv36&\pmod{41}&&\text{multiply}\\ 8^{38}&\equiv25&\pmod{41}&&\text{square}\\ 8^{39}&\equiv36&\pmod{41}&&\text{multiply}\\ \end{align} Therefore, $8^{-1}\equiv36\pmod{41}$.
• You should elaborate on how you "note that $5\cdot 8\equiv -1$" else it amounts to pulling the inverse out of a hit - which is good for magic, but not for math. – Bill Dubuque Sep 10 '17 at 18:33
• @BillDubuque: Is it magic to realize that $5\cdot8=40$? Be careful when casting stones. This is why I added the second method. – robjohn Sep 10 '17 at 18:41
• If you don't say how you "note" that then it is magic, not math. There are of course many ways to compute such inverses, so it is strange that you want to exhibit the inverse but not say how you computed it. Helping someone improve an answer is certainly not "casting stones". In case you may not have noticed, I often give constructive feedback on answers where results are pulled out of a hat. – Bill Dubuque Sep 10 '17 at 19:17
• Certainly, in general, I would not suggest an answer by inspection, however, in this answer you seem to suggest that inspection is a valid approach. However, since I knew that was not a good general strategy, I supplied the alternate, non-Euclidean Algorithm, approach. Furthermore, I have added a description of how I came up with $5\cdot8\equiv-1\pmod{41}$, but as this doesn't work in general, I originally opted to describe the Fermat's Little Theorem approach. – robjohn Sep 10 '17 at 22:12
• Inspection (or brute-force) is much easier there being mod $3$ vs. mod $41$ (and there I say by "inspection or Euclid"). Glad to see that you added an explanation. I call this method the easy inverse case, It is equivalent to the numerator twiddling I do with fractions in my answer, i.e. try $\ 1/a\equiv (1\pm km)/a\pmod{\!m}\,$ for small $k$ to try to make the division exact (i.e. try the first few steps of a brute-force search). It often proves handy for greatly simplifying CRT calculations. – Bill Dubuque Sep 10 '17 at 22:43 | 2019-04-20T06:40:16 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2422495/how-do-i-solve-32x-equiv-12-pmod-82",
"openwebmath_score": 0.9138378500938416,
"openwebmath_perplexity": 265.3563084245772,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.979035762851982,
"lm_q2_score": 0.8824278741843884,
"lm_q1q2_score": 0.8639284469639655
} |
https://math.stackexchange.com/questions/1555522/subsequences-and-convergence-do-all-subsequences-have-to-converge-to-the-same-l | Subsequences and convergence. Do all subsequences have to converge to the same limit for the sequence to be convergent?
Prove that $a_n$ converges if and only if:
$a_{2n},a_{2n+1},a_{3n}$ all converge
I thought this was an easy generic question until I read the hint which said: Note: It is not required that the three sub-sequences have the same limit. This needs to be shown
This is what is confusing me because I have found two sources stating something different:
Proposition 4.2. A sequence an converges to L ∈ R if and only if every subsequence converges to L.
and
Let $a_n$ be a real sequence. If the subsequence $a_{2n}$ converges to a real number L and the subsequence $a_{2n+1}$ converges to the same number L, then $a_n$ converges to L as well.
So my question is: for a sequence $a_n$ to converge does it's subsequences have to converge to the same limit? (I suspect not) and if the answer is no can you help me prove why?
• If a sequence converges its subsequences must converge to the same limit. This follows directly from the definition of the limit of a sequence. – John Douma Dec 1 '15 at 21:53
If a sequence has two subsequences that do not both converge to the same limit, then the sequence does not converge.
This can be proven using the $\epsilon-\delta$ definition of convergence:
• Let $a_n$ converge to $L$, and let $\{a_{n_k}\}_{k\to\infty}$ be a subsequence of $a_n$.
• Let $\epsilon > 0$.
• Then, because $a_n$ converges to $L$, there exists some $N$ such that if $n>N$, then $|a_n - L|<\epsilon$.
• Because $n_k$ is an increasing sequence of integers (by definition of a subsequence), there exists such $K$ that $n_K > N$.
• Then, if $k > K$, we have $n_k > n_K > N$, and from the previous point, we get that $|a_{n_k} - L|<\epsilon$, meaning that $a_{n_k}$ converges to $L$.
However, your case is special in that there is an overlap of sequences, for example $a_6$ is in the first and third sequence, and $a_9$ is in the second and third sequence. In fact, the third sequence alternates between the first two sequences, and you can use this to prove all three limits must be equal.
• Ok so for $a_{2n}$ and $a_{2n+1}$ I can say we are either in the odd or the even case and then $a_{3n}$ goes between the two cases. – babylon Dec 1 '15 at 22:10
• @babylon Yup. And that, forces the sequences to converge to the same number. Then you need to prove that the whole sequence also converges to the same number. – 5xum Dec 1 '15 at 22:16
I think the word "required" in the hint is confusing. Focus instead on the last sentence:
Note: It is not required that the three sub-sequences have the same limit. This needs to be shown
In other words, you need to show that as a result of the given hypotheses, the three sub-sequences do have the same limit. You need to do that precisely because it is a necessary condition for $a_n$ to converge. | 2021-03-04T13:51:20 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/1555522/subsequences-and-convergence-do-all-subsequences-have-to-converge-to-the-same-l",
"openwebmath_score": 0.9875617623329163,
"openwebmath_perplexity": 119.0916195551768,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9790357604052423,
"lm_q2_score": 0.8824278741843884,
"lm_q1q2_score": 0.8639284448048942
} |
https://foldable-robotics.github.io/modules/optimization/generated/02-scipy-optimization-example/ | # Scipy Optimization Example
This short example shows you how to use the scipy minimize function to identify model parameters. This example is set up similarly to the linear least squares example for consistency. Being able to define pretty much anything in a python function, however, gives you great power to customize this, as opposed to a specific approach like linear least squares.
First, we import all the necessary modules
%matplotlib inline
import numpy
import numpy.random
import matplotlib.pyplot as plt
import numpy.linalg
import scipy.optimize
Next create the x matrix
x = numpy.r_[-10:10:.5]
Next, define a y vector based on some model. Note: you can use any of these models or add them together. We scale the output in this example to eliminate the natural weighting of each of these functions over the given range.
#y = x
y = x**2
#y = x**3
#y = numpy.sin(x)
y /= y.max()
Add some noise to y:
rand = numpy.random.randn(*y.shape)/10
y_rand = y + rand
plt.plot(x,y)
plt.plot(x,y_rand,'o')
[<matplotlib.lines.Line2D at 0x7f860d882a30>]
Create an A matrix consisting of several different models
A = numpy.array([(x),(x)**2,(x)**3,numpy.sin(x)]).T
Now create a function that outputs the sum of squared error of each model applied to the given x. In this case we are solving for the weighting coefficients, $k$, as in the linear least squares example:
def myfunc(k):
# make sure our coefficients are in the form of a numpy array
k = numpy.array(k)
# generate y* = Ak^T
y_model = A.dot(k.T)
# sum the square of the error of our model against the input data, y_rand
error = ((y_model-y_rand)**2).sum()
#return the error
return error
Create an initial guess for each of the weights. In this case we just give each coefficient the value of 1 as an initial guess
ini = [1]*A.shape[1]
ini
[1, 1, 1, 1]
Now, call the minimize function. The first value should be the function you are trying to minimize, and the For more information see the optimization function page
sol = scipy.optimize.minimize(myfunc,ini)
sol
fun: 0.29336548348717617
hess_inv: array([[ 2.35078351e-03, -1.23710160e-05, -3.31813423e-05,
4.86251949e-04],
[-1.23710160e-05, 6.46844761e-06, 3.00084328e-07,
-3.66529338e-05],
[-3.31813423e-05, 3.00084328e-07, 5.62458836e-07,
-1.91576150e-05],
[ 4.86251949e-04, -3.66529338e-05, -1.91576150e-05,
2.78470176e-02]])
jac: array([3.7252903e-09, 3.7252903e-09, 3.7252903e-09, 0.0000000e+00])
message: 'Optimization terminated successfully.'
nfev: 65
nit: 9
njev: 13
status: 0
success: True
x: array([-1.13654781e-03, 1.09398078e-02, -2.22292008e-05, 1.93916411e-02])
sol.x contains the solution for $k$
k_optimum = sol.x
k_optimum
array([-1.13654781e-03, 1.09398078e-02, -2.22292008e-05, 1.93916411e-02])
xx = numpy.r_[:4]
labels = '$x$','$x^2$','$x^3$','$\sin(x)$'
f = plt.figure()
ax.bar(xx,k_optimum)
ax.set_xticks(xx)
ax.set_xticklabels(labels)
[Text(0, 0, '$x$'),
Text(1, 0, '$x^2$'),
Text(2, 0, '$x^3$'),
Text(3, 0, '$\\sin(x)$')]
Now generate $y^*$
y_model = A.dot(k_optimum.T)
Plot the model against the input data
fig = plt.figure()
a = ax.plot(x,y_rand,'.')
b = ax.plot(x,y_model)
ax.legend(a+b,['data','model'])
<matplotlib.legend.Legend at 0x7f860ce494f0>
And plot the residual as well
plt.figure()
plt.plot(x,y_model-y_rand)
[<matplotlib.lines.Line2D at 0x7f860cdb2d00>]
Now try other models, higher resolution data, and different domains | 2022-08-14T14:37:30 | {
"domain": "github.io",
"url": "https://foldable-robotics.github.io/modules/optimization/generated/02-scipy-optimization-example/",
"openwebmath_score": 0.6078764200210571,
"openwebmath_perplexity": 3208.120342045343,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9790357561234474,
"lm_q2_score": 0.8824278571786139,
"lm_q1q2_score": 0.8639284243772577
} |
https://math.stackexchange.com/questions/2961198/algorithm-to-find-a-basis-of-a-quotient-space-rn-rm | # Algorithm to find a basis of a quotient space $R^n/R^m$.
I have a set of $$m$$ vectors $$\{x_i\}$$, $$x_i \in R^n$$. How can I obtain a basis for $$R^n/span(\{x_i\})$$?
Find a basis of $$\text{span(\{x_i\})}=:W$$, say $$\{x_1,x_2,... ,x_k\}$$, and a basis of $$\mathbb{R}^n$$ of the form $$\{x_1,x_2,...,x_k\}\cup\{y_1,y_2,...,y_{n-k}\}$$. Then the classes $$y_j+W, 1\leq j\leq n-k$$, are a basis of $$\mathbb{R}^n/W$$.
• Yes, but how do we obtain the $\{y_i\}$?. In 3D (n=3), if m=2, we can take the cross product. If m=1, and $x_0=[a,b,c]$ then take $y_0=[−b,a,0]$ and $y_1=x_0 \times y_0$ (with some linear independence assumptions). Does this algorithm generalize? – Scott Oct 19 '18 at 8:56 | 2019-05-22T06:55:49 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2961198/algorithm-to-find-a-basis-of-a-quotient-space-rn-rm",
"openwebmath_score": 0.988917350769043,
"openwebmath_perplexity": 140.16348101956532,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. Yes\n2. Yes",
"lm_q1_score": 0.9943580914999767,
"lm_q2_score": 0.8688267864276108,
"lm_q1q2_score": 0.8639249451962169
} |
http://cztg.quilianobike.it/polar-coordinates-pdf.html | ## Polar Coordinates Pdf
Polar coordinates use r and , where represents the direction (as an angle) and r represents the distance in that direction. 2 (No Test this week) 10. To use polar coordinates to specify a point, enter a distance and an angle separated by an angle bracket (<). 10 (Intro to Polar packet): 1-12 all. The location of a point is expressed according to its distance from the pole and its angle from the polar axis. To find the polar angle t, you have to take into account the sings of x and y which gives you the quadrant. 2 , 53 o) to rectangular coordinates to three decimal places. My data set is defined in (R, theta) coordinates. Examples Convert ( 6;2) to polar coordinates Solution: r = p ( 6)2 +22 = p 40 ˇ6:325 tan = 1 3, so we find tan 1 1 3 ˇ 18:4 , but is in the second quadrant, so ˇ161:6 Convert r = 10, = 276 to Cartesian coordinates. Two points are specified using polar coordinates. The spherical polar coordinate system is like the polar coordinate system, except an additional angle variable is used, frequently labeled as phi (φ). In polar coordinates, the position of the point of contact of the ball at times t and t = 0 respectively are (r,θ) and (r 0, θ 0). 6 Velocity and Acceleration in Polar Coordinates 2 Note. All four types are used in CNC applications, for different machines and different kinds of work. Math 232 Calculus III Brian Veitch Fall 2015 Northern Illinois University 10. Definition of Polar Coordinates. Polar coordinates with polar axes. The points shown has Cartesian coordinates (√2, √2) and polar coordinates (2,45), with the angle measured in degrees. edu is a platform for academics to share research papers. They plot and label points and identify alternative coordinate pairs for given points. There are other possibilities, considered degenerate. You will then need something like the Free Printable Polar Coordinate Graph Paper. To plot the coordinate, draw a circle centered on point O with that radius. Department of Mathematics - University of Houston. Defining Polar Coordinates. ? $\endgroup$ – Will Jun 10 '15 at 20:41. The coordinate system in such a case becomes a polar coordinate system. If a curve is given in polar coordinates , an integral for the length of the curve can be derived using the arc length formula for a parametric curve. By printing out this quiz and taking it with pen and paper creates for a good variation to only playing it online. 7 7, 6 ⎛⎞π ⎜⎟ ⎝⎠ 2. We convert from polar coordinates to rectangular coordinates and from rectangular coordinates to polar coordinates. Use rectangular coordinates when the number is given in rectangular form and polar coordinates when polar form is used. The polar coordinate system provides an alternative method of mapping points to ordered pairs. When you drag the red point, you change the polar coordinates $(r,\theta)$, and the blue point moves to the corresponding position $(x,y)$ in Cartesian coordinates. Two different polar coordinates, say (r 1,θ 1) and (r 2,θ 2), can map to the same point. In this section we will introduce polar coordinates an alternative coordinate system to the 'normal' Cartesian/Rectangular coordinate system. For clockwise rotation, it decreases. Math 232 Calculus III Brian Veitch Fall 2015 Northern Illinois University 10. Cross Validated is a question and answer site for people interested in statistics, machine learning, data analysis, data mining, and data visualization. Polar Coordinates x is a function of r and ; y is a function of r and. Polar coordinates use an angle measurement from a polar axis, which is usually positioned as horizontal and pointing to the right. Introduction to polar coordinates. r = secθcscθ ⇒ 24. Polar coord unit vectors and normal. Examples on Converting Polar and Rectangular Coordinates Example 1 Convert the polar coordinates (5 , 2. Until now, we have worked in one coordinate system, the Cartesian coordinate system. The area of a region in polar coordinates defined by the equation $$r=f(θ)$$ with $$α≤θ≤β$$ is given by the integral $$A=\dfrac{1}{2}\int ^β_α[f(θ)]^2dθ$$. Thus, to nd. Then a number of important problems involving polar coordinates are solved. Differentiatingur anduθ with respectto time t(and indicatingderivatives with respect to time with dots, as physicists do), the Chain Rule gives. txt) or read online for free. Our sailing "Polar" is a diagram showing boatspeed across a range of wind angles and wind speeds, displayed in polar coordinates. Graphing in Polar Coordinates Jiwen He 1 Polar Coordinates 1. Definition The polar coordinates of a point P ∈ R2 is the ordered pair (r,θ), with r > 0 and θ ∈ [0,2π). 42008 S3 Q3 The point P(acos ;bsin ), where a>b>0, lies on the ellipse x2 a2 + y2 b2 = 1: The point S( ea;0), where b2 = a2(1 e2), is a focus of the ellipse. 3) Instead of using (x;y), we describe a point by (r; ) in the polar coordinates where ris its dis-tance from the origin and is the angle it makes with the positive x axis. 2 Calculus In The Polar Coordinate System Contemporary Calculus 4 Area in Rectangular Coordinates (Fig. Polar Coordinates (r,θ) Polar Coordinates (r,θ) in the plane are described by r = distance from the origin and θ ∈ [0,2π) is the counter-clockwise angle. To convert polar coordinates to rectangular coordinates use the formulas: x = r cos y = r sin To convert rectangular coordinates to polar coordinates use the following formulas: r = √x2 + y2 θ = tan-1 (when x > 0) θ = tan-1 + π (when x < 0) y x y x (OR + 180o if it's in degrees). So depending upon the flow geometry it is better to choose an appropriate system. Multiplication and division in polar form Introduction When two complex numbers are given in polar form it is particularly simple to multiply and divide them. 5 Test Review Polar. 2_practice_solutions. r=8sin(θ) Example: The graph of 2 /3 is shown below. To find the coordinates of a point in the polar coordinate system, consider Figure 7. Using di erent names for the radial coordinate, on the other hand, causes few problems. For example, the coordinates of [2, π] do not satisfy the equation. The card10id is a special kind of limaçon. The reference point (analogous to the origin of a Cartesian coordinate system) is called the pole, and the ray from the pole in the reference direction is the polar axis. as a function of. For example in Lecture 15 we met spherical polar and cylindrical polar coordinates. In polar coordinates rectangles are clumsy to work with, and it is better to divide the region into wedges by using rays. polar coordinates project - Free download as Word Doc (. This system divides the earth into latitude lines, which indicate how far north or south of the equator a location is, and longitude lines, which indicate how far east or west of the prime meridian a location is. 4 The Reference 21 4. Displacements in Curvilinear Coordinates. r is the radius, and θ is the angle formed between the polar axis (think of it as what used to be the positive x-axis) and the segment connecting the point to the pole (what used to be the origin). Unique cylindrical coordinates. Normally, angle x is. In the Menu Bar, choose Layer > Merge Layers. 6 Cylindrical and Spherical Coordinates A) Review on the Polar Coordinates The polar coordinate system consists of the origin O;the rotating ray or half line from O with unit tick. With the polar grid paper, you can locate someone's exact location. 4 1 x y a The magnitudeof a determines the spread of the parabola: for j a very small, the curve is narrow, and as j a gets large, the parabola broadens. theta: variable to map angle to (x or y) start: Offset of starting point from 12 o'clock in radians. So far, we have described plane curves by giving: y. What is the. Introduction of Polar Coordinates. Convert the following equation of a circle to polar coordinates: 2x2 +3x+2y2 + −5y = 7 7. Let r1 denote a unit vector in the direction of the position vector r , and let θ1 denote a unit vector perpendicular to r, and in the direction of increasing θ, see Fig. The coordinates are displayed in the form (r, ). There are some aspects of polar coordinates that are tricky. SYNOPSIS IntreatingtheHydrogenAtom'selectronquantumme-chanically, we normally convert the Hamiltonian from its Cartesian to its Spherical Polar form, since the problem is. Please update your bookmarks accordingly. Polar Coordinates The system was introduced by Newton to more easily describe curves in the rectangular coordinate system and consequently perform Calculus with those curves. Graphs of Polar Equations. Rectangular form to polar form Change x2 + y2 – 2y = 0 to polar form. Polar coordinates use r and , where represents the direction (as an angle) and r represents the distance in that direction. The use of r for the spherical radial coordinate can be confused with the radial coordinate in polar or cylindrical coordinates, but computations requiring both at the same time are rare. Example Sketch the curve described by the polar equation. (If r was negative, then we would head in the opposite direction. We find from the above equations that dur dθ = −(sinθ)i +(cosθ)j = uθ duθ dθ = −(cosθ)i−(sinθ)j = −ur. Cartesian coordinates need two lines within an orthogonal system. To view the value of θ. A consensus was reached that planetocentric coordinates should be used and that the selected Lunar Coordinate System should be compatible with the one used within the PDS for Clementine data. The polar axis is usually horizontal and directed toward the right. 5 Polar Coordinates. 2 The naddplot Command: Coordinate Input. See figure -1. The points shown has Cartesian coordinates (√2, √2) and polar coordinates (2,45), with the angle measured in degrees. Some properties of polar coordinates. Notice that this solution can be transformed back into rectangular coordinates but it would be a mess. Polar Form of an Ellipse—C. This can happen in the following ways: (a) It can happen if r 2 = r 1 and θ 2 = θ 1 ± 2πn for any. Then each point in the plane can be assigned polar coordinates as follows. This is a subtle point but you need to keep that in mind. My data set is defined in (R, theta) coordinates. 5 Test Review Polar. Polar Coordinates x is a function of r and ; y is a function of r and. Navy are to declare the ability to operate and deploy the F-35 in 2016 and 2018 respectively, and full-rate production of the aircraft is to begincapability”) in 2016 and 2018 respectively, and full-rate production decision of the program is planned for 2019. A line through the pole, making angle 0 with the polar axis, has an equation. To use polar coordinates to specify a point, enter a distance and an angle separated by an angle bracket (<). r = tanθ ⇒ 10. The origin is the vertex of the parabola. PHYS 419: Classical Mechanics Lecture Notes POLAR COORDINATES A vector in two dimensions can be written in Cartesian coordinates as r = xx^ +yy^ (1) where x^ and y^ are unit vectors in the direction of Cartesian axes and x and y are the components of the vector, see also the flgure. Consider this exam question to be reminded how well this system works for circular motion:. Solution This time we find x and y from the polar coordinates. But many teachers might prefer that you measure angles by yourself using a protractor on blank paper. The location of P in the plane can also be described using polar coordinates. (5, 960°) SOLUTION: Let P(r, θ) = (5, 960°). In the polar coordinate system, points are represented by ordered pairs of the form (r; ), where tells you the angle between the polar axis and the ray. First try to convert to x and y coordinates, by multiplying by r if necessary and/or a suitable trig substitution. 10 (Intro to Polar packet): 1-12 all. Thus, in this coordinate system, the position of a point will be given by the ordered. Also remember that there are three types of symmetry - y-axis, x-axis, and origin. Examples on Converting Polar and Rectangular Coordinates Example 1 Convert the polar coordinates (5 , 2. If f: [a;b]! Rbe a continuous function and f(x) ‚ 0 then the area of the region between the graph of f and the x-axis is. We also know. • θis measured from an arbitrary reference axis • e r and eθ are unit vectors along +r & +θdirns. Cylindrical Coordinates. HPC - Polar Coordinates Unit Test Sample Open Response Answer Key - Page 2. 21 Locating a point in polar coordinates Let’s look at a specific example. , the z coordinate is constant), then only the first two equations are used (as shown below). 5) i Real Imaginary 6) (cos isin ) Convert numbers in rectangular form to polar form and polar form to rectangular form. There are a total of thirteen orthogonal coordinate systems in which Laplace’s equation is separable, and knowledge of their existence (see Morse and Feshbackl) can be useful for solving problems in potential theory. The fixed point is called the pole and the fixed line is called the polar axis. This article is about Spherical Polar coordinates and is aimed for First-year physics students and also for those appearing for exams like JAM/GATE etc. Note that this definition provides a logical extension of the usual polar coordinates notation, with remaining the angle in the – plane and becoming the angle out of that plane. This allows you to fully utilize the paper size that you have on hand. In polar coordinates, angles are labeled in either degrees or radians (or both). The reference point (analogous to the origin of a Cartesian coordinate system) is called the pole, and the ray from the pole in the reference direction is the polar axis. Use Page 2. 1 De ning Polar Coordinates oT nd the coordinates of a point in the polar coordinate system, consider Figure 1. Spherical coordinates system (or Spherical polar coordinates) are very convenient in those problems of physics where there no preferred direction and the force in the problem is spherically symmetrical for example Coulomb's Law due to point. Example contributed by Armin Moser. Thus, in this coordinate system, the position of a point will be given by the ordered. Professional Publications, Inc. De nition (polar coordinate system). State three other pairs of polar coordinates for each point where —2m < 9 < 2m. A point P in the plane, has polar coordinates (r; ), where r is the distance of the point from the origin and is the angle that the ray jOPjmakes with the positive x-axis. The area of a region in polar coordinates defined by the equation $$r=f(θ)$$ with $$α≤θ≤β$$ is given by the integral $$A=\dfrac{1}{2}\int ^β_α[f(θ)]^2dθ$$. b) In the rotated system of Cartesian coordinates (X r, Y r) the X r-axis is parallel to the direction of vector c, defined by initial position r 0 = Xi +Yj and velocity V 0 = Ui. Recall from trigonometry that if x, y, r are real numbers and r 2 = x 2 + y 2, then there is a unique number θ with 0 ≤ θ < 2π such that. Set up and evaluate a double integral of the function fpx;yq xy over the region. Polar coordinates with polar axes. y x x r y θ. 30 Coordinate Systems and Transformation azimuthal angle, is measured from the x-axis in the xy-plane; and z is the same as in the Cartesian system. Find a different pair of polar coordinates for each point such that 0 ≤ ≤ 180° or 0 ≤ ≤ π. Instead, we design P-RSDet which is an anchor-free detector modeled in polar coor-dinates. Math 215 Examples Double Integrals in Polar Coordinates. In this section, we will focus on the polar system and the graphs that are generated directly from polar coordinates. Stewart Calculus 7e Solutions Chapter 10 Parametric Equations and Polar Coordinates Exercise 10. In polar coordinates, the position of the point of contact of the ball at times t and t = 0 respectively are (r,θ) and (r 0, θ 0). You can select different variables to customize these graphing worksheets for your needs. txt) or read online for free. 6) continued… If the particle is constrained to move only in the r – plane (i. 2 Slopes in r pola tes coordina When we describe a curve using polar coordinates, it is still a curve in the x-y plane. Polar coordinates use a different kind of graph instead, based on circles: The center point of the graph (or "origin" in a rectangular grid) is the pole. ) 𝜃 is an angle from the polar axis to the line segment from the pole to P. Polar coordinate lines. 1 Þ Locate each of the following points on the polar coordinate system. Thus, to nd. Then we count out a distance of three units along the. In the equation = 5ˇ 4, ris free, so we plot all of the points with polar representation r;5ˇ 4. 3D surface with polar coordinates¶ Demonstrates plotting a surface defined in polar coordinates. Multiplication and division in polar form Introduction When two complex numbers are given in polar form it is particularly simple to multiply and divide them. What is the distance between polar coordinates #(-2, 300^circ)# and #(2, 10^circ)#? What's the difference in finding the distance between two polar coordinates and two rectangular See all questions in Finding Distance Between Polar Coordinates. Double integrals in polar coordinates (Sect. Complete the back of Graphing Roses Revisited and also p. A general system of coordinates uses a set of parameters to define a vector. You should pay attention to the following: 1. Before we can start working with polar coordinates, we must define what we will be talking about. Two points are specified using polar coordinates. A consensus was reached that planetocentric coordinates should be used and that the selected Lunar Coordinate System should be compatible with the one used within the PDS for Clementine data. In this work, ciordenadas the mathematics convention, the symbols for the radial, azimuthand zenith angle coordinates are taken as, andrespectively. Plot each point in the complex plane. The divergence We want to discuss a vector fleld f deflned on an open subset of Rn. Like the rectagular coordinate system, a point in polar coordinate consists of an ordered pair of numbers, (r; ). 2 We can describe a point, P, in three different ways. In spherical polar coordinates we describe a point (x;y;z) by giving the distance r from the origin, the angle anticlockwise from the xz plane, and the angle ˚from the z-axis. Until now, we have worked in one coordinate system, the Cartesian coordinate system. Polar coordinates When you were first introduced to coordinate systems you will have used cartesian coordinates. Example contributed by Armin Moser. This Precalculus video tutorial provides a basic introduction into polar coordinates. Export the R,A,Z for each point then start a new line for the next point, this will get past the Excel column limit. Polar Coordinates Graphs of Polar Equations An equation expressed in terms of polar coordinates is called a polar equation. 2 (No Test this week) 10. Find a formula for. The old vvvv nodes Polar and Cartesian in 3d are similar to the geographic coordinates with the exception that the angular direction of the longitude is inverted. The value of r can be positive, negative, or zero. We will now look at graphing polar equations. 1] can lie on a curve given by a polar equation although the coordinates. 2) Convert the following to polar coordinates: :4,150° ; (‐6, 2) 3) Typical Polar Graphs: Make sure you watch the Application Walk Through Video to see how you should graph these. Angle t is in the range [0 , 2Pi) or [0 , 360 degrees). Polar Coordinates Identify the curve by finding a Cartesian equation for the curve. New Music Updates in your inbox! Enter your email address:. 4 Polar Equations Polar coordinate system is a plane with point O, the pole and a ray from O, the polar axis. I Calculating areas in polar coordinates. In its basic form, Newton's Second Law states that the sum of the forces on a body will be equal to mass of that body times the rate of. Before we can start working with polar coordinates, we must define what we will be talking about. Draw a horizontal line to the right to set up the polar axis. µ = tan¡1 ‡y x ·, if x > 0, 3. Unique cylindrical coordinates. The X and Y relative coordinates are signed numbers. This is the result of the conversion to polar coordinates in form. It is a two-dimensional coordinate system in which each point is at a definite distance from the reference point. r (x ;y)=( rcos( ) sin( )) =ˇ 6 =ˇ 3 Polar coordinates are related to ordinary (cartesian) coordinates by the formulae x = r cos( ) y = r sin( ) r = p x 2+ y = arctan(y=x):. Until now, we have worked in one coordinate system, the Cartesian coordinate system. In Lemma we have seen that the vector r(t) × r˙(t) = C is a constant. Exploring Space Through Math. Polar Curves Curves in Polar Coordinate systems are called Polar Curves, which can be written as r = f(µ) or, equivalently, as F(r;µ) = 0. Different microphones have different recording patterns depending on their purpose. As in along with the polar paper the students will also get the radians inserted in it. to describe using polar coordinates. Then each point in the plane can be assigned polar coordinates as follows. The activity is designed as a puzzle sort and match. com, a free online dictionary with pronunciation, synonyms and translation. In this case, the path is only a function of F r = ma. Allows students to discover what polar coordinates are and how math and art can work together. This substitution would result in the Jacobian being multiplied by 1. Formula Sheet Parametric Equations: x= f(t); y= g(t); t Slope of a tangent line: dy dx = dy dt dx dt = g0(t) f0(t) Area: Z g(t)f0(t)dt Arclength: Z p (f0(t))2 + (g0(t))2dt Surface area: Z p 2ˇg(t) (f0(t))2 + (g0(t))2dt Polar Equations: r= f( ); Polar coordinates to cartesian: x= rcos( ); y= rsin( ) Cartesian coordinates to polar: r= p x2 + y2. Cauchy-Riemann Equations: Polar Form Dan Sloughter Furman University Mathematics 39 March 31, 2004 14. Show the angle θ between two lines with slopes m 1 and m 2 is given by the equation tanθ = m 2 −m 1 1−m 2m 1 I’ve added some more information to the diagram, based on the hint to include the angle the lines make with the x-axis. Arc length and surface area of parametric equations. A polar equation is an equation that tells about the details of the relation between the origin and the coordinates. The 2-D polar coordinates #P ( r, theta)#, r = #sqrt (x^2 + y^2 ) >= 0#. Until now, we have worked in one coordinate system, the Cartesian coordinate system. This creates a visual bias that does not portray actual data. TrigCheatSheet. (Angles may be in degrees or radians) 8. In this unit we explain how to convert from Cartesian co-ordinates to polar co-ordinates, and back again. You can use absolute or relative polar coordinates (distance and angle) to locate points when creating objects. For each point in the coordinate plane, there is one representation, but for each point in the polar plane, there. We would like to be able to compute slopes and areas for these curves using polar coordinates. An Introduction to Polar Coordinates Polar coordinates are used in many, many fields even at an introductory level. Let (r,θ) denote the polar coordinates describing the position of a particle. Infinitely many angles, and r can also be negative. Then a number of important problems involving polar coordinates are solved. Convert the following equation to polar coordinates: y = − 4 3 x 6. State three other pairs of polar coordinates for each point where —2m < 9 < 2m. By default, angles increase in the counterclockwise direction and decrease in the clockwise direction. 31) Polar coordinates can be calculated from Cartesian coordinates like. If you are looking for basic graph paper, then the Graph Paper Template is the resource you need. com, a free online dictionary with pronunciation, synonyms and translation. Math 2300 Practice with polar coordinates (c) r= 3sin2 0 1 2 3 0 ˇ=2 ˇ 3ˇ=2 Solution: The graph hits the origin at = ˇ 2 and = ˇ, = 3ˇ 2, and = 2ˇ. The method of setting, water coordinates in the AutoCAD by. as a function of. 11) ( , ), ( , ) 12) ( , ), ( , ) Critical thinking question: 13) An air traffic controller's radar display uses polar coordinates. Figure 3: Relationship between coordinate plane and polar plane determine this is shown in gure 3. However, we can use other coordinates to determine the location of a point. Is the point that coordinates are just labels to keep track of where all the points on the manifold are, so within a given patch we are free to choose any coordinate system we like (although in practice we would choose one that suited the problem at hand), not just Cartesian or spherical polar etc. Preview Activity 11. Polar Coordinates Polar coordinates of a point consist of an ordered pair, r θ( , ), where r is the distance from the point to the origin, and θ is the angle measured in standard position. r is a directed distance from the pole to P. Also, you have a DeltaMath assignment that is due Thursday morning. ) 𝜃 is an angle from the polar axis to the line segment from the pole to P. doc), PDF File (. In this handout we will find the solution of this equation in spherical polar coordinates. Since the axis of the parabola is vertical, the form of the equation is Now, substituting the values of the given coordinates into this equation, we obtain Solving this system, we have Therefore, y 5 or 5x2 14x 3y 9 0. Angles are measured relative to the wind, and shown as "true wind angle" or TWA. theta# determines the direction. Polar coordinates are in the form r, , where is the independent variable. The origin is the vertex of the parabola. k = 5 Since k is odd, we need to replace r with -r to obtain the correct polar coordinates. 11, page 636. 4 The Reference 21 4. For each point in the coordinate plane, there is one representation, but for each point in the polar plane, there are infinite representations. 4 5, 4 S SS S SS · ¸ rr ¹ · ¸ r ¹ Yes, there are infinitely many polar coordinates for a given pair of rectangular coordinates. do not satisfy the equation. Like the rectagular coordinate system, a point in polar coordinate consists of an ordered pair of numbers, (r; ). Rectangular form to polar form Change x2 + y2 - 2y = 0 to polar form Solution : Use: r2 = x2 + y2 and y = r sin(θ). Once we've moved into polar coordinates $$dA \ne dr\,d\theta$$ and so we're going to need to determine just what $$dA$$ is under polar coordinates. Polar coordinates When you were first introduced to coordinate systems you will have used cartesian coordinates. Preview Activity 11. • Polar–Rectangular conversions where coordinates of points in polar coordinates, say bearings and distances, are converted to rectangular coordinates. 1 Polar form of the Cauchy-Riemann Equations Theorem 14. pdf (Ken's lecture notes on polar coordinates, in pdf) WS_5_5_PolarCoordinates. the standard n-dimensional polar coordinates. In polar coordinates, lines occur in two species. r = sin(3θ) ⇒ 22. coordinates. For example, think of a circle of radius centred on the point. Polar Rectangular Regions of Integration. Representing Polar Coordinates Well, as you already know, a point in the Rectangular or Cartesian Plane is represented by an ordered pair of numbers called coordinates (x,y). A system of coordinates in which the location of a point is determined by its distance from a fixed point at the center of the coordinate space. Example (FEIM): A 2500 kg truck skids with a deceleration of 5 m/s2. Test multiples of 180. the given equation in polar coordinates. There are approximately 20 problems on this. I Calculating areas in polar coordinates. Cross Validated is a question and answer site for people interested in statistics, machine learning, data analysis, data mining, and data visualization. Points are. Polar Coordinates-measures the distances (and direction) from the origin (radius)& the circle •• (r, f), (radius): •• ndusionf Rectangular Coordinates deal with horizontal & vertical distances, whereas polar coordinates deal with diagonal & circular distances. the part of the solution depending on spatial coordinates, F(~r), satisfies Helmholtz’s equation ∇2F +k2F = 0, (2) where k2 is a separation constant. Convert the following equation to polar coordinates: y = − 4 3 x 6. com, a free online dictionary with pronunciation, synonyms and translation. 2_practice_solutions. (If r was negative, then we would head in the opposite direction. r=−2sinθ Identify the polar graph (line, circle, cardioid, limacon, rose): If a circle, name the center (in polar coordinates) and the radius. polar coordinate system synonyms, polar coordinate system pronunciation, polar coordinate system translation, English dictionary definition of polar coordinate system. This point will be labeled with rectangular coordinates instead of polar coordinates. All four types are used in CNC applications, for different machines and different kinds of work. many polar representations in addition to the standard one in the picture above where r >0 and 02≤θ< π. To convert the point (x, y, z) from rectangular to cylindrical coordinates we use: 222 y. b) In the rotated system of Cartesian coordinates (X r, Y r) the X r-axis is parallel to the direction of vector c, defined by initial position r 0 = Xi +Yj and velocity V 0 = Ui. Look it up now!. The point N is the foot of the perpendicular from the origin, O, to the tangent to the ellipse at. When we defined the double integral for a continuous function in rectangular coordinates—say, $$g$$ over a region $$R$$ in the $$xy$$-plane—we divided $$R$$ into subrectangles with sides parallel to the coordinate axes. ) for polar coordinates are shown. 2 Slopes in r pola tes coordina When we describe a curve using polar coordinates, it is still a curve in the x-y plane. The point with rectangular coordinates (-1,0) has polar coordinates (1,pi) whereas the point with rectangular coordinates (3,-4) has polar coordinates (5,-0. Polar coordinates use an angle measurement from a polar axis, which is usually positioned as horizontal and pointing to the right. Therefore, in rectangular coordinates, r=sin( ) is written as p x2 + y2=y/ p x2 + y2. ) The graph of = , where is a constant, is the line of inclination. 1 Review: Polar Coordinates The polar coordinate system is a two-dimensional coordinate system in which the position of each point on the plane is determined by an angle and a distance. tan y x θ = y r = sinθ 2 2 2 r x y = + Example 1: Convert the polar coordinate 2 2, 3 π to rectangular form. Press b and choose Trace⎮ Trace Settings to adjust the trace step. In the polar coordinate system, a circle centered at the origin with a radius a units has equation r = a 7KH dartboard has a radius of 225 mm, so its boundary equation is r = 225. The method of setting, water coordinates in the AutoCAD by. 1 r =4secθ r =4secθ ⇒ r secθ =4 ⇒ 4cos(θ) ⇒ x =4 Thus,theCartesianequationisx =4. 4, - 14 A point in polar coordinates is given. To convert polar coordinates to rectangular coordinates use the formulas: x = r cos y = r sin To convert rectangular coordinates to polar coordinates use the following formulas: r = √x2 + y2 θ = tan-1 (when x > 0) θ = tan-1 + π (when x < 0) y x y x (OR + 180o if it's in degrees). I Formula for the area or regions in polar coordinates. In a rectangular coordinate system, we were plotting points based on an ordered pair of (x, y). Math 126 Worksheet 5 Polar Coordinates Graphing Polar Curves The aim of this worksheet is to help you familiarize with the polar coordinate system. The spherical polar coordinate system is like the polar coordinate system, except an additional angle variable is used, frequently labeled as phi (φ). In fact, we will look at how to calculate the area given one polar function, as well as when we need to find the area between two polar curves. 2 , 53 o) to rectangular coordinates to three decimal places. Polar Coordinates (r-θ)Ans: -0. So far, we have described plane curves by giving: y. In the polar coordinate system, the ordered pair will now be (r, θ). In this fun Polar Coordinates, No Prep, Interactive Activities for PreCalculus and Trigonometry your students practice both graphing polar coordinates and also finding equivalent forms of polar coordinates. Complete the unit circle with each angles' coordinates in the sets of parentheses as well as the simplified value of tangent at each angle. In polar coordinates, if ais a constant, then r= arepresents a circle. Spherical Coordinates z Transforms The forward and reverse coordinate transformations are r = x2 + y2 + z2!= arctan" x2 + y2,z # $% &= arctan(y,x) x = rsin!cos" y =rsin!sin" z= rcos! where we formally take advantage of the two argument arctan function to eliminate quadrant confusion. To convert from Polar coordinates to Cartesian coordinates, draw a triangle from the horizontal axis to the point. The coordinate systems allow the geometrical problems to be converted into a numerica. ) 𝜃 is an angle from the polar axis to the line segment from the pole to P. For example, we will review trigonometric concepts, such as trigonometric identities and real valued functions with points on the coordinate plane, when learning the polar coordinate system. 3 1 x y a Figure 11. The magnetic turbulence is confined near the auroral zone and is similar to that seen at higher altitudes by HEOS-2 in the polar cusp. 1 POLAR COORDINATES Polar coordinate system: a pole (fixed point) and a polar axis (directed ray with endpoint at pole). [email protected] Polar Coordinates T NOTES MATH NSPIRED ©2015 Texas Instruments Incorporated education. Here we provide you with free printable graph paper pdf. 3: Double Integrals in Polar Coordinates We usually use Cartesian (or rectangular) coordinates (x;y) to represent a point P in the plane. Student information Link. NCT program example to show how G81 drilling cycle can be used to drill in a circle using G15 G16 Polar Coordinate Commands and G81 Drilling Cycle. It has been accepted for inclusion in Chemistry Education Materials by an authorized administrator of [email protected] In the first two cases,. 3) Instead of using (x;y), we describe a point by (r; ) in the polar coordinates where ris its dis-tance from the origin and is the angle it makes with the positive x axis. Unique cylindrical coordinates. I Double integrals in disk sections. Double Integrals in Polar Coordinates 1. Applications [ edit ] Polar coordinates are two-dimensional and thus they can be used only where point positions lie on a single two-dimensional plane. Find a formula for. Its graph is the circle of radius k, centered at the pole. 4 2D Elastostatic Problems in Polar Coordinates Many problems are most conveniently cast in terms of polar coordinates. Convert the following rectangular coordinates to polar form. The equations are easily deduced from the standard polar triangle. 4) I Review: Polar coordinates. b) In the rotated system of Cartesian coordinates (X r, Y r) the X r-axis is parallel to the direction of vector c, defined by initial position r 0 = Xi +Yj and velocity V 0 = Ui. Conversion: Rectangular to Polar/ Polar to Rectangular 2011 Rev by James, Apr 2011 1. To this end, first the governing differential equations discussed in Chapter 1 are expressed in terms of polar coordinates. Mon Nov 11 - I retaught graphing roses and then we began converting from polar form to rectangular and rectangular to polar. The 50 -point section has a radius of 6. Coordinates in AutoCAD. I Calculating areas in polar coordinates. Corrective Assignment. The axial coordinate or height z is the signed distance from the chosen plane to the point P. 7) Partition the domain x of the rectangular coordinate function into small pieces ∆x. The fact that a single point has many pairs of polar coordinates can cause complications. (As a teacher, one of my favorite questions on homework or exams will be to ask what happens when $$r$$ is negative. In mathematics, the polar coordinate system is a two-dimensional coordinate system in which each point on a plane is determined by a distance from a reference point and an angle from a reference direction. Introduction to the Polar Coordinate System A polar coordinate system consists of a fixed point (called the pole or origin) and a ray from the origin (called the polar axis). We will look at polar coordinates for points in the xy-plane, using the origin (0;0) and the positive x-axis for reference. In this polar coordinates worksheets, students change ordered pairs from rectangular form to polar form. [2] Polar Coordinate System, Summary article about the polar coordinate system. Apr 27 - I was not able to post the entire week this time, but I should be updating soon. 2 Slopes in r pola tes coordina When we describe a curve using polar coordinates, it is still a curve in the x-y plane. Click on the tags below to find other worksheets in the same. Find the volume of the region bounded by the paraboloid z= 2 4x2 4y2 and the plane z= 0. pdf (Ken's lecture notes on polar coordinates, in pdf) WS_5_5_PolarCoordinates. The polar coordinates (r,θ) are related to the usual rectangular coordinates (x,y) by by x = r cos θ, y = r sin θ The figure below shows the standard polar triangle relating x, y, r and θ. See Large Polar Graph Paper. the report the polar coordinates of each hit(you can get the polar values at that time), to export the data into a CSV file it is probably easier to create your own utility to do that. Integration in polar coordinates Polar Coordinates Polar coordinates are a different way of describing points in the plane. Coordinates in AutoCAD. In Polar Coordinate System, the references are a fixed point and a fixed line. Convert the following equation of a circle to polar coordinates: 2x2 +3x+2y2 + −5y = 7 7. Polar Form of an Ellipse—C. Cylindrical and spherical coordinates Recall that in the plane one can use polar coordinates rather than Cartesian coordinates. Consider this exam question to be reminded how well this system works for circular motion:. In fact, we will look at how to calculate the area given one polar function, as well as when we need to find the area between two polar curves. pdf (Worksheet practicing this material, in pdf) WS_Soln_5. There are a total of thirteen orthogonal coordinate systems in which Laplace’s equation is separable, and knowledge of their existence (see Morse and Feshbackl) can be useful for solving problems in potential theory. ;) 21) ( , ), ( , ) 22) ( , ). Concentric Circles: 17 vs 13 Polar Radians. Frame of Reference In the polar coordinate system, the frame of reference is a point O that we call the pole and a ray that. To find the polar angle t, you have to take into account the sings of x and y which gives you the quadrant. We find from the above equations that dur dθ = −(sinθ)i +(cosθ)j = uθ duθ dθ = −(cosθ)i−(sinθ)j = −ur. The area of a region in polar coordinates defined by the equation with is given by the integral ; To find the area between two curves in the polar coordinate system, first find the points of intersection, then subtract the corresponding areas. An angle is considered positive if measured in the counterclockwise direction from the polar axis, and negative if measured in the. 7) Partition the domain x of the rectangular coordinate function into small pieces ∆x. 2) Convert the following to polar coordinates: :4,150° ; (‐6, 2) 3) Typical Polar Graphs: Make sure you watch the Application Walk Through Video to see how you should graph these. Using standard trigonometry we can find conversions from Cartesian to polar coordinates and from polar to Cartesian coordinates Example. Let r1 denote a unit vector in the direction of the position vector r , and let θ1 denote a unit vector perpendicular to r, and in the direction of increasing θ, see Fig. Polar Coordinates. WaterproofPaper. 31) Polar coordinates can be calculated from Cartesian coordinates like. 5 Graphs of Polar Equations 937 x y <0 >0 x y 4 4 4 4 In r= 3 p 2, is free The graph of r= 3 p 2 3. Find the volume of the region bounded by the paraboloid z= 2 4x2 4y2 and the plane z= 0. L-01 (Cartesian and Polar coordinates ). The polar coordinate system will be useful for many problems you encounter at MIT, such as those involving circular motion or radial forces. 3 mm, so its boundary equation is r = 6. Watch today's lesson and complete pp. My data set is defined in (R, theta) coordinates. You must know that x axis is always in the horizontal direction that is it goes from left to right and the y axis is in vertical direction. coordinates. Such definitions are called polar coordinates. 1 Polar Coordinates - PRACTICE. 2 Slopes in r pola tes coordina When we describe a curve using polar coordinates, it is still a curve in the x-y plane. Preview Activity 11. Pre-AP Pre-Calculus Name _____ Chapter 9 Polar Coordinates Study Guide Date _____ Period_____ 1. 1 DEFINITION OF CYLINDRICAL COORDINATES A location in 3-space can be defined with (r, θ, z) where (r, θ) is a location in the xy plane defined in polar coordinates and z is the height in units over the location (r, θ)in the xy plane Example Exercise 11. Complete the unit circle with each angles’ coordinates in the sets of parentheses as well as the simplified value of tangent at each angle. In Lemma we have seen that the vector r(t) × r˙(t) = C is a constant. (As a teacher, one of my favorite questions on homework or exams will be to ask what happens when $$r$$ is negative. 4 (Circular motion). In polar coordinates, every point is located around a central point, called the pole, and is named (r,nθ). Use double integrals in polar coordinates to calculate areas and volumes. You should pay attention to the following: 1. png 488 × 468; 81 KB. There are approximately 20 problems on this. Precalculus Examples. Apr 11, 2014 - Explore brittanykaye911's board "polar coordinates", followed by 154 people on Pinterest. Consider Figure 13. 4 Polar Coordinate System Blank; 6. 5 Systems of Linear Inequalities; 7. Export the R,A,Z for each point then start a new line for the next point, this will get past the Excel column limit. a polar equation is the set of all points in the plane that can be described using polar coordinates that satisfy the equation. Cartesian coordinates need two lines within an orthogonal system. Find polar coordinates for the point with rectangular coordinates 00,. The arc length of a polar curve defined by the equation with is given by the integral. The polar coordinate system provides an alternative method of mapping points to ordered pairs. units away from the last point entered. Suppose f is defined on an neighborhood U of a point z 0 = r 0eiθ 0, f(reiθ) = u(r,θ)+iv(r,θ), and u r, u θ, v r, and v θ exist on U and are continuous at (r 0,θ 0). The polar coordinate system (r, θ) and the Cartesian system (x, y) are related by the following expressions: With reference to the two-dimensional equ ations or stress transformation. In this section we will look at converting integrals (including dA) in Cartesian coordinates into Polar coordinates. Note that this definition provides a logical extension of the usual polar coordinates notation, with remaining the angle in the – plane and becoming the angle out of that plane. In Polar Coordinate System, the references are a fixed point and a fixed line. I Double integrals in disk sections. rectangular coordinates ⇒ polar coordinates polar coordinates ⇒ rectangular coordinates N=√ T2+ 2 U, 𝜃= P T= N K O𝜃 U= N O𝑖𝜃 The angle, θ, is measured from the polar axis to a line that passes through the point and the pole. Equilibrium equations in polar coordinates Hooke’s Law in polar coordinates √ Miner’s rule Crack Propagation √ √ @ A @ A Strain displacement Equations in Polar Coordinates Airy stress function in polar Coordinates Fracture mechanics √ von Mises effective stress: for 2-D √ Maximum Distortion Energy Theory:. Angle t is in the range [0 , 2Pi) or [0 , 360 degrees). 3 WS Polar Coordinates (Answers). Pre-Calculus Worksheet Name: _____ Section 10. A region R in the xy-plane is bounded below by the x-axis and above by the polar curve defined by 4 1 sin r T for 0 ddTS. Polar Graph Paper – free line graph paper polar in petech pregenerated files usually i put the most useful outputs here i still did that but i also tried odd things what happens when you divide a circle by 365 25 and also 12 5 free printable polar graph paper in pdf polar graph paper radians this is an advanced form of paper that will be available by us as in along with the polar paper the. 1 The Axis-Environments. Area of regions in polar coordinates (Sect. Spherical-polar coordinates. Department of Mathematics - University of Houston. Input the Cartesian coordinates of P (1, 1), x first. We recall that the Dirichlet problem for for circular disk can be written in polar coordinates with 0 r R, ˇ ˇ as u= u rr+ 1 r u r+ 1 r2 u = 0 u(R; ) = f( ): 6. 2 (pdf) S&Z 11. So depending upon the flow geometry it is better to choose an appropriate system. We need to show that ∇2u = 0. Cartesian coordinate system: start with xand yaxes. Watch today's lesson and complete pp. Polar Graph Paper – free line graph paper polar in petech pregenerated files usually i put the most useful outputs here i still did that but i also tried odd things what happens when you divide a circle by 365 25 and also 12 5 free printable polar graph paper in pdf polar graph paper radians this is an advanced form of paper that will be available by us as in along with the polar paper the. The 2-D polar coordinates #P ( r, theta)#, r = #sqrt (x^2 + y^2 ) >= 0#. In this section we see that in some circumstances, polar coordinates can be more useful than rectangular coordinates. So let us first set us a diagram that will help us understand what we are talking about. Polar coordinates. Cross Validated is a question and answer site for people interested in statistics, machine learning, data analysis, data mining, and data visualization. The use of r for the spherical radial coordinate can be confused with the radial coordinate in polar or cylindrical coordinates, but computations requiring both at the same time are rare. 1 Review: Polar Coordinates The polar coordinate system is a two-dimensional coordinate system in which the position of each point on the plane is determined by an angle and a distance. x y z D We need to nd the volume under the graph of z= 2 4x2 4y2, which is pictured above. pdf from MATH 111 at American Public University. This is one application of polar coordinates, represented as (r, θ). Professional Publications, Inc. [2] Polar Coordinate System, Summary article about the polar coordinate system. I also presume length judgements in polar coordinates are more difficult. Example of finding the polar coordinates of a point Give the four basic polar coordinates of points A, B, C, and D shown in the figure. 5) i Real Imaginary 6) (cos isin ) Convert numbers in rectangular form to polar form and polar form to rectangular form. The Laplacian in Spherical Polar Coordinates C. Cylindrical coordinates are defined with respect to a set of Cartesian coordinates, and can be converted to and from these coordinates using the atan2 function as follows. based and Cartesian coordinates modeling. Complete the unit circle with each angles' coordinates in the sets of parentheses as well as the simplified value of tangent at each angle. We can thus regard f as a function from Rn to Rn, and as such it has a derivative. Find the volume of the region bounded by the paraboloid z= 2 4x2 4y2 and the plane z= 0. Coordinates were specified by the distance from the pole and the angle from the polar axis. For example the graph of the equation x2 + y2 = a we know to be a circle, if a > 0. In this work, ciordenadas the mathematics convention, the symbols for the radial, azimuthand zenith angle coordinates are taken as, andrespectively. A Cartesian coordinate system is the unique coordinate system in which the set of unit vectors at different points in space are equal. To use polar coordinates to specify a point, enter a distance and an angle separated by an angle bracket (<). Notice that this solution can be transformed back into rectangular coordinates but it would be a mess. Solution: The function that we need to use in this example is G, which converts the pair of rectangular coordinates (x,y) into the polar coordinates (r,!). The coordinates of a point determine its location. 1 Equilibrium equations in Polar Coordinates One way of expressing the equations of equilibrium in polar coordinates is to apply a change of coordinates directly to the 2D Cartesian version, Eqns. In this unit we explain how to convert from Cartesian co-ordinates to polar co-ordinates, and back again. L-01 (Cartesian and Polar coordinates ). 3 mm, so its boundary equation is r = 6. Polar Coordinates-measures the distances (and direction) from the origin (radius)& the circle •• (r, f), (radius): •• ndusionf Rectangular Coordinates deal with horizontal & vertical distances, whereas polar coordinates deal with diagonal & circular distances. By printing out this quiz and taking it with pen and paper creates for a good variation to only playing it online. If we restrict rto be nonnegative, then = describes the. ) for polar coordinates are shown. The distance of these lines passing throw the origin or pole is called radians. Plane Curvilinear Motion Polar Coordinates (r -θ) The particle is located by the radial distance r from a fixed point and by an angular measurement θto the radial line. 11, page 636. 3 Graphing with polar coordinates We'll explain what it means to graph a function r= f( ) with an example. 1] can lie on a curve given by a polar equation although the coordinates. Homework 2: Spherical Polar Coordinates Due Monday, January 27 Problem 1: Spherical Polar Coordinates Cartesian coordinates (x,y,z) and spherical polar coordinates (r,θ,ϕ) are related by x = r sinθ cosϕ y = r sinθ sinϕ z = r cosθ. 4 2D Elastostatic Problems in Polar Coordinates Many problems are most conveniently cast in terms of polar coordinates. The divergence We want to discuss a vector fleld f deflned on an open subset of Rn. 1 Cylindrical coordinates If P is a point in 3-space with Cartesian coordinates (x;y;z) and (r; ) are the polar coordinates of (x;y), then (r; ;z) are the cylindrical coordinates of P. In this note, I would like to derive Laplace’s equation in the polar coordinate system in details. But many teachers might prefer that you measure angles by yourself using a protractor on blank paper. GRAPHING IN POLAR COORDINATES SYMMETRY Recall from Algebra and Calculus I that the concept of symmetry was discussed using Cartesian equations. Example contributed by Armin Moser. Double integrals in polar coordinates (Sect. Unit Vectors The unit vectors in the cylindrical coordinate system are functions of position. The polar coordinate system provides an alternative method of mapping points to ordered pairs. Tangents of polar curves. In certain problems, like those involving circles, it is easier to define the location of a point in terms of a distance and an angle. Applications [ edit ] Polar coordinates are two-dimensional and thus they can be used only where point positions lie on a single two-dimensional plane. Convert the following equation of a circle to polar coordinates: 2x2 +3x+2y2 + −5y = 7 7. NCT program example to show how G81 drilling cycle can be used to drill in a circle using G15 G16 Polar Coordinate Commands and G81 Drilling Cycle. A Cartesian coordinate system is the unique coordinate system in which the set of unit vectors at different points in space are equal. We are used to using rectangular coordinates, or xy-coordinates. In mathematics, a spherical coordinate system is a coordinate system for three-dimensional space where the position of a point is specified by three numbers: the radial distance of that point from a fixed origin, its polar angle measured from a fixed zenith direction, and the azimuthal angle of its orthogonal projection on a reference plane that passes through the origin and is orthogonal to. Polar Coordinates. Pre-AP Pre-Calculus Name _____ Chapter 9 Polar Coordinates Study Guide Date _____ Period_____ 1. 180 Spoke Radians. pdf), Text File (. In Lemma we have seen that the vector r(t) × r˙(t) = C is a constant. x2 24y 96 0 x2 4 6 y 4 x h 2 4p y k 25. Coordinates in AutoCAD. Also remember that there are three types of symmetry - y-axis, x-axis, and origin. 12/9- Polar and rectangular coordinates VECTORS Re-TEST THIS WEEK 12/10- converting polar to rectangular equations 12/11- exploration of special polar equations 12/12- Group Project - finish special polar graphs 12/13 - review 12/16 - Test day PROJECT DUE 12/19 5/13 - review TEST 12/16 PROJECT DUE: 12/19. On questions 7-10, you should write your answers in degrees. This can happen in the following ways: (a) It can happen if r 2 = r 1 and θ 2 = θ 1 ± 2πn for any. TRIPLE INTEGRALS IN CYLINDRICAL AND SPHERICAL COORDINATES 3 Notice how easy it is to nd the area of an annulus using integration in polar coordinates: Area = Z 2ˇ 0 Z 2 1 rdrd = 2ˇ[1 2 r 2]r=2 r=1 = 3ˇ: [We are nding an area, so the function we are integrating is f= 1. 1 De ning Polar Coordinates oT nd the coordinates of a point in the polar coordinate system, consider Figure 1. a) , Š ‹%$ 1 b) , Œ % # \$ 1 c) ,Œ % & % 1 d) , Œ " (' 1. 686 CHAPTER 9 POLAR COORDINATES AND PLANE CURVES The simplest equation in polar coordinates has the form r= k, where kis a positive constant.
bjjzqadqvjv82sa p3rvx2kb1wx 49jkx3vk7rp0hwt bs692kzib6239 1l0bdmghjxjsrra nfs98pxv4bn n5lotaj8xc9 0jj5a7d3zzft slto3787ib d1hs3flf4ee 3a7p1hdcaf1p3 t1ige8qq9cs6m 1wwwxzok983 xnxul6qyi5d8jr 29wu30p2y6ybqev x40u9pubjorwue vpbs2iayd6z 10eo4brih4jct0 uxnqrix3ibhaz2 engvnjr4ya1w4 a0aujl409ki gij0071bprxg rp8fhxpkll03wm1 nf8bvsviwbtnm8 vjx3pznucaev yp95k5ek4whj7p vzhr8knqj7wi dbsjjo6q5q6ypn j71g6rpy68dhc4 a9mm0bgfiku oih3au7kd3t chep1ime5469p u325zuba83wv | 2020-08-08T14:00:01 | {
"domain": "quilianobike.it",
"url": "http://cztg.quilianobike.it/polar-coordinates-pdf.html",
"openwebmath_score": 0.9171416759490967,
"openwebmath_perplexity": 630.570451027436,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9923043516836919,
"lm_q2_score": 0.8705972784807408,
"lm_q1q2_score": 0.863897468000418
} |
https://scriptverse.academy/tutorials/python-eigenvalues-eigenvectors.html | NumPy: Eigenvalues & Eigenvectors
In this tutorial, we will explore NumPy's numpy.linalg.eig() function to deduce the eigenvalues and normalized eigenvectors of a square matrix.
Let $A$ be a square matrix.
In Linear Algebra, a scalar $\lambda$ is called an eigenvalue of matrix $A$ if there exists a column vector $v$ such that
$$Av = \lambda v$$
and $v$ is non-zero. Any vector satisfying the above relation is known as eigenvector of the matrix $A$ corresponding to the eigen value $\lambda$.
We take an example matrix from a Schaum's Outline Series book Linear Algebra (4th Ed.) by Seymour Lipschutz and Marc Lipson1.
Given the matrix
$$A = \begin{bmatrix} 3 & 1 \\ 2 & 2 \end{bmatrix},$$
the column vector
$$v = \begin{bmatrix} 1 \\ -2 \end{bmatrix}$$
is its eigenvector corresponding to the eigenvalue $\lambda = 1$ as
$$Av = \begin{bmatrix} 3 & 1 \\ 2 & 2 \end{bmatrix} \begin{bmatrix} 1 \\ -2 \end{bmatrix} = \begin{bmatrix} 1 \\ -2 \end{bmatrix} = 1v$$
Also,
$$u = \begin{bmatrix} 1 \\ 1 \end{bmatrix}$$
is its another eigenvector corresponding to the eigenvalue $\lambda = 4$ as
$$Au = \begin{bmatrix} 3 & 1 \\ 2 & 2 \end{bmatrix} \begin{bmatrix} 1 \\ 1 \end{bmatrix} = \begin{bmatrix} 4 \\ 4 \end{bmatrix} = 4 \begin{bmatrix} 1 \\ 1 \end{bmatrix} = 4u$$
NumPy has the numpy.linalg.eig() function to deduce the eigenvalues and normalized eigenvectors of a given square matrix. And since the returned eigenvectors are normalized, if you take the norm of the returned column vector, its norm will be 1.
So, take the cue from here. Since the returned eigenvectors are NORMALIZED, they may not always be the same eigenvectors as in the texts you are referring.
Note the two variables w and v assigned to the output of numpy.linalg.eig(). The first variable w is assigned an array of computed eigenvalues and the second variable v is assigned the matrix whose columns are the normalized eigenvectors corresponding to the eigenvalues in that order.
import numpy as np
a = np.array([[3, 1], [2, 2]])
w, v = np.linalg.eig(a)
print(w)
print(v)
Executing the above Python script, the output is as follows:
Here we will explain the output. The first printed array is w, which constitutes the eigenvalues. The second printed matrix below it is v, whose columns are the eigenvectors corresponding to the eigenvalues in w. Meaning, to the w[i] eigenvalue, the corresponding eigenvector is the v[:,i] column in matrix v.
In NumPy, the ith column vector of a matrix v is extracted as
v[:,i]
So, the eigenvalue
• w[0] goes with v[:,0]
• w[1] goes with v[:,1]
We will now check if the condition
$$Av = \lambda v$$
holds here.
The LHS of the above equation $Av$ here is
np.dot(a,v[:,0])
and the RHS part $\lambda v$ is
np.dot(w[0],v[:,0])
So if the returned eigenvalues and eigenvectors are correct, the following line of script should return True
print(np.allclose(np.dot(a,v[:,0]),np.dot(w[0],v[:,0])))
Also, just to see if the returned eigenvectors are normalized, use the numpy.linalg.norm() function to cross-check them. The below script should return 1.0 in both the print() statements.
print(np.linalg.norm(v[:,0]))
print(np.linalg.norm(v[:,1]))
Notes
• 1) Seymour Lipschutz and Marc Lipson, Linear Algebra. McGraw-Hill Companies, Inc, 2009. Chapter 9: Diagonalization: Eigenvalues and Eigenvectors, p. 297, Ex. 9.5.
• The eigenvectors returned by the numpy.linalg.eig() function are normalized. So, you may not find the values in the returned matrix as per the text you are referring. | 2020-02-27T05:11:22 | {
"domain": "scriptverse.academy",
"url": "https://scriptverse.academy/tutorials/python-eigenvalues-eigenvectors.html",
"openwebmath_score": 0.8953931927680969,
"openwebmath_perplexity": 701.7617336718876,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9902915235185259,
"lm_q2_score": 0.8723473829749844,
"lm_q1q2_score": 0.8638782189236962
} |
http://mathhelpforum.com/number-theory/40712-sigh-need-prove-somthing.html | # Thread: *sigh*... need to prove somthing...
1. ## *sigh*... need to prove somthing...
I'm told that gcd(a,n)=1 and gcd(b,n)=1, a,b,n are natural.
I need to prove that gcd(ab,n)=1.
I don't succeed :-\ Tried millions of things!
2. Originally Posted by aurora
I'm told that gcd(a,n)=1 and gcd(b,n)=1, a,b,n are natural.
I need to prove that gcd(ab,n)=1.
I don't succeed :-\ Tried millions of things!
Say $\gcd(ab,n)=d > 1$. Then $d|ab$ and $d|n$. Note $\gcd(d,a)=1$ since $d|n$ and that would imply $\gcd(a,n) \geq d > 1$ a contradiction, so $\gcd(d,a)=1$. But then $d|ab \implies d|b$. And so $\gcd(b,n)\geq d > 1$ a contradiction. Thus, $d=1$.
3. Originally Posted by aurora
I'm told that gcd(a,n)=1 and gcd(b,n)=1, a,b,n are natural.
I need to prove that gcd(ab,n)=1.
I don't succeed :-\ Tried millions of things!
so we have $ra+sn=kb+\ell n=1,$ for some integers $r,s,k,\ell.$ thus $(kr)ab + (ksb + \ell)n=1. \ \ \square$
4. Thank you very much!
However, NonCommAlg, correct me if I'm mistaken - but the fact that you find this sort of linear presentation of a and n that equals 1 doesn't mean that 1 is their gcd...
5. Originally Posted by aurora
Thank you very much!
However, NonCommAlg, correct me if I'm mistaken - but the fact that you find this sort of linear presentation of a and n that equals 1 doesn't mean that 1 is their gcd...
You are mistaken..
If gcd(n, ab) = d > 0 then d|n and d|ab => d| (kr)ab + (ksb + l)n => d|1 => d = 1
However note that NonCommAlg's trick only works for gcd of 1
6. Originally Posted by Isomorphism
You are mistaken..
If gcd(n, ab) = d > 0 then d|n and d|ab => d| (kr)ab + (ksb + l)n => d|1 => d = 1
However note that NonCommAlg's trick only works for gcd of 1
I agree. However, in my algebra class, my professor would require that you show the extra step (what you just did), so i see where aurora is coming from. i would have done it the way NonCommAlg did it. but i like the contradiction method, it seems elegant to me
7. Thank you guys
8. Originally Posted by Jhevon
I agree. However, in my algebra class, my professor would require that you show the extra step (what you just did), so i see where aurora is coming from. i would have done it the way NonCommAlg did it. but i like the contradiction method, it seems elegant to me
I like the contradiction method too. But I was telling aurora about the idea because its useful in an exam. I think its more mechanical.Contradiction may not hit at the right time
9. Originally Posted by Isomorphism
I like the contradiction method too. But I was telling aurora about the idea because its useful in an exam. I think its more mechanical.Contradiction may not hit at the right time
I agree. that's one of the reasons i like it. it is not so obvious at the moment you see the problem. NonCommAlg's way is something you would do on impulse to see how it works out, which is the charm of that method. good for tests when you can't think clearly or be fancy, but are racing against the clock and just need to get the job done | 2017-06-27T09:42:19 | {
"domain": "mathhelpforum.com",
"url": "http://mathhelpforum.com/number-theory/40712-sigh-need-prove-somthing.html",
"openwebmath_score": 0.7904345393180847,
"openwebmath_perplexity": 1466.1681239051588,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES\n\n",
"lm_q1_score": 0.9902915258107348,
"lm_q2_score": 0.8723473663814338,
"lm_q1q2_score": 0.8638782044908462
} |
https://math.stackexchange.com/questions/968206/prove-the-fractional-field-of-an-integral-domain-is-the-smallest-field-containin | # Prove the fractional field of an integral domain is the smallest field containing the integral domain
I have two questions about the fractional field of an integral domain.
Given an integral domain $D$:
1. Is there a difference between saying "the fractional field of $D$ is the smallest field containing $D$" or "the fractional field of $D$ is the smallest field containing an embedding of $D$"?
2. How do you prove that the fractional field is the smallest field containing $D$ (or an embedding of $D$, if there is a difference...)? Specifically, I want to show that if $F$ is any field containing $D$, then $F$ must contain the fractional field of $D$.
• What is your definition of "fractional field of integer domain"? For me, it is precisely the minimal field containing the domain. – Timbuc Oct 11 '14 at 18:52
• @timbuc *integral domain. My definition is based on the construction. First, given an integral domain $D$, we define the set of ordered pairs where the second coordinate is non-zero. Then we define an equivalence relation where $(a,b) \sim (c,d)$ if $ad = bc$. Then we call the equivalence class containing $(a,b)$ as $\frac{a}{b}$. Then we define addition and multiplication on this set of equivalence classes in the same way as it is defined in $\mathbb{Q}$. This forms a field, what we call the fractional field. – layman Oct 11 '14 at 18:55
• Ok, but then it is trivial, isn't it? I mean, any field containing $\;D\;$ must contain all the multiplicative inverses of non-zero elements $\;d\in D\;$ and thus their product by any element in $\;D\;$ , and this means (by the definition!) that $\;d_1\cdot\frac1{d_2}:=\frac{d_1}{d_2}\;$ is in the field, for any $d_1,d_2\in D\;,\;\;d_2\neq 0\;$ , which means any such field contains the fractions field of $\;D\;$ . – Timbuc Oct 11 '14 at 18:57
• @Timbuc Well now I need to know the answer to my first question. Is there a difference between saying a field contains $D$ and saying it contains an embedding of $D$? – layman Oct 11 '14 at 19:00
• Well, formally there is, yet for most usual cases one doesn't usually pay attention to that slight difference. – Timbuc Oct 11 '14 at 19:01
Let $F'$ be a smallest field containing an embedding of $D$ ($f:D\to F'$), and $F$ a field of fraction of $D$.
We can extend $f$ to morphism of field $\tilde f:F\to F'$ by $\tilde f(a/b)=f(a)/f(b)$.
Now we have that $\tilde f(F)\subseteq F'$ and $\tilde f(F)$ containing an embedding of $D$ , by smallest property we have $\tilde f(F)=F'$.
So the tow fields $F$ and $F'$ are isomorphic.
Edit: If $F$ is any field containing $D$. And denote $K$ the field of fraction of $D$.
Let $a/b\in K$, $a\in D$ and $0\neq b\in D$, hence $a,b\in F$, it follow that $a$ and $1/b$ are in $F$ so $a. (1/b)=a/b\in F$. Thus $K\subseteq F$.
• Is your extension of $f$ well defined? – layman Oct 11 '14 at 19:26
• I guess it is since $f$ is a homomorphism, and if $a/b = c/d$, then $ad = bc$, so $f(a)f(d) = f(b)f(c)$ which implies $f(a)/f(b) = f(c)/f(d)$. – layman Oct 11 '14 at 19:28
• Yes $b\neq 0$ implies $f(b)\neq 0$ because $f(0)=0\neq f(b)$ ($f$ is injective). – Hamou Oct 11 '14 at 19:28
• I guess I would need to do a little bit more work because I would need to show the image of the field $F$ under the extension of $f$ is a field. – layman Oct 11 '14 at 19:29
• When $\frac ab\neq 0$, $\tilde f(a/b)\tilde f(b/a)=1$, hence $\tilde f(a/b)$ is invertible is in $\tilde f(F)$. – Hamou Oct 11 '14 at 19:32
The right (i.e. categorical) way to say this (without the ambiguities of words like "smallest", "containing", etc.) ought to be that the inclusion $\iota: D\to Q(D)$ has the following universal property:
If $K$ is a field, and $f: D\to K$ is any morphism of rings, then there is a unique morphism of fields $g : Q(D) \to K$ such that $f = g \circ \iota$.
(In particular, $Q(D)$ embeds into any field that $D$ embeds into.)
This property uniquely determines (up to isomorphism) not only $Q(D)$, but $\iota$ as well.
And it's easily proved, since $g(1/b)g(b)=g(1)$ forces $g(a/b) = f(a)/f(b)$, so this amounts to checking that $a/b \mapsto f(a)/f(b)$ is actually a homomorphism. | 2020-01-27T03:23:16 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/968206/prove-the-fractional-field-of-an-integral-domain-is-the-smallest-field-containin",
"openwebmath_score": 0.9469299912452698,
"openwebmath_perplexity": 110.9001599027239,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9719924769600771,
"lm_q2_score": 0.8887587993853654,
"lm_q1q2_score": 0.8638668668346455
} |
https://math.stackexchange.com/questions/2946789/finding-the-local-maxima-minima-of-the-following-function | # Finding the local maxima/minima of the following function
$$f: \mathbb{R}\rightarrow \mathbb{R}$$. Then determining if each of the solutions is a global maximum or a global minimum. $$f(x) = \frac{x^{4}}{4} - 2x^{3} + \frac{11}{2}x^{2} - 6x + 2$$ for all $$x \in \mathbb{R}$$.
I have used the synthetic division to find this equation: $$\left ( x^{2} - 5x + 6 \right )\left ( x - 1 \right ) = 0$$
So the critical points are $$x^{*} = 1,2,3$$.
I know that if $$x^{*} = 1$$, then $${f}''\left ( 1 \right ) = 2 > 0$$, so this is minimum.
If $$x^{*} = 2$$, then $${f}''\left ( 2 \right ) = 1 < 0$$, so this is maximum.
If $$x^{*} = 3$$, then $${f}''\left ( 3 \right ) = 2 > 0$$, so this is minimum.
How do I determine whether these solutions are local max/min and global max/min?
Are all of them global solutions as $$x \in \mathbb{R}$$?
EDIT: I have plugged the values of the $$x's$$ in the main function.
For $$x=1$$ and $$x=3$$, $$f(1)= -0.25 = f(3)$$, and for $$x=2$$, $$f(2)= 0$$.
So is $$x=1,3$$ a local minimum and $$x=2$$ a global maximum?
• Use the 2nd derivative. – Wuestenfux Oct 8 '18 at 7:05
• Local max/min: second derivative. Global Max/Min: compare values or find inequality. – Andreas Oct 8 '18 at 7:05
• Have used the second derivative. So are all of them local solutions? I think all of them are global solutions as $x \in \mathbb{R}$. – OGC Oct 8 '18 at 7:06
From the second derivative test the extremum points that you have found are all local. Note that $$\lim_{x\to \pm\infty}f(x)=+\infty$$, so $$x=1$$ is not a global maximum point. On the other hand, since $$f(1)=f(3)=-1/4$$, it follows that $$x=1$$ and $$x=3$$ are global minimum points.
• Without drawing the graph, how would I figure out that $x=1$ and $x=3$ are global minimum points? – OGC Oct 8 '18 at 7:19
• Since $f$ is differentiable in $\mathbb{R}$, and $\lim_{x\to \pm\infty}f(x)=+\infty$, any global minimum point is also a critical point. – Robert Z Oct 8 '18 at 7:23 | 2019-08-21T02:58:09 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2946789/finding-the-local-maxima-minima-of-the-following-function",
"openwebmath_score": 0.8687475919723511,
"openwebmath_perplexity": 179.73060074189183,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.988312744413962,
"lm_q2_score": 0.8740772236840656,
"lm_q1q2_score": 0.8638616597689354
} |
http://math.stackexchange.com/questions/142064/how-do-you-solve-this-sort-of-definite-integral | # How do you solve this sort of definite integral?
Can someone walk me through how to do the following problem so I can attempt a few more practice problems?
If: $$\int_{1}^{5} f(x) dx = 12$$ and $$\int_{4}^{5} f( x) dx = 3.6$$ find: $$\int_{1}^{4} f( x) dx$$
Would it simply be $12 - 3.6$ ?
EDIT
If: $$\int_{0}^{9} f(x) dx = 37$$ and $$\int_{0}^{9} g( x) dx = 16$$ find: $$\int_{0}^{9} 2f(x)+3g(x) dx$$
Would this simply be: $2 \times 37 + 3 \times 16$?
-
Do you know any theorems or identities that relate the values of integrals of the same function with different limits? – MJD May 7 '12 at 4:18
If $a \leq c \leq b$, then $\int_a^b=\int_a^c+\int_c^b$. Use this profitably. – J. M. May 7 '12 at 4:19
As you said, it is simply 12-3.6. – MJD May 7 '12 at 4:19
@MarkDominus Wow, I didn't think it would be that simple. That's why I posted it up here. I'll post a second one up so it's not a waste of a question. – justcheckingin May 7 '12 at 4:21
Regarding the second problem: yes, that's right. – Brian M. Scott May 7 '12 at 4:26
This is done using additivity of integration on intervals i.e. if $c \in [a,b]$ and
$\displaystyle \int_a^b f(x) dx$, $\displaystyle \int_a^c f(x) dx$ and $\displaystyle \int_c^b f(x) dx$ are well- defined, then $$\int_a^b f(x) dx = \int_a^c f(x) dx + \int_c^b f(x) dx$$ Hence, in your case, you have that $$\int_1^5 f(x) dx = \int_1^4 f(x) dx + \int_4^5 f(x) dx$$ Hence, we get that $$12 = \int_1^4 f(x) dx + 3.6$$ i.e. $$\int_1^4 f(x) dx = 8.4$$
For the second problem as Brian pointed out in the comments, it follows from linearity of integration i.e. $$\int \left( a f(x) + b g(x) \right)dx = a \int f(x)dx + b \int g(x) dx$$ provided all the integrals are well-defined.
-
$$\int_a^bf(x)dx+\int_b^cf(x)dx=\int_a^cf(x)dx$$
The integral in the interval $[1,4]$ is the difference: integral in $[1,5]$ - integral $[4,5]$. | 2014-08-21T12:22:12 | {
"domain": "stackexchange.com",
"url": "http://math.stackexchange.com/questions/142064/how-do-you-solve-this-sort-of-definite-integral",
"openwebmath_score": 0.9622020721435547,
"openwebmath_perplexity": 564.9705017758622,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9883127433812522,
"lm_q2_score": 0.8740772236840656,
"lm_q1q2_score": 0.8638616588662673
} |
https://math.stackexchange.com/questions/1166737/general-formula-for-iterated-cumulative-sum | # General formula for iterated cumulative sum
Consider the sequence $$S_0$$ consisting of ones:
$$1,1,1,1,1,1,\ldots$$
Now compute the cumulative sum of this sequence, and call the resulting sequence $$S_1$$:
$$1,2,3,4,5,6,\ldots$$
Proceed iteratively to generate sequence $$S_2$$:
$$1,3,6,10,15,21,\ldots$$
then $$S_3$$:
$$1,4,10,20,35,56,\ldots$$
and so on.
It is well known that each sequence $$S_k$$ can be represented by a $$k$$-degree polynomial $$P_k(n)$$. For the above sequences the polynomials are $$P_0(n) = 1$$ $$P_1(n) = n$$ $$P_2(n) = \frac{n^2+n}{2}$$ $$P_3(n) = \frac{n^3+3n^2+2n}{6}$$
My question: Is there a general formula for coefficients of the polynomial $$P_k$$? Or more generally, is there a formula to compute $$S_k(n)$$ as a function of $$n$$ and $$k$$? I mean a closed formula $$S_k(n) = f(k,n)$$ (not an iterative procedure such as the construction method I just described).
If that helps, actually I'm not interested in $$S_k(n)$$, but rather in the quotient $$S_k(n)/S_k(n+1)$$.
• Just a test to see if I have understood: in $S_1$ should the last term be $21$? – User3773 Feb 26 '15 at 17:39
• @Cla Oops. Yes, sorry. Corrected! – Luis Mendo Feb 26 '15 at 17:40
The numbers in sequence $S_k$ are the binomial coefficients $\binom{m}{k}$; the $n$-th term of $S_k$ is $\binom{n-1+k}{k} = \frac{(n-1+k)!}{(n-1)!k!}$. One can prove this by using that $$\binom{i}{i} + \binom{i+1}{i} + \cdots + \binom{i+j}{i} = \binom{i+j+1}{i+1}$$ for any $i,j \geq 0$.
For $k=1$ we find $P_1(n) = \binom{n-1+1}{1} = \binom{n}{1} = n$, for $k=2$ we find $P_2(n) = \binom{n-1+2}{2} = \binom{n+1}{2} = \frac{n(n+1)}{2}$, for $k=3$ we find $P_3(n) = \binom{n-1+3}{3} = \binom{n+2}{3} = \frac{n(n+1)(n+2)}{6}$, etcetera.
• Wow. It was really simple! Could you provide any reference? – Luis Mendo Feb 26 '15 at 17:43
• Thanks a lot for your help. I've posted a related question here – Luis Mendo Feb 26 '15 at 18:47
We can generalize your problem to arbitrary initial sequences.
Let $a_n\,(n=0,1,2,3,...)$ be a sequence of numbers. Define its iterated partial sums using the recurrence $$S^{(0)}_n=a_n,\quad S^{(k+1)}_n=\sum_{m=0}^n S^{(k)}_m,\tag1$$ so that we have, for example, $$\small\begin{array} &S^{(0)}_0=\color{green}{a_0}, &S^{(0)}_1=\color{blue}{a_1}, &S^{(0)}_2=\color{maroon}{a_2},&...\\ S^{(1)}_0=\color{green}{a_0}, &S^{(1)}_1=\color{green}{a_0}+\color{blue}{a_1}, &S^{(1)}_2=\color{green}{a_0}+\color{blue}{a_1}+\color{maroon}{a_2},&...\\ S^{(2)}_0=\color{green}{a_0}, &S^{(2)}_1=\color{green}{a_0}+(\color{green}{a_0}+\color{blue}{a_1}), &S^{(2)}_2=\color{green}{a_0}+(\color{green}{a_0}+\color{blue}{a_1})+(\color{green}{a_0}+\color{blue}{a_1}+\color{maroon}{a_2}),&...\\ S^{(3)}_0=\color{green}{a_0}, &S^{(3)}_1=\color{green}{a_0}+(\color{green}{a_0}+(\color{green}{a_0}+\color{blue}{a_1})),&... \end{array}\tag2$$ Now we can prove by induction that the following formula holds: $$S^{(k+1)}_n=\sum_{m=0}^n\binom{m+k}k\,a_{n-m}.\tag3$$
• Vladimir, I've just given an approach which generalizes your solution even more. Please see my new answer. – Gottfried Helms Aug 29 '19 at 6:55
A more generalized solution, where even fractional iteration-heights $$h$$ for $$S_n^{(h)}$$ become possible, can be found using a matrix-ansatz. Consider the matrix-equation $$D \cdot A = S^{(1)}(A) \tag 1$$ where $$D$$ is the lower triangular unit-matrix $$D= \Tiny \begin{bmatrix} 1&.&.&.&\cdots\\1&1&.&.&\cdots\\1&1&1&.&\cdots\\ 1&1&1&1&\cdots\\ \vdots&\vdots&\vdots&\vdots&\ddots\\ \end{bmatrix} \tag 2$$ then of course \small \begin{align} D^2 \cdot A &= S^{(2)}(A) \\ D^3 \cdot A &= S^{(3)}(A) \\ \vdots \\ D^h \cdot A &= S^{(h)}(A) \\ \end{align} \tag 3 The $$h$$'th power of $$D$$ can be computed using $$L = \log(I + (D-I))$$ and $$\exp(L)$$ using the series-representation of this functions (which reduce to finite sums in the case of using $$D$$). We get formally
$$\displaystyle \qquad \qquad \Large{D^h =}$$ $$\tag 4$$
and where we need only document the entries of the first column because of the schematic form of $$D^h$$:
$$\displaystyle \qquad \qquad S_n^{(h)} (A) = \sum_{c=0}^n D_{n,c} \cdot A[c] = \sum_{r=0}^n D_{n-r,0} \cdot A[r] \tag 5$$
The coefficients $$D_{r,0}$$ might look abscure, but can easily be described when factorials are extracted:
$$\displaystyle \qquad \qquad \large {S_5^{(h)}(A)=}$$ $$\tag 6$$
and even simpler
$$\displaystyle \qquad \qquad \large {S_5^{(h)}(A)=}$$ $$\tag 7$$
The coefficients in the previous representation are the unsigned Stirlingnumbers $$1$$'st kind and for integral $$h$$ this gives of course the appropriate binomial-expressions which are noted in the other answers and comments.
But we can easily insert fractional $$h$$ as well!
Concerning your last question, the quotient.
Example, let $$k=3$$ then the quotient can be found by multiple cancellations: $$P_3(n) = {n^3+3n^2+2n\over 6} = {(n+2)(n+1)n\over 6} \\\ P_3(n+1) = {(n+1)^3+3(n+1)^2+2(n+1)\over 6} = {(n+3)(n+2)(n+1)\over 6} \\\ {P_3(n+1)\over P_3(n)} ={{(n+3)(n+2)(n+1)\over 6}\over {(n+2)(n+1)n\over 6} } = {n+3\over n}$$ Thus in general: $${P_k(n+1)\over P_k(n)} ={{(n+k)\cdots(n+2)(n+1)\over k!}\over {(n+k-1)\cdots(n+1)n\over k!} } = {n+k\over n}$$ | 2020-01-20T06:26:19 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/1166737/general-formula-for-iterated-cumulative-sum",
"openwebmath_score": 0.999718964099884,
"openwebmath_perplexity": 411.8128985669469,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9883127426927789,
"lm_q2_score": 0.8740772220439509,
"lm_q1q2_score": 0.8638616566435422
} |
https://math.stackexchange.com/questions/155952/arcwise-connected-part-of-mathbb-r2 | # Arcwise connected part of $\mathbb R^2$
Here's a question that I share: Show that if $D$ is a countable subset of $\mathbb R^2$ (provided with its usual topology) then $X=\mathbb R^2 \backslash D$ is arcwise connected.
• This is even true if you only require $D$ to have lebesgue-measure 0: math.stackexchange.com/questions/77791/… Jun 9 '12 at 9:20
• I have two further questions: 1) Is this result holds in higher dimension i.e., on $\mathbb{R}^n$, where $n \in \mathbb{N}$. 2) Can one characterize the topological space for which this kind of properties hold $?$ May 22 '13 at 18:47
• @TeresaLisbon I first asked it as new question but it was closed and repititive requests to open it were discarded in CURED chatroom and they suggested that new questions shouldn't be asked but bounty should be put on old question. Which I did now. Sep 23 '21 at 6:02
• Just for reference, the question that was closed as a duplicate is If A is countable subset of $\mathbb{R}^2$ , then $\mathbb{R}^2 - A$ is pathwise connected.. The relevant discussion in the chatroom CURED can be found here: Request for reopening //q/3973870. Sep 23 '21 at 6:57
• @No-One Got it, thanks. I think what I'll do, if I plan to answer this, is place your bounty text in my answer, to make sure that my answer targets your query, along with the question in general. Sep 23 '21 at 9:20
HINT: Not only is $\Bbb R^2\setminus D$ arcwise connected, but you can connect any two points with an arc consisting of at most two straight line segments.
Suppose that $p,q\in\Bbb R^2\setminus D$. There are uncountably many straight lines through $p$, and only countably many of those lines intersect $D$, so there are uncountably many straight lines through $p$ that don’t hit $D$. Similarly, there are uncountably many straight lines through $q$ that don’t hit $D$. Can you finish it from here?
• Yes, I can : two of them at lest intersect. One auther way is to consider the bissector $\Delta$ of $[ab]$ and all straight lines $[p,\delta]\cup[\delta,q]$ where $\delta \in \Delta$, On of them at lest is a subset of $X$ Jun 9 '12 at 9:32
• @Mohamed: Exactly. (Or if you’re really lucky, one of them is the line through $p$ and $q$.) Jun 9 '12 at 9:37
• I have not thought about this one!! Thank's!! (Edit [p,q] not [a,b] ) Jun 9 '12 at 9:51
• From here. In order to show path $f:[0,1]\to \Bbb{R}^2-A$ is continuous.we can construct a function: $f(t)=f_1(t)$ ,if $t\in [0,1/2]$ and $f(t)=f_2(t)$ ,if $t\in [1/2,1]$. $f$ is continuous by pasting lemma. And we're done. Am I right?@Briam M Scott Jul 16 '20 at 11:57
• @AmanPandey: Yes, that’s right. Jul 16 '20 at 16:35
Any two points in $\mathbb R^2\setminus D$ are connected by uncountably many disjoint arcs of circles, of which only countably many may intersect $D$.
(This is adapted from one of my student's solutions to a related exam problem.)
Let $$p, q$$ be two distinct points in $$\mathbb{R}^2 \setminus D$$. If the straight line segment joining $$p$$ to $$q$$ lies in $$\mathbb{R}^2 \setminus D$$, then you are done: one possible parametrization of the path is $$\gamma(t) = (1 - t)p + tq$$, $$0 \leq t \leq 1$$.
So, suppose that the above does not work. Now, note that there are uncountably infinitely many straight lines passing through the point $$p$$. Since $$D$$ is only countable, in particular there are uncountably infinitely many straight lines passing through $$p$$ and not intersecting $$D$$. Fix any one such line $$L_1$$. Once more, there are uncountably infinitely many straight lines passing through $$q$$ that also intersect $$L$$. In particular, there are uncountably infinitely many such lines that also do not intersect $$D$$. Fix any one such line $$L_2$$.
Suppose that $$L_1$$ and $$L_2$$ intersect at the point $$r$$. Then, you can take the path joining $$p$$ and $$q$$ to be the one that starts at $$p$$, traverses along the line $$L_1$$ to the point $$r$$, then traverses along the line $$L_2$$ to the point $$q$$. One possible parametrization of this path is $$\gamma(t) = \begin{cases} (1 - 2t)p + 2tr, & 0 \leq t \leq \tfrac{1}{2};\\ (2 - 2t)r + (2t - 1)q, & \tfrac{1}{2} \leq t \leq 1. \end{cases}$$ Note that the pasting lemma shows that $$\gamma$$ is indeed continuous.
As for how one arrives at these specific parametrizations, one first needs to know the parametric equation of a straight line. For instance, see Parametric form of a line for a quick refresher. Secondly, one needs to adjust the parameter $$t$$ by scaling and translating in order to get it to lie in the "correct" range for one's purposes. This is another linear change, so it should not be too difficult.
But, just to belabor the point further, here's one way you can mentally figure out the parametrization $$\gamma$$ in the second case. To join the points $$p$$ and $$r$$, we want to vary $$t$$ from $$0$$ to $$1/2$$ such that at $$t = 0$$ we are at $$p$$ and at $$t = 1/2$$ we are at $$r$$. So, if the parametrization for this part looks like $$\gamma(t) = f(t)p + g(t)r$$, then we want $$f(0) = 1$$ and $$f(1/2) = 0$$, and we also want $$g(0) = 0$$ and $$g(1/2) = 1$$. Can we find linear functions $$f(t) = \alpha_1 t + \beta_1$$ and $$g(t) = \alpha_2 t + \beta_2$$ that satisfy these conditions? Sure, just substitute those values of $$(t, f(t))$$ and $$(t, g(t))$$ that we wrote down for $$t = 0, 1/2$$ into the respective equations to solve for $$\alpha_i, \beta_i$$. Repeat the process for the line joining $$r$$ to $$q$$, and you are done.
• For completeness, you should at least state that your path is also injective, which implies that it defines an embedding $[0,1]\to X$, as required by the definition of an arcwise connected space. Sep 28 '21 at 17:57
Ok I will take a stab at clarifying Brian M. Scott's Answer instead of writing a fully different answer.
Let $$p,q\in \mathbb{R}-D$$. Then Define $$A:=\{\text{ Lines Through }p\}$$, $$B:=\{ \{\text{ Lines through }q\}$$.
One could write the definitions of these sets more formally if desired, but the meaning is clear. I claim the following: $$\exists l\in A, \text{ such that } l\cap D=\emptyset.$$ Similarly $$\exists n\in B, \text{ such that } l\cap D=\emptyset.$$ Lets us understand why this should be clear. Now define a mapping $$m:\mathbb{R} \to A$$ by $$m(x):=$$ the line in $$A$$ with slope $$x$$. This mapping is clearly $$1-1$$ and onto (almost see below*), as any line through a point $$p$$ is determined by its slope, and any slope uniquely determines a line through $$p$$. You could formalize this more by writing any line through $$p$$ in point slope form, but I leave that to the reader.
A similar argument follows for $$B$$, thus $$||A||=||B||=||\mathbb{R}||$$.
Now let us show that there are lines in $$A$$ and $$B$$ which do not contain points in $$D$$. define a map $$\phi:D\to A\times B$$, by $$\phi(d):=\{(l,m)\in A\times B| d=l\cap m\}$$. That is each point $$d\in D$$ gets mapped to the pair of lines in $$A$$ and $$B$$ which meet at $$d$$. This mapping is $$1-1$$, as any two points determine a unique line. By assumption $$D$$ is countable, therefor $$\phi$$ cannot be onto thus there exists a pair of lines, $$(l^*,m^*)$$, which do not contain any points in $$D$$. This follows as $$A\times B- \phi(D)\neq \emptyset$$.
we have a piecewise linear path $$p \to l^*\cap m^* \to q$$. QED.
The Crux of the argument, here is where we assert that the mapping $$\phi$$ cannot be onto, given the assumption that $$D$$ was countable.
One small note, the map $$m$$ is not quite onto, as the vertical line through $$p$$ has undefined slope. However, this doesn't disturb the argument as the main idea is that $$A$$ and $$B$$ are both uncountable. We might also be able to circumvent this by taking a mapping from the extended reals.
• Great stuff, really nice answer, thanks for adding the clarification in the first line. Sep 25 '21 at 12:32 | 2022-01-24T17:09:12 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/155952/arcwise-connected-part-of-mathbb-r2",
"openwebmath_score": 0.9182594418525696,
"openwebmath_perplexity": 160.33141424385343,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9863631623133666,
"lm_q2_score": 0.875787001374006,
"lm_q1q2_score": 0.8638440361882054
} |
https://mathoverflow.net/questions/385167/are-at-most-1-3-vertices-kings?noredirect=1 | # Are at most $1/3$ vertices "kings"?
If $$G=(V,E)$$ is a finite, simple, undirected graph, and $$v\in V$$, we set $$N(v) = \{w\in V:\{v,w\}\in E\}$$, and $$\text{deg}(v)= |N(v)|$$. We say a vertex $$v\in V$$ is a king if $$\text{deg}(v) > \text{deg}(w)$$ for all $$w\in N(v)$$.
In the graph $$G=(\{0,1,2\}, \big\{\{0,1\}, \{1,2\}\big\})$$, one of the $$3$$ vertices is a king. Let $$\text{King}(G)$$ be the set of king vertices.
Question. Is it true that for any finite connected graph $$G=(V,E)$$ with $$|V|>1$$ we have $$|\text{King}(G)|/|V|\leq 1/3$$? If not, how large can this value get?
• A complete bipartite graph $G = U \cup V$ with $|U| = n$ and $|V| = n-1$ has $n - 1$ kings out of $2n - 1$ total vertices. Feb 28 at 14:16
• maybe related: mathoverflow.net/questions/343607/… Mar 1 at 15:14
For this discussion I am assuming we do not consider isolated vertices to be "Kings", even though technically your definition considers them to be so in a vacuous sense (I guess this convention goes back to Shakespeare). Otherwise of course one can make every vertex a king by having no edges whatseover.
For the matching lower bound, observe that no two kings can be adjacent, and if there is at least one king, the set $$E'$$ of ordered pair edges $$(v,w)$$ in $$E$$ with $$v \in \mathrm{King}(G)$$ and $$w \not \in \mathrm{King}(G)$$ is non-empty. Now we do weighted double counting: \begin{align*} \# \mathrm{King}(G) &= \sum_{v \in \mathrm{King}(G)} 1 \\ &= \sum_{(v,w) \in E'} \frac{1}{d(v)}\\ &< \sum_{(v,w) \in E'} \frac{1}{d(w)} \\ &\leq \sum_{w \in V \backslash \mathrm{King}(G)} 1 \\ &= \#V - \# \mathrm{King}(G) \end{align*} hence $$\# \mathrm{King}(G) < \frac{1}{2} \# V.$$ Of course the same claim holds when there are no kings as long as the graph is not the empty graph. So this shows that the lower bound provided by the complete bipartite graph examples (adding an isolated vertex in the case when one wants an even number of vertices) are completely optimal: the maximal number of kings in a graph on $$n$$ vertices is $$\max( \lfloor \frac{n-1}{2} \rfloor, 0)$$.
This bound can also be viewed as quantifying a variant of the "friendship paradox". (Based on this connection, I propose "influencer" as a more modern and gender-neutral terminology alternative to "king".)
• There is already the gender-neutral "celebrity" which appears to be motivated by interpreting the vertex degree as the number of people by which a person is known. Mar 1 at 15:20
• Furthermore the terminology "king" is used with a different meaning in oriented tournaments (these are vertices with maximum out-degree). Mar 2 at 4:14
The fact that the number of kings is less than the number of non-kings is essentially equivalent to the following problem, proposed by Alexander Razborov to Tournament of Towns in 1990:
Given an $$m\times n$$ matrix, $$m. Some entries are starred, and each column contains a starred entry. Then there exists a star whose row contains more stars than its column.
(Here columns correspond to kings, rows to non-kings, stars to edges, and the strictness of inequalities is different.)
I wanted to find a proof that uses Hall's marriage theorem [1] instead of double-counting.
Given a graph $$G=(V,E)$$, let $$K$$ be the set of kings in $$V$$, and $$R:=V \setminus K$$ the rest.
Claim: $$|K| < |R|$$.
Proof Let $$G=(V,E)$$ be a counterexample that minimizes the sum $$|V|+|E|$$, so $$|K| \ge |R|$$. Then $$G$$ is bipartite, since any edge between nodes in $$R$$ can be removed. If $$|K|>|R|$$ then removing one king would yield a smaller counterexample, so $$|K|=|R|$$. If there was a subset $$S$$ of $$K$$ where its neighborhood satisfies $$|N(S)|< |S|$$, then the induced graph on $$S \cup N(S)$$ would be a smaller counterexample. Thus the Hall condition is met in $$G$$. Removing from $$G$$ a perfect matching of $$K$$ to $$R$$ yields a smaller counterexample.
If we consider the complete bipartite graph $$K_{n,m},$$ where $$n,m$$ are natural numbers with $$n < m,$$ then the maximum degree of a vertex in this graph is $$=m$$ and there are at least $$n$$ many vertices having degree $$m$$, and so the number of "kings" (as per the definition above) in this graph is $$= n,$$ and the total number of vertices $$=n+m.$$
Now, since $$n,m$$ can be anything (with $$n \le m$$), so one can take $$n,m$$ to be such that $$n/(n+m) > \frac{1}{3},$$ and thus in this case we see that the number of kings in this graph is $$> \frac{1}{3} \cdot$$ the number of vertices in the graph.
For such graphs you can just set $$n=m-1$$ to see that you cannot get an "asymptotic" bound of $$< 1/2.$$
• If $n=m$ then there are no kings. The best this bipartite construction can do is $\lceil n/2\rceil$ many kings, as Nik Weaver has also pointed out. Feb 28 at 15:58 | 2021-11-27T23:58:53 | {
"domain": "mathoverflow.net",
"url": "https://mathoverflow.net/questions/385167/are-at-most-1-3-vertices-kings?noredirect=1",
"openwebmath_score": 0.9982947707176208,
"openwebmath_perplexity": 536.8399596769223,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9863631639168357,
"lm_q2_score": 0.8757869916479466,
"lm_q1q2_score": 0.8638440279990759
} |
https://math.stackexchange.com/questions/2578923/why-is-the-integral-of-frac1x2-from-1-to-infty-not-the-same-as-the-in | Why is the integral of $\frac1{x^2}$ from $1$ to $\infty$ not the same as the infinite sum from $1$ to $\infty$?
Studying series I am a bit confused on this point. The infinite sum of $1/x^2$ from $1$ to $\infty$ was proved by Euler to be $\pi^2$ divided by $6$:
$$\sum_{x=1}^\infty\frac 1 {x^2}=\frac {\pi^2} 6$$
But if I integrate from $1$ to $\infty$ of the same entity namely $1/x^2$ it is $1$. Correct..? Unless I did it wrong. $$\int_1^\infty\frac 1 {x^2}dx=1$$ How can this be since by integrating it seems we are adding a lot more numbers to cover the same area so we should by all means get the same thing or something at least as large as $\pi^2/6$?
• Why would anyone expect them to be the same? Dec 24, 2017 at 16:49
• @LordSharktheUnknown, please read his entire question. Dec 24, 2017 at 16:54
• The relationship between the sum and the integral is given by en.wikipedia.org/wiki/Euler–Maclaurin_formula. they differ because rectangles are not curved. The area in the rectangles is not the area under the curve. Dec 24, 2017 at 16:54
• @Sedumjoy, please read your edited question for how to write the integral and sum :). Dec 24, 2017 at 17:00
• I agree with @LordSharktheUnknown, it is not natural to expect that $$f(x)=\frac{1}{x^2},\qquad g(x)=\frac{1}{\lfloor x\rfloor ^2}$$ have the same integral over $(1,+\infty)$, also because $g(x)\geq f(x)$. Dec 24, 2017 at 17:55
Note that $$\int_1^\infty \frac{1}{x^2}\leq\sum_1^\infty \frac{1}{n^2}\tag{1}$$ by considering a Riemann sum with left endpoints. Here is a picture (for the case of $1/x$ but a similar picture can be drawn for this case as well). See this picture. Image credits go to Wikipedia.
• +1 For the picture.. It illustrates the point better :) I will add it to my answer
– Ant
Dec 24, 2017 at 16:59
• no its the wrong graph, should be a graph of $\frac{1}{x^2}$, right? Dec 24, 2017 at 17:00
• @FoobazJohn, Just wondering, what program did you use to make this picture? Dec 24, 2017 at 17:00
• @mathreadler, yeah you're right, though the basic insight remains the same. Dec 24, 2017 at 17:01
• @mathreadler Yes I commented that it is for $1/x$ but a similar picture can be drawn for the case $1/x^2$. Dec 24, 2017 at 17:01
When you do the sum, you sort of approximate the area with rectangles of base length equal to $1$. Draw the function $1/x^2$ and draw the rectangles with base length 1; you'll see that the area under the rectangles is much bigger than the area under the function $1/x^2$
Here is an illustration for the function $1/x$, but it's essentially the same as in the $1/x^2$ case. (Thanks to @FoobazJohn) The integral adds a lot more numbers, but these numbers are multiplied by something very small. The end result is that the integral represents the area under the $1/x^2$ curve, which is less than the area under the rectangles.
Let us compare $1$ and $\int_1^2\frac1{x^2}\,\mathrm dx$. Since $\bigl(\forall x\in(1,2]\bigr):\frac1{x^2}<1$, $\int_1^2\frac1{x^2}\,\mathrm dx<1$. For the same reason, $\int_2^3\frac1{x^2}\,\mathrm dx<\frac14$, $\int_3^4\frac1{x^2}\,\mathrm dx<\frac19$, and so on. So$$1=\int_1^\infty\frac1{x^2}\,\mathrm dx<\sum_{n=1}^\infty\frac1{n^2}=\frac{\pi^2}6.$$
Note that it is not true that $\int_a^bf(x)\,\mathrm dx$ is the sum of all numbers $f(x)$ with $x\in[a,b]$. Instead, it is the average value of $f$ in $[a,b]$ times $b-a$.
• all three answers are very good in explaining this and I will pick one to close the problem but they are equally good....I feel stupid for not seeing this that I had to ask.... Dec 25, 2017 at 0:59 | 2022-08-19T21:41:30 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2578923/why-is-the-integral-of-frac1x2-from-1-to-infty-not-the-same-as-the-in",
"openwebmath_score": 0.7699971795082092,
"openwebmath_perplexity": 195.1981505909385,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9863631643177029,
"lm_q2_score": 0.8757869803008764,
"lm_q1q2_score": 0.8638440171578182
} |
https://math.stackexchange.com/questions/1681268/help-me-find-mistake-in-exact-differential-equation | # Help Me Find Mistake in Exact Differential Equation
I am working on exact differential equations and I just cannot seem to understand them and was hoping to have my method checked and please provide feedback on that.
$$(18xy^2 - \sin(x))dx + (8 + 18x^2y)dy = 0;\,\, y(0) = 1$$ I first calculated the crossed partial derivatives for both terms to check they were equal which I found they both came out to be 36xy.
Then I have said that $$\frac{\partial u}{\partial x} = 18xy^2 - sin(x)$$ and therefore $$u = 9y^2 x^2 + cos(x) + h(y)$$
Now I have said that $$\frac{\partial u}{\partial y} = 18yx^2 + h'(y) = 8 + 18yx^2$$ which I believe is not a problem.
This says that h'(y) = 8 which I have then integrated with respect to y and found h(y) = 8y + C
I believe this means my final result for the answer which in our notes is always denoted as $$u(x,y) = 36xy + 8y + C$$
So far I cannot understand how these exact differential equations work and have been told my answer is wrong. I am yet to find the exact solution using the initial condition as I am unsure how to do that as well because I am confused by a few things with these problems however if possible could we please discuss the method how to solve these types of DEs and check to see if my answer is correct.
Thank you very much,
Michael
• Micheal, I have started the edits so take a look at the first question and hopefully you can fix the other equations? All details can be found here. – Chinny84 Mar 3 '16 at 10:18
• Thanks I wasn't sure until now how to properly do the formatting thank you. – Michael Mar 3 '16 at 10:46
• No problem. I think the site experience will become even better for you now :) – Chinny84 Mar 3 '16 at 10:52
$$\left(18xy(x)^2-\sin(x)\right)\space\text{d}x+\left(8+18x^2y(x)\right)\space\text{d}y=0$$
Let $\text{P}(x,y)=18xy^2-\sin(x)$ and $\text{Q}(x,y)=18x^2y+8$.
This is an exact equation, because $\frac{\partial\text{P}(x,y)}{\partial y}=36xy=\frac{\partial\text{Q}(x,y)}{\partial x}$.
Define $f(x,y)$ such that $\frac{\partial f(x,y)}{\partial x}=\text{P}(x,y)$ and $\frac{\partial f(x,y)}{\partial y}=\text{Q}(x,y)$.
Then, the solution will be given by $f(x,y)=\text{C}$, where $\text{C}$ is an arbitrary constant.
Integrate $\frac{\partial f(x,y)}{\partial x}$ with respect to $x$ in order to find $f(x,y)$:
$$f(x,y)=\int(18y^2x-\sin(x))\space\text{d}x=9y^2x^2+\cos(x)+g(y)$$
Differentiate $f(x,y)$ with respect to $y$ in order to find $g(y)$:
$$\frac{\partial f(x,y)}{\partial y}=\frac{\partial}{\partial y}(9y^2x^2+\cos(x)+g(y))=18yx^2+\frac{\text{d}g(y)}{\text{d}y}$$
Substitute into $\frac{\partial f(x,y)}{\partial y}=\text{Q}(x,y)$:
$$18yx^2+\frac{\text{d}g(y)}{\text{d}y}=18yx^2+8$$
Solve for $\frac{\text{d}g(y)}{\text{d}y}$:
$$\frac{\text{d}g(y)}{\text{d}y}=8\Longleftrightarrow$$ $$\int\frac{\text{d}g(y)}{\text{d}y}\space\text{d}y=\int8\space\text{d}y\Longleftrightarrow$$ $$g(y)=8y$$
Substitute $g(y)$ into $f(x,y)$:
$$f(x,y)=9y^2x^2+8y+\cos(x)$$
The solution is $f(x,y)=\text{C}$:
$$9y^2x^2+8y+\cos(x)=\text{C}$$
$$9y(x)^2x^2+8y(x)+\cos(x)=\text{C}\Longleftrightarrow$$ $$y(x)=\frac{-4\pm\sqrt{16+9\text{C}x^2-9x^2\cos(x)}}{9x^2}$$
We know that $y(0)=1$ we can't use the solution with the '-' sign before the square root:
$$1=\lim_{x\to0}\frac{-4+\sqrt{16+9\text{C}x^2-9x^2\cos(x)}}{9x^2}\Longleftrightarrow$$ $$1=\frac{\text{C}-9}{72}\Longleftrightarrow$$ $$\text{C}=81$$
So the solution is:
$$y(x)=\frac{-4+\sqrt{81x^2-9x^2\cos(x)+16}}{9x^2}$$
• Thank you for the super clear and detailed answer! I think I should easily be able to follow this process through and apply it to any other problems :) – Michael Mar 3 '16 at 11:23
• @Michael You're welcome. Yes you can do that!! – Jan Mar 3 '16 at 11:46
HIT:
You found $\quad u = 9y^2 x^2 + \cos(x) + h(y)\quad$ which is correct.
You also found $\quad h(y) = 8y + C\quad$ which is correct.
Then obviously the result is not : $u(x,y) = 36xy + 8y + C$ but is : $$u(x,y) = 9y^2 x^2 + \cos(x) +8y+C$$
Then you can solve $u(x,y)$=constant for $y(x)$. | 2019-11-15T21:09:00 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/1681268/help-me-find-mistake-in-exact-differential-equation",
"openwebmath_score": 0.6682783365249634,
"openwebmath_perplexity": 172.94143185205573,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9736446471538803,
"lm_q2_score": 0.8872045922259088,
"lm_q1q2_score": 0.8638220021510972
} |
https://stats.stackexchange.com/questions/433478/dof-of-natural-cubic-spline | # DOF of Natural Cubic Spline
I am curious as to what the answer to the below question is? The question specifies a modeler has a cubic spline with knots at {10, 20, 30, 50}. They realize their model is overfitting at the ends of the distribution and wants to impose an additional constraint that the curve before the first knot and after the last knot are linear, then to calculate the DOF of the new model.
My thought process is that the answer should be 4 DOF for the new natural cubic spline model. Below is how I arrived at my answer:
The cubic spline has 8 DOF: 4+(4)(4)-(4)(3)=8 where the first 4 is for the intercept, X, X^2, X^3; then add 4 terms for earch knot; subtract out the 3 constraints at each knot to account for continuity, and the first and second derivatives to be zero.
Then to make the cubic spline with 4 knots a natural cubic spline, subtract (2)(2)=4 to get 4 DOF since the interval below the lowest knot and above the largest knot need to be made linear.
I’ve been told the correct answer is 6 DOF and I don’t understand how. I’ve been told it has something to do with interior knots vs boundary knots. Can someone shed some light as to how the answer could possibly be 6? Is my answer of 4 wrong?
Let there be $$K$$ knots $$\xi_1 < \dots < \xi_K$$. I'll use $$x_\min$$ for the smallest observed $$x$$ value, and $$x_\max$$ is analogous.
I think the answer depends on whether or not the $$\xi_j$$ are assumed to be interior knots, and if we want the spline to change in $$[x_\min, \xi_1]$$ and $$[x_\max, \xi_K]$$ or not (and this also depends on whether or not $$x_\min < \xi_1$$ and/or $$\xi_K < x_\max$$).
If we only care about behavior between $$\xi_1$$ and $$\xi_K$$, then we could use the following truncated power basis: $$h_j(x) = x^j, j=0,1,2,3$$ and $$h_j(x) = (x-\xi_{j-3})_+^3, \hspace{5mm} j = 4,\dots, K+3$$ leading to $$K+4$$ DoF. This represents four DoF coming from the global cubic that we start with and one DoF being added for every knot we pass.
Restricting this to a natural spline means we'll constrain $$\beta_2 = \beta_3 = 0$$ which frees up 2 DoF, and we'll need the coefficients of $$x^3$$ and $$x^2$$ to be zero when every basis is active, so this further frees up two DoF meaning there are now $$K$$ DoF.
In interpolation problems and smoothing splines I think this is the right way to account for DoFs, because we have every point as a knot so there aren't separate boundary knots from $$x_\min$$ and $$x_\max$$.
But if we are always thinking of the $$\xi_j$$ as interior knots then we would have two more regions where the spline in changing. This is where setting $$\xi_0 = x_\min$$ and $$\xi_{K+1} = x_\max$$ makes sense and really we now have $$K+2$$ knots and therefore the full cubic spline has $$K+6$$ DoF and the natural spline has $$K+2$$.
In Figure 7.5 of Introduction to Statistical Learning (in the question you linked) we can tell that they are using the $$K+2$$ DoF version because the spline is nonlinear on all of $$[x_\min, x_\max]$$, rather than just on $$[\xi_1, \xi_3]$$.
To answer the exact question: I can't tell which formulation they want but I think $$6$$ is more likely correct.
For a spline that is not interpolating or smoothing, which you have here, I think having $$\xi_1$$ and $$\xi_K$$ as interior knots makes sense so the $$K+2 = 6$$ answer makes sense.
But in the exact wording of the question they say "the curve before the first knot and after the last knot will be linear". If they mean out of the four given knots, then that means an answer of $$K=4$$ is correct, but I'm guessing they worded this poorly and are thinking of $$x_\min$$ and $$x_\max$$ as the first and last knots respectively, so even though at face value this suggests an answer of $$4$$, with this boundary knot inclusion then again the answer is $$6$$.
• thank you for your response! the source this question is based on is James' Intro to Statistical Learning. I've linked below another thread which is the exact question/confusion I'm having between my answer and what was deemed as the correct answer. Is there a way to know in the question asked that they want us to assume implicit bounds, making the total knots 6? stats.stackexchange.com/questions/396889/… – kres901567708 Oct 28 '19 at 16:15
• @kres901567708 I've just completely rewritten. I think in this question they are likely tacitly assuming boundary knots that are not any of the four listed and that makes $6$ correct (I was not doing this when I went through it before; I usually use smoothing splines where that doesn't make sense so I assumed no separate boundary knots but i think that was the wrong call here), but I also think the question is not clearly worded and without knowing that they likely want boundary knots I don't think $6$ vs $4$ DoF is clear. – jld Oct 28 '19 at 18:52
• thank you! Would you say in your opinion that I have a valid case to argue the question is unclear and 4 DOF should be an acceptable answer, or is there something in the question that gives away we should be including xmin and xmax as boundary knots? – kres901567708 Oct 29 '19 at 19:43
• @kres901567708 I think it’s unclear but as I’ve thought more about it, with these splines (ie not smoothing or interpolating) it probably is pretty much always the case that the specified knots are interior and wouldn’t be boundary knots. Like when the $\xi$ are thought of as tuning parameters, which I think is the case with a standard regression spline, they’re often put at quantiles of the data which would make them interior – jld Oct 30 '19 at 2:23 | 2020-07-11T21:51:25 | {
"domain": "stackexchange.com",
"url": "https://stats.stackexchange.com/questions/433478/dof-of-natural-cubic-spline",
"openwebmath_score": 0.6516091227531433,
"openwebmath_perplexity": 304.51867510471266,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9736446452420054,
"lm_q2_score": 0.8872045914803097,
"lm_q1q2_score": 0.8638219997289245
} |
https://math.stackexchange.com/questions/522973/lim-x-to0-x-ln-x-without-lhopitals-rule | # $\lim_{x\to0^{+}} x \ln x$ without l'Hopital's rule
I have a midterm coming up and on the past exams the hard question(s) usually involve some form of $\lim_{x\to0^{+}} x \ln x$. However, we're not allowed to use l'Hopital's rule, on this year's exam anyways.
So how can I evaluate said limit without l'Hopital's rule? I got somewhere with another approach, don't know if it's useful:
1. $\lim_{x\to0^{+}} x \ln x = \lim_{x\to0^{+}} x^2 \ln (x^2) = L$
2. $= (\lim_{x\to0^{+}} 2x)(\lim_{x\to0^{+}} x \ln x)$
3. $= 0 * L$
Then I just need to prove that L is finite/exists (which means it must be 0)
• Observing that $x\ln x=\ln(x^x),$ this question is effectively a duplicate of this other one. – Cameron Buie Oct 11 '13 at 21:57
• I do not believe this should be closed, since it describes an interesting aproach to the problem that is absent elsewhere. – André Nicolas Oct 11 '13 at 22:10
• Lovely boldfaced typo. Have a sticky p key. Also shift. – André Nicolas Oct 11 '13 at 22:22
• @Raekye : That is a very clever approach. – Stefan Smith Oct 12 '13 at 1:54
• @AndréNicolas: Couldn't the approach be posted to the other post? I think it would make sense. – Najib Idrissi Oct 12 '13 at 2:55
The idea you described is a very nice one. We fill in the details.
We consider, as in the OP, $x^2\ln(x^2)$, that is, $(2x)(x\ln x)$. If we can show that $x\ln x$ is bounded near $0$, it will follow by Squeezing that $\lim_{x\to 0} x^2\ln(x^2)=0$, and therefore $\lim_{t\to 0^+}t\ln t=0$.
Let $f(x)=x\ln x$. Then $f'(x)=1+\ln x$. It follows that $f(x)$ is decreasing in the interval $(0,e^{-1})$. It reaches a minimum value of $-e^{-1}$ at $x=e^{-1}$.
Since $f(x)$ is negative in our interval, we have $|x\ln x|\le e^{-1}$ in the interval, and we have shown boundedness.
• Ah, that makes sense. I thought I had to use the derivative to show "which direction the function is going" but couldn't spell it out. Thank you very much! – Raekye Oct 11 '13 at 22:12
• A deleted answer gives another way to show that $f(x)$ is bounded: $$0>x\ln(x)=x\int_1^x\frac1t\,dt\geq x(\frac1x(x-1))=x-1>-1$$ when $0<x<1$, so $|f(x)|\leq 2$ when $0<x<1$. – Jonas Meyer Oct 11 '13 at 22:15
• (Now that $f(x)=x\ln(x)$ instead of $2x\ln(x)$, the last line of my comment should say "$|f(x)|\leq 1$".) – Jonas Meyer Oct 11 '13 at 22:57
• Sorry about the little change, in checking for my usual typos I thought there was no point in dragging the $2$ around. – André Nicolas Oct 11 '13 at 22:59
• @Raekye: Please note that in my opinion the approach of user@17762 is "better." My answer was an exercise in pushing through your clever idea. – André Nicolas Oct 12 '13 at 0:27
Let $x=e^{-t}$ and note that as $x \to 0^+$, we have $t \to \infty$. Hence, $$L = \lim_{x \to 0} x \ln(x) = \lim_{t \to \infty} -te^{-t} = -\lim_{t \to \infty} \dfrac{t}{e^t}$$ Now recall that $e^t \geq \dfrac{t^2}2$, because $$e^t =\sum_{k=0}^{\infty}\frac{t^k}{k!} \geq \frac{t^2}{2}$$ Hence, we have $$\lim_{t \to \infty} \dfrac{t}{e^t} \leq \lim_{t \to \infty} \dfrac2t = 0$$ This gives us $L=0$.
• Ah this makes sense too. I selected Andre's answer though because he answered earlier. Thanks for your input though! – Raekye Oct 11 '13 at 22:17
• Can you explain why e^t >= t^2/2 ? I’m not good at math. – plhn Mar 15 '17 at 12:10 | 2019-06-26T22:21:42 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/522973/lim-x-to0-x-ln-x-without-lhopitals-rule",
"openwebmath_score": 0.8570419549942017,
"openwebmath_perplexity": 428.7141092727999,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9825575178175919,
"lm_q2_score": 0.8791467611766711,
"lm_q1q2_score": 0.8638122594591253
} |
https://math.stackexchange.com/questions/2538598/how-would-i-solve-x2-4x-y2-4y-without-knowing-the-answer-beforehand/2538884 | # How would I solve $x^2-4x=y^2-4y$ without knowing the answer beforehand?
The equation is $x^2-4x=y^2-4y$ in the case where $x\ne y$. The answer is $x+y=4$.
I can start from $x+y=4$ and create the equation very easily, and I can substitute $x+4=y$ into the equation and show both sides are equal easily. I just don't get how I would find the answer if I didn't know it before hand, and all I had was the equation? Any advice?
• I just realized, assuming that x and y aren't equal, then x must equal +/- (y-4) and y must equal +/- (x-4), otherwise there's no way x(x-4)=y (y-4). – Hockeyfan19 Nov 27 '17 at 2:11
• Be weary of the line of reasoning; it’s fallacious. Just because $ab = cd$ and $a \neq b$, doesn’t mean $a = c$. That trick only works when we have something like $ab = 0$, whence we can conclude $a$ or $b$ is zero. See the most recent answer to this question for the right application of this idea. It’s subtle. – Bob Krueger Nov 28 '17 at 1:49
\begin{align} x^2 - 4x &= y^2 - 4y \\ x^2 - y^2 &= 4x - 4y \\ (x-y)(x+y) &= 4(x-y) \\ x+y &= 4\end{align} where dividing by $x-y$ is allowed since $x \neq y$.
• It seems so obvious now, thanks for showing the way! I wasn't seeing it at all. – Hockeyfan19 Nov 26 '17 at 21:17
As an alternative, the solution that struck me first was completing the square in both $x$ and $y$. This is common when dealing with quadratics, especially once there are no $xy$ cross-terms. $$x^2 - 4x = y^2 - 4y$$ $$x^2 - 4x + 4 = y^2 - 4y + 4$$ $$(x-2)^2 = (y-2)^2$$ This means that either $x-2 = y-2$ or $x-2 = -(y-2)$, which means either $x = y$ or $x+y = 4$, as desired.
• I actually saw that I could complete the square when I was working on it. I missed that it would progress towards the solution though. Thanks for the alternative approach! – Hockeyfan19 Nov 27 '17 at 1:38
• You're welcome. Look into quadratic forms and conic sections for more general problems of this type. – Bob Krueger Nov 27 '17 at 1:44
• This is the way I first went, so +1 ;) – Lamar Latrell Nov 27 '17 at 4:37
Let $c$ be the common value of $x^2-4x$ and $y^2-4y$. Then $x$ and $y$ are both roots of the polynomial $t^2-4t-c$. Since we are assuming $x$ and $y$ are distinct, they are all of the roots, so $t^2-4t-c$ factors as $(t-x)(t-y)$. Since $(t-x)(t-y)$ expands to $t^2-(x+y)t+xy$, comparing the coefficients of $t$ gives $x+y=4$.
(Conversely, if $x+y=4$, then since $x$ and $y$ are both roots of $(t-x)(t-y)=t^2-(x+y)t+xy=t^2-4t+xy$, $x^2-4x$ and $y^2-4y$ are both equal to $-xy$.)
• Very interesting approach, but where did the -4t come from in your polynomial? – Hockeyfan19 Nov 27 '17 at 2:04
• I'm not sure what you mean. Since $x^2-4x=c$, $x^2-4x-c=0$, and similarly for $y$. So $x$ and $y$ are roots of $t^2-4t-c$. – Eric Wofsey Nov 27 '17 at 2:32
• Okay so it comes from the original equation, I see now – Hockeyfan19 Nov 27 '17 at 2:43
• And you're using the t for clarities sake I think? – Hockeyfan19 Nov 27 '17 at 2:45
Write $x+y=d$. Then we have $y=d-x$ and so: $$(d-x)^2-4(d-x) = x^2-4x$$ so $$d^2-2dx-4d =-8x$$thus $$d(d-2x)-4(d-2x)=0$$ so $$(d-2x)(d-4)=0$$ If $d=2x$ we get $x=y$ which is impossible. So $d=4$ and we have $x+y=4$. | 2019-08-17T13:28:25 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2538598/how-would-i-solve-x2-4x-y2-4y-without-knowing-the-answer-beforehand/2538884",
"openwebmath_score": 0.9949854612350464,
"openwebmath_perplexity": 226.73948778736383,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9825575121992375,
"lm_q2_score": 0.8791467659263148,
"lm_q1q2_score": 0.8638122591865652
} |
https://gateoverflow.in/625/gate2000-1-2 | 941 views
An $n \times n$ array $v$ is defined as follows:
$v\left[i,j\right] = i - j$ for all $i, j, i \leq n, 1 \leq j \leq n$
The sum of the elements of the array $v$ is
1. $0$
2. $n-1$
3. $n^2 - 3n +2$
4. $n^2 \frac{\left(n+1\right)}{2}$
edited | 941 views
square matrix whose transpose is its negation; that is, it satisfies the condition −A = AT. If the entry in the i th row and j th column is aij, i.e. A = (aij) then the skew symmetric condition is aij = −aji
The sum of the $i^{th}$ row and $i^{th}$ column is $0$ as shown below. Since, the numbers of rows $=$ no. of columns, the total sum will be $0$.
$0$ $-1$ $-2$ $-3$ $-4$ $1$ $0$ $-1$ $-2$ $-3$ $2$ $1$ $0$ $-1$ $-2$ $3$ $2$ $1$ $0$ $-1$ $4$ $3$ $2$ $1$ $0$
edited by
this matrix is also a skew symmetric matrix, so definitely it's sum will be 0.
Let there are total N rows . You will find ∑ of elements of row i + ∑ of elements row (N-i+1) = 0.
So if N is even then
row 1 + row N =0
row 2 + row (N-1) =0
row 3 + row (N-2)=0
similarly row (N/2) + row (N/2+1) =0. (So total sum is 0)
But if N is odd then row ((N+1)/2) will have no corresponding rows BUT Ithe summation of elements of this row is 0 .
So for N = even or Odd , the sum of element is 0 .
If you look at code carefully it is very clear matrix getting defined is skew symmetric matrix.
Sum of all elements in skew symmetric matrix is 0.
i think we can easily get it without drawing matrix
as expression given v[i, j] = i - j
suppose i1-j1=k1 {for a particular index } so its opposit index shows j1-i1=-k1, for example if v[1,2]=x then v[2,1]=-x}
so we have cases here
1. for all i>j v[i, j] = i - j and jut for opposit indexof v[i, j] = i - j , v[j, i] = j - i =-(i-j) :: note this is for non diagonal elements
2. for all i=j v[i, j] = i - j=0 :: note this is for diagonal elaments
so total sum will be zero ucan easily get it by seeing above cases
ans is option (a) i.e 0
solution: suppose if n=3
then i<=3 and 1<=j<=3
i.e i=1,2,3, and j=1,2,3
=> v={i-j}=(0,-1,-2,1,0,-1,2,1,0}
sum of elements in v=0
edited by
@prakash What if i take, i=0,1,2. and j=1,2,3...? then it will be skew symmetric matrix..?
+1 vote
sum of all elements =n*( $\sum_{i=1}^{n}i-\sum_{j=1}^{n}j )= 0$ | 2018-01-19T10:11:31 | {
"domain": "gateoverflow.in",
"url": "https://gateoverflow.in/625/gate2000-1-2",
"openwebmath_score": 0.9328866004943848,
"openwebmath_perplexity": 1397.3796243929498,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9825575188391108,
"lm_q2_score": 0.8791467580102418,
"lm_q1q2_score": 0.8638122572459913
} |
https://math.stackexchange.com/questions/2110681/prove-a-cap-b-cup-a-cap-b-a-using-set-identities | # Prove $(A \cap B) \cup (A \cap B')= A$ using Set Identities
I recently started a Discrete Mathematics course in college and I am having some difficulties with one of the homework questions. I need to learn this, so please guide me through at least two steps to get the ball rolling.
The question reads: Show that if $A$ and $B$ are sets, then: $(A \cap B) \cup (A \cap B')=A$
We are supposed to use set identities. I had a question prior, but it was simple: $(A \cap B \cap C)' = A'\cup B' \cup C'$ - Which would be one of De Morgan's laws.
I am at a loss. I have been reading the textbook and tried looking up some videos, but I am not sure exactly where to start. Any help you can provide, will be greatly appreciated!
Thanks, Kei
• I'm not sure what you're asking. Can you clarify what specifically you're confused with? Also I highly reccomend taking a look at "How to Prove It" as a supplementary text. It's a fantastic introduction to this subject. – lordoftheshadows Jan 23 '17 at 18:58
• Use distributivity! LHS is equal to $A \cap (B \cup B')$ – Crostul Jan 23 '17 at 18:58
• @lordoftheshadows: I wasn't sure on the first two steps to prove that the left side is indeed equal to the right side? If I am explaining it right. Our professor showed us an example in class such as this: (A ∪ (BnC)) = (C ∪ B) ∩ A = A ∩ (B ∩ C) - De Morgan Law = A ∩ (B u C) De Morgan Law = (B u C) ∩ A = Commutative Law = (C u B) ∩ A = Commutative Law So I am looking for the first two steps, I see that @Crostul had posted the first step. Thank you! I am going to see if I can take it from there. I do really appreciate the help! – Kei U. Jan 23 '17 at 19:00
• I have edited the question for formatting and some grammatical things for you, @KeiU. We will all see it when it is approved. Good luck! – The Count Jan 23 '17 at 19:03
• Thank you @TheCount! I appreciate that, I really should have looked over the question better, sorry! @Crostul: Do I distribute (A ∩ B) U (A ∩ B`) together? – Kei U. Jan 23 '17 at 19:05
The idea is to achieve get close $B$ and $B^c$. Then we use distributive property: $(A\cap B)\cup(A\cap B^c)=A\cap (B\cup B^c)=A\cap X=A$, with $X$ the universe
• Hello, I really appreciate your answer you provided! I think where I was confused was, being able to reverse an identity. I was using the set identity, though not using it in reverse if that makes sense. This is what I did: I used Distributive law, Absorption law, and then Identity law. – Kei U. Jan 23 '17 at 19:24
• It would not let me edit the above comment. The last sentence should be a question. I wanted to ensure that I did use the right laws above, as you shown in your post Julio Maldonado Henriquez. Thank you! – Kei U. Jan 23 '17 at 19:33
Consider an element of $A$ - either it is in $B$, or it isn't, and thus is in the complement of $B$. Thus $A \subset (A \cap B)$ $\cup$ $(A \cap B')$. Now, try to argue on your own that the reverse "inclusion" holds: that we have $A \supset (A \cap B)$ $\cup$ $(A \cap B')$.
You can use identities such as $(A\cap B) \cup (A \cap C) = A \cap (B \cup C)$ to get $(A \cap B) \cup (A \cap B') = A \cap (B \cup B') = A \cap U = A$.
But I prefer to think of what it is saying. $A \cap B$ means "everything in A and in B" and $A \cap B'$ means "everything that is in A that is not in B" and $(A\cap B) \cup (A \cap B')$ means "every thing that is in A and B combined with everything that is not in B". Is there a logical reason that "everything in A and B combined with everything in A and not in B" would be "A"?
Well, I hope it should be obvious. Everything in A is either in B or not in B so combining the items of A that are not in B with those that are should give you all the items in A.
So the best way to express that idea directly would be:
$A = A \cap U = A \cap (B \cup B') = (A \cap B) \cup (A\cap B')$. Or if that's a little too abstract, I rather like to do an element by element proof:
Let $x \in A$ either $x \in B$ or $x \in B'$. If $x \in B$ then $x \in A \cap B$. If $x \in B'$ then $x \in A \cap B'$. Either way $x \in A \cap B$ or $x \in A\cap B'$ so $x \in (A \cap B) \cup (A\cap B)$. So $A \subseteq (A\cap B) \cup (A \cap B)$. Likewise if $y \in (A \cap B) \cup (A\cap B)$ then either $y \in (A \cap B) \subset A$ or $y \in (A\cap B') \subset A$. Either way, $y \in A$ so $(A\cap B)\cup (A\cap B') \subseteq A$.
$A \subseteq (A\cap B) \cup (A \cap B)$ and $(A\cap B)\cup (A\cap B') \subseteq A$, so (A\cap B)\cup (A\cap B') = A$. A fourth way is the big guns. Let$x \in U$now one of four things might happen: 1)$x \in A$and$x \in B$. Then$x \in A$and$x \in A\cap B$and$x \in (A \cap B) \cup (A \cap B')$. 2)$x \in A$and$x \not \in B$. Then$x \in A$and$x \in B'$and$x \in A \cap B'$and$x \in (A \cap B) \cup (A \cap B')$3)$x \not \in A$and$x \in B$. Then$x \not \in A$and$x \not \in A \cap B$and$x \not \in A \cap B'$so$x \not \in (A \cap B) \cup (A \cap B')$. 4)$x \not \in A$and$x \not \in B$. Then$x \not \in A$and$x \not \in A \cap B$and$x \not \in A \cap B'$so$x \not \in (A \cap B) \cup (A \cap B')$. Looking at the four cases we see$x \in A \iff x \in (A \cap B) \cup (A \cap B')$. Thus$A$and$(A \cap B) \cup (A \cap B')$have precisely the same elements and neither has any element the other doesn't. In other words,$A = (A \cap B) \cup (A \cap B')\$. | 2020-06-05T20:06:34 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2110681/prove-a-cap-b-cup-a-cap-b-a-using-set-identities",
"openwebmath_score": 0.9979856610298157,
"openwebmath_perplexity": 279.08457198967204,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9825575167960731,
"lm_q2_score": 0.8791467580102419,
"lm_q1q2_score": 0.8638122554498614
} |
https://math.stackexchange.com/questions/46969/definition-of-random/47039 | # Definition of random
Suppose that you has to guess given a set of numbers
• If they are random.
• The mathematical expectation
Is there a definition of randomness that allow this prove/test?
Is even possible? if so: How many value would be enough ?
Example:
If numbers come from a coin experiment, results could be coded as 0 or 1,
000100010110100011.....
Then how many "bits" are enough to "test" variable randomness?
According to the law of large numbers, the average of the results (adding the results and dividing by the number of trials) should become closer and closer to the expected value as more trials are performed.
But if we don't know where those numbers come from then we don't know what to expect!
What are the law of large numbers hypothesis?
Does the definition of random cointain a reference to average and to the expected value?
It is deeply confusing to me,
thanks in advance for any information
• Random means that knowing the first $n$ terms of the sequence you cannot say anything about the $n+1$'th term at all besides that all possible combinations for that term to happen have the same probability. – Listing Jun 22 '11 at 19:38
• If you search on testing random number generators you can find a lot of information. It is a large and complicated topic. – Ross Millikan Jun 22 '11 at 20:14
• This is complicated topic indeed. For one thing: would you say that the digits of PI are random? – leonbloy Jun 22 '11 at 20:22
• @Hernan - You might want to look up Kolmogorov complexity, which looks at randomness from a computational viewpoint. – Unreasonable Sin Jun 22 '11 at 20:44
• @Ross Millikan thanks, as I see tests expects (or are aimed to) a certain distribution, it's like having a metadata about the data, as if randomness were not in a set of numbers, but in its interpretation @leonbloy it depends, if you already know numbers come from "PI" or from "a coin experiment" then that's not what I am asking about, because you have extra meta information about the data, the question is about the factibility of judge a set of data as "random", computable/non-computable random, is further discussion, but first I would like to know if e a definition of random is even possible – Hernán Eche Jun 22 '11 at 20:52
You may like to understand the randomness of you sequence heuristically as follows. This may help you to get more intuition.
Write favorite binary sequence you would like to test for randomness in a file and try to compress it (e.g. with zip, etc...).
Then take the ratio between the size of the compressed file and the size of the original one. If the ratio is close to 1, it means the sequence is quite random, and if the ratio is close to zero then it means that the sequence is not very random.
• Yes this is the answer, as @Unreasonable Sin has comment, that's a Kolmogorov randomness definition, and that definition is really great, I have been reading Gregory Chaitin AIT en.wikipedia.org/wiki/Algorithmic_information_theory and is the deeper thing I have read about randomness – Hernán Eche Jul 1 '11 at 19:43
The randomness of a sequence, to use @Listing's definition, can be quantified by the entropy rate.
If the order of the numbers does not matter, you can use a statistical test for randomness.
I recommend reading Chapter 3.5 of Knuth, Seminumerical Algorithms (this book is Volume 2 of The Art Of Computer Programming). In fact, I recommend reading everything Knuth has ever written, but this chapter in particular, titled What is a Random Sequence, will help you clarify your concept of randomness. | 2019-12-07T06:47:12 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/46969/definition-of-random/47039",
"openwebmath_score": 0.7500331401824951,
"openwebmath_perplexity": 513.5345393618926,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9637799462157138,
"lm_q2_score": 0.8962513655129178,
"lm_q1q2_score": 0.8637890928498
} |
https://mathematica.stackexchange.com/questions/6862/plotting-complex-sine?noredirect=1 | # Plotting complex Sine
I've got another plotting problem. I want to plot Sin[z] where z is complex. So, I've tried the following:
Plot3D[ Sin[ x + I y], {x, -1, 1}, {y, -1, 1}]
I wanted to see how the sine function looks like on the unit circle. But... I get no output. Am I doing something wrong or is the kernel stuck?
• You can plot Re[Sin[x + I*y]] and Im[Sin[x + I*y]] separately. – b.gates.you.know.what Jun 15 '12 at 15:35
• Possible duplicate of Plotting Complex Quantity Functions – Jens Aug 7 '12 at 16:36
• – Jens Aug 7 '12 at 16:37
• @Jens It's not a duplicate of those posts since the OP asks for plot of sine on the unit circle, although the issue is quite similar. – Artes Aug 7 '12 at 17:18
• @Artes I see this as a special case of the linked question, but since you answered both, I'll go with your judgement here. – Jens Aug 7 '12 at 17:27
Well, you have to treat the real and imaginary parts separately. You can't really have a complex $z$ value in these plots. Here's one way to visualize complex sine:
Table[Plot3D[f[Sin[x + I y]], {x, -1, 1}, {y, -1, 1},
RegionFunction -> Function[{x, y, z}, x^2 + y^2 < 1]], {f, {Re, Im,
Abs}}] // GraphicsRow
One further visualization aid would be to color these functions by the argument (adapting a scheme by Roman Maeder):
Table[Plot3D[f[Sin[x + I y]], {x, -5, 5}, {y, -5, 5},
ColorFunction -> Function[{x, y, z}, Hue[(Pi + If[z == 0, 0, Arg[Sin[x + I y]]])/(2Pi)]],
ColorFunctionScaling -> False, PlotLabel -> TraditionalForm[f[Sin[z]]],
RegionFunction -> Function[{x, y, z}, x^2 + y^2 < 25]],
{f, {Re, Im, Abs}}] // GraphicsRow
As Artes notes, one could have used ParametricPlot3D[] so that you are directly working with polar coordinates:
Table[ParametricPlot3D[{r Cos[t], r Sin[t], f[Sin[r Exp[I t]]]},
{r, 0, 5}, {t, -Pi, Pi}, BoxRatios -> OptionValue[Plot3D, BoxRatios],
ColorFunction -> Function[{x, y, z}, Hue[(Pi + If[z == 0, 0, Arg[Sin[x + I y]]])/(2 Pi)]],
ColorFunctionScaling -> False, PlotLabel -> TraditionalForm[f[Sin[z]]]],
{f, {Re, Im, Abs}}] // GraphicsRow
Yet another visualization possibility:
Table[ParametricPlot3D[{r Cos[t], r Sin[t], f[Sin[r Exp[I t]]]},
{r, 0, 5}, {t, -Pi, Pi}, BoxRatios -> OptionValue[Plot3D, BoxRatios],
ColorFunction -> Function[{x, y, z}, Hue[(Pi + If[z == 0, 0, Arg[Sin[x + I y]]])/(2Pi)]],
ColorFunctionScaling -> False, MeshFunctions -> (#4 &),
MeshShading -> {Automatic, None}, MeshStyle -> Transparent,
PlotLabel -> TraditionalForm[f[Sin[z]]], PlotRange -> All],
{f, {Re, Im, Abs}}] // GraphicsRow
• wow, that looks great. Thank you! – Chris Jun 15 '12 at 15:43
You can plot in 3 dimensions only real and/or imaginary parts of a function. One can make use of Plot3D, but since there was a question how the sine function looks like on the unit circle, first I demonstrate usage of ParametricPlot3D and later I'll show a few of many possible uses of Plot3D.
When we'd like to use ParametricPlot3D, then instead of parametrizing complex numbers like x + I y we would rather parametrize them like r * Exp[ I u], where r is a radius of a circle and u is a polar angle. On a unit circle this reduces to Exp[ I u].
ParametricPlot3D[
{ { Cos[u], Sin[u], Re @ Sin[Exp[I u]]},
{ Cos[u], Sin[u], Im @ Sin[Exp[I u]]}}, {u, 0, 2 Pi},
PlotStyle -> {{Thick, Darker @ Green}, {Thick, Darker @ Orange}}, BoxRatios -> Automatic]
It would be easier to realize the structure of the graph of Sine, rotating ParametricPlot3D around z axis. Thus we define the following functions :
F1[t_] :=
Graphics3D[
Rotate[
ParametricPlot3D[ Table[{r Cos[u], r Sin[u], Re @ Sin[r Exp[I u]]}, {r, 0.1, 1, 0.1}],
{u, 0, 2 Pi}, PlotStyle -> Thick,
ColorFunction -> (ColorData["DeepSeaColors"][#3] &),
BoxRatios -> Automatic, Axes -> False, Boxed -> False][[1]],
2 Pi t, {0, 0, 1}], Boxed -> False]
F2[t_] :=
Graphics3D[
Rotate[
ParametricPlot3D[ Table[{r Cos[u], r Sin[u], Im @ Sin[r Exp[I*(u)]]}, {r, 0.1, 1, 0.1}],
{u, 0, 2 Pi}, PlotStyle -> Thick,
ColorFunction -> (ColorData["Rainbow"][#3] &),
BoxRatios -> Automatic, Axes -> False, Boxed -> False][[1]],
2 Pi t, {0, 0, 1}], Boxed -> False]
now we can animate rotation around z-axis :
Animate[
Show[{ F1[t], F2[t],
ParametricPlot3D[{{Cos[v], Sin[v], -1},
{Cos[v], Sin[v], 0},
{Cos[v], Sin[v], 1} }, {v, 0, 2 Pi},
PlotStyle -> {Dashed, Dashed, Dashed}, BoxRatios -> Automatic,
Axes -> False, Boxed -> False]},
ViewPoint -> {Pi, Pi/2, 1/2}],
{t, 0, 1}, DefaultDuration -> 15]
The "deepseacolors" and "rainbow" families of curves are respectively parametric 3D - plots of real and imaginary parts of Sine over circles of radius r in the complex plane and the view point rotates around z - axis. The dashed circles are unit circles in planes {x, y} for z in {-1, 0 , 1}. Here the rotation is surplus but still advantageous for the sake of comprehensible visualization.
Now we provide static 3-D plots of Sine in the complex plane.
GraphicsRow[{
Plot3D[Re@Sin[x + I*y], {x, -2 Pi, 2 Pi}, {y, -2 Pi, 2 Pi}, ClippingStyle -> None],
Plot3D[Im@Sin[x + I*y], {x, -2 Pi, 2 Pi}, {y, -2 Pi, 2 Pi}, ClippingStyle -> None]}]
I extended the range of the plot to {x, -2 Pi, 2 Pi} and {y, -2 Pi, 2 Pi} since in your former case there was nothing interesting to see.
To compare with a familiar pattern of the graph of Sine let's restrict the range of the imaginary part of the variable, e.g.
GraphicsRow[{ Plot3D[ Re @ Sin[x + I*y], {x, -2 Pi, 2 Pi}, {y, -0.3 Pi, 0.3 Pi}],
Plot3D[ Im @ Sin[x + I*y], {x, -2 Pi, 2 Pi}, {y, -0.3 Pi, 0.3 Pi}]}]
or to get the equal scale for all dimensions
GraphicsRow[
{Plot3D[ Re @ Sin[x + I*y], {x, -2 Pi, 2 Pi}, {y, -0.4 Pi, 0.4 Pi},
BoxRatios -> Automatic, PlotLabel -> "Real part"],
Plot3D[ Im @ Sin[x + I*y], {x, -2 Pi, 2 Pi}, {y, -0.4 Pi, 0.4 Pi},
BoxRatios -> Automatic, PlotLabel -> "Imaginary part"] },
PlotLabel -> "Graphs of Sine"]
and if you prefer the both parts of Sine in the complex plane in one plot :
Plot3D[{ Re @ Sin[x + I*y], Im @ Sin[x + I*y]},
{x, -2 Pi, 2 Pi}, {y, -0.4 Pi, 0.4 Pi},
Mesh -> {5, 3}, BoxRatios -> Automatic,
PlotStyle -> {{Opacity[0.35], Lighter[Green, 0.5]},
{Opacity[0.7], Lighter[Blue, 0.7]} } ]
• For a different visualization, on the Riemann sphere, see the paper "Visualizing Complex Functions with the Presentations Application," The Mathematica Journal, vol. 11 #2 (2009), by David J. M. Park and me. Available in CDF and PDF here. (To re-evaluate most code, and to run the dynamic examples, you'll need a copy of Park's Presentations application.) – murray Aug 7 '12 at 16:57
• @murray Thank you for pointing out interesting references. I've seen that paper. – Artes Aug 7 '12 at 17:01 | 2020-02-23T22:53:04 | {
"domain": "stackexchange.com",
"url": "https://mathematica.stackexchange.com/questions/6862/plotting-complex-sine?noredirect=1",
"openwebmath_score": 0.3071395456790924,
"openwebmath_perplexity": 4979.049729186961,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.959154281754899,
"lm_q2_score": 0.9005297847831082,
"lm_q1q2_score": 0.8637469989225359
} |
https://math.stackexchange.com/questions/2356368/prove-that-if-m-1-subseteq-m-2-then-infm-2-leq-infm-1-leq-su | # Prove that if $M_{1} \subseteq M_{2}$, then inf$(M_{2})\leq$ inf$(M_{1})\leq$ sup$(M_{1})\leq$ sup$(M_{2})$
Prove that if $M_{1} \subseteq M_{2}$, then inf$(M_{2})\leq$ inf$(M_{1})\leq$ sup$(M_{1})\leq$ sup$(M_{2})$
My attempt:
$M_{1} \subseteq M_{2} \implies \forall m\in{M_{1}}$, $m\in{M_{2}}$
$\implies$inf$(M_{2}) \leq$ inf$(M_{1})$ and also that sup$(M_{1})\leq$ sup$(M_{2})$
Additionally, by the definition of supremum we know that inf$(M_{1})\leq$ sup$(M_{1})$
Together we have, inf$(M_{2})\leq$ inf$(M_{1})\leq$ sup$(M_{1})\leq$ sup$(M_{2})$
$\therefore$ If $M_{1} \subseteq M_{2}$, then inf$(M_{2})\leq$ inf$(M_{1})\leq$ sup$(M_{1})\leq$ sup$(M_{2})$
I made a few jumps that I am not sure you can take (line 1 to 2). Is this proof valid? Anything I can change? Thanks!
• Hmm, I think your jumps are too big. How does all m in both M_1 being in M_2 imply the inf M_2 is less or equal to the inf of M_1? How do we know from the definition of sup that inf <= sup? That's not actually part of the definition. I sympathize, as this real does seem trivial and obvious and thus irritatingly difficult to prove. But you I don't think your prove has actually done anything except restate what is to be proven and declared they are obvious. (Which to be fair they sort of are.) Jul 12 '17 at 17:40
There seems to be nothing wrong with your proof, but can you tell us how did you go from $(\forall m\in M_1):m\in M_2$ to $\inf M_2\leqslant\inf M_1$?
• This means that inf$(M_{1})$, sup$(M_{1})\in{M_{2}}$. I guess I should explicitly state that right? edit: Actually not sure that is correct Jul 12 '17 at 16:52
• @dawgchow My mistake for the earlier comment. That's not necessarily true if you think about it Jul 12 '17 at 16:52
• @dawgchow No, you shouldn't, because it is not true. Do you want a counter-example? Jul 12 '17 at 16:53
• Ya because if inf$(M_{1})$ is not the minimum of $M_{1}$ it wouldn't necessarily be in $M_{2}$ Jul 12 '17 at 16:54
• @dawgchow Right! So, your proof is incomplete. Jul 12 '17 at 16:55
Here's how I would do it:
By the definition of subsets, $\inf$ and $\sup$, we have the following:
$$M_1\subseteq M_2\iff (\forall m\in M_1)\,\,\,m\in M_2$$ $$(\forall m\in M_2)\,\,\,\inf(M_2)\le m\le \sup(M_2)$$
Then we can conclude
$$(\forall m\in M_1)\,\,\,\inf(M_2)\le m\le \sup(M_2)$$
Next, from the definition of $\inf$ and $\sup$, we get
$$(\forall m\in M_1)\,\,\,x\le m\le y \iff x\le\inf(M_1)\le\sup(M_1)\le y$$
Therefore
$$\inf(M_2)\le \inf(M_1)\le\sup(M_1)\le \sup(M_2)$$
When you are asked to prove something trivial and obvious... well, do the definitions. I think your prove relies on "common sense" and makes jumps that are simply too big, to the point you are mostly just restating the statements.
I'd do: If $m \in M_1$ then $m \in M_2$ as $M_1 \subset M_2$. So $\inf M_2 \le m$ by definition of infinum. So $\inf M_2$ is a lower bound of $M_1$. But $\inf M_1$ is the greatest lower bound of $M_1$ so $\inf M_2 \le \inf M_1$.
By identical argument: $\sup M_2 \le \sup M_1$. That is; if $m \in M_1$ then $m \in M_2$ and therefore $\sup M_2 \ge m$ and is an upper bound of $M_1$, but as $\sup M_1$ is the least upper bound $\sup M_2 \ge \sup M_1$.
By definition of supremum and infimum for any $m \in M_1$ then $\inf M_1 \le m \le \sup M_1$ so $\inf M_1 \le \sup M_1$. (Unless $M_1$ is empty, in which case neither $\inf M_1$ nor $\sup M_1$ exist.) (I suppose at the very beginning of the proof I could/should have made a comment that $M_1$ and $M_2$ are both presumed to be non-empty and bounded above and below.).
Hence ... result.
That's basically your proof but with the jumps explicitly explained. (Perhaps painfully so.)
=====
And, to be fair, maybe I'm being to0 glib in claiming "$\inf M_1$ is greatest lower bound".
More detail: If $\inf M_1 < \inf M_2$ then $\inf M_2$ is not a lower bound of $M_1$ which we just showed it is, so $\inf M_2 \le \inf M_1$.
That's kind of obvious but as I criticized you for not proving the obvious, it's only fair that I apply my own standards... | 2022-01-27T15:33:22 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2356368/prove-that-if-m-1-subseteq-m-2-then-infm-2-leq-infm-1-leq-su",
"openwebmath_score": 0.9139547348022461,
"openwebmath_perplexity": 214.14570947262243,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9843363501395789,
"lm_q2_score": 0.8774767890838836,
"lm_q1q2_score": 0.863732299899027
} |
https://math.stackexchange.com/questions/1459979/establishing-a-bijection-between-permutations-and-permutation-matrices | # Establishing a bijection between permutations and permutation matrices.
I am trying to prove the following:
Given $\sigma \in S_n$ let $P(\sigma)$ be the matrix with $(P(\sigma))_{i,j} = \delta_{i,\sigma(j)}$. Show that $P$ is a bijection between $S_n$ and the set of permutation matrices of size $n$ $-$ where $\delta_{i,j}$ is the Kronecker delta which equals 1 if $i=j$ and 0 otherwise.
As I understand the question, the question is saying that for each row $i$ and column $j$ we have that position $i,j$ equals 1 iff $\sigma(j) = i$.
So then it seems then that for any $\sigma$ such that $\sigma(i) = i$, we would have $P(\sigma)$ as the identity matrix with strictly 1's from the top-left to the bottom-right and zeros everywhere else. On the other hand, suppose that we have $\sigma(1) = 2$, $\sigma(2) = 3$, $\sigma(3) = 4$, $\sigma(4) = 1$; then we'd have the following matrix
\begin{bmatrix}0 & 0 & 0& 1\\1 & 0 & 0 & 0\\0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0\end{bmatrix}
Is this a correct understanding?
If so, then here is my attempted proof of the question mentioned above:
$\bf{Injectivity}$: Assuming $\sigma, \tau \in S_n$ and $P(\sigma) = P(\tau)$ then whenever $\sigma(j) = i$ we have the jth-column and i-th row of the matrix $p$ as a 1 and similarly for $\tau(j) = i$. So $\tau = \sigma$ and we are done.
$\bf{Surjectivity}$: Let $P$ be some $n \times n$ permutation matrix. Then each row and column will have exactly one 1 with zeros everywhere else. Then for every i,j position which has a 1 in it, we can choose a permutation $\sigma$ such that $\sigma(j) = i$ for some $\sigma$ which is an n-cycle and we are done.
Is this proof sound? Thank you in advance.
You're proof is fine, but more can be said. The set $P_n$ of $n\times n$ permutation matrices is a group under matrix multiplication, and as such $S_n\cong P_n$. Indeed, let $\{v_1,\ldots,v_n\}$ be a basis for $\mathbb{R}^n$ (you can take any field here, but nevermind). For each $\sigma\in S_n$, we define a linear transformation $P_\sigma$ by $P_\sigma(v_i)=v_{\sigma(i)}$, whose matrix in the basis $\{v_1,\ldots,v_n\}$ is $P(\sigma)$.
Let $\Phi:S_n\longrightarrow P_n$ be the map $\Phi(\sigma)=P_\sigma$. This map is a homomorphism since $$P_\sigma P_\tau(v_i)=P_\sigma(v_{\tau(i)})=v_{\sigma(\tau(i))}=v_{\sigma\tau(i)}=P_{\sigma\tau}(v_i).$$
The map is injective: if $P_\tau v_i=v_{\tau(i)}=v_i$ for all $i$, then $\tau(i)=i$ for all $i$ and $\tau=1$.
Finally, the map is surjective because $|P_n|=n!$ (permutation matrices are allowed one nonzero entry in every row and column. Starting with the leftmost column, you have $n$ choices for where to place a nonzero entry; having made this choice you have occupied a row, so going to the next column you have $n-1$ choices for where to place a nonzero entry, etc.)
• Thanks. That makes sense as well. – letsmakemuffinstogether Oct 1 '15 at 18:58
• There is another component to the question: show that $P: S_n \rightarrow M_n{\mathbb{R}}$ has $P(\sigma\tau)=P(\sigma)P(\tau)$. Any hints on how to do this? I think I see how it's done but I'm having troubles putting it into words and using summation notation to multiply the matrices $P(\sigma)$ and $P(\tau)$. – letsmakemuffinstogether Oct 1 '15 at 20:07
• @letsmakemuffinstogether that is my proof that $\Phi$ is a homomorphism. – David Hill Oct 1 '15 at 21:46
It can also be shown that the map $$\Phi: \mathcal{S}_n \longrightarrow \mathcal{P}_n$$ defined by $$\sigma \in \mathcal{S}_n \longmapsto P_\sigma \in \mathcal{P}_n$$ is a homomorphism and hence an isomorphism.
If $$\sigma$$, $$\gamma \in \mathcal{S}_n$$ and $$1 \le i,j \le n$$, then $$\left[ P_\sigma P_\gamma\right]_{ij} = \sum_{k=1}^n \delta_{i,\sigma(k)} \delta_{k, \gamma(j)} = \delta_{i, \sigma(\gamma(j))} = \left[ P_{\sigma \circ \gamma}\right]_{ij},$$ i.e., $$P_{\sigma} P_{\gamma} = P_{\sigma \circ \gamma}$$.
Thus, \begin{align} \Phi(\sigma\circ\gamma) = P_{\sigma \circ \gamma} = P_\sigma P_\gamma = \Phi(\sigma)\Phi(\gamma) \end{align} as desired. | 2019-09-22T16:57:26 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/1459979/establishing-a-bijection-between-permutations-and-permutation-matrices",
"openwebmath_score": 0.9896159172058105,
"openwebmath_perplexity": 74.33499793102257,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9843363508288305,
"lm_q2_score": 0.8774767858797979,
"lm_q1q2_score": 0.8637322973499314
} |
https://math.stackexchange.com/questions/977388/limit-of-a-0-0-function/977399 | # Limit of a 0/0 function
Let's say we have a function, for example, $$f(x) = \frac{x-1}{x^2+2x-3},$$ and we want to now what is $$\lim_{x \to 1} f(x).$$ The result is $\frac{1}{4}$.
So there exists a limit as $x \to 1$.
My teacher says that the limit at $x=1$ doesn't exist. How is that? I don't understand it. We know that a limit exists when the one sided limits are the same result.
Thank you!
• Try factoring the denominator. This is probably a homework problem, so look at the numerator for a hint. – copper.hat Oct 16 '14 at 22:35
• @copper.hat: I completely disagree! In the definition of "$\lim_{x\to 1} f(x)$", $f(1)$ doesn't need to be defined (in fact, in most interesting cases it isn't), and even if it is defined, that value shouldn't be taken into account. Adding "$x \neq 1$" doesn't make any difference whatsoever. – Hans Lundmark Oct 17 '14 at 7:13
• @HansLundmark: I stand corrected. – copper.hat Oct 17 '14 at 15:03
It's possible that your teacher was pointing out the fact that the function doesn't exist at $x = 1$. That's different from saying that the limit doesn't exist as $x \to 1$. Notice that by factoring, $$f(x) = \frac{x-1}{x^2 + 2x - 3} = \frac{x-1}{(x-1)(x+3)}$$
As long as we are considering $x \ne 1$, the last expression simplifies: $$\frac{x-1}{(x-1)(x+3)} = \frac{1}{x+3}.$$ In other words, for any $x$ other than exactly $1$, $$f(x) = \frac{1}{x+3}.$$ This helps understand what happens as $x$ gets ever closer to $1$: $f(x)$ gets ever closer to $$\frac{1}{(1) + 3} = \frac{1}{4}.$$
• The word 'exactly' unnecessary. – CiaPan Oct 17 '14 at 8:12
• @CiaPan: What about the word 'is'? – Nikolaj-K Oct 17 '14 at 13:43
• @NikolajK that depends on what 'is' is. – Yakk Oct 17 '14 at 14:53
• @Yakk: It's equivalent to equivalence in univalent foundations. – Nikolaj-K Oct 17 '14 at 16:37
Your teacher is not correct. There are two easy ways to do this problem. The first is by factoring the denomiator:
$$\lim_{x\to 1}\frac{x-1}{(x-1)(x+3)}=\lim_{x\to 1}\frac{1}{x+3}=\frac{1}{4}$$
The second is by using L'Hospital's rule, which is a useful identity in limits. By L'Hospital's rule, we know that
$$\lim_{x\to 1}\frac{x-1}{x^2+2x-3}=\lim_{x\to 1}\frac{1}{2x+2}=\frac{1}{4}$$
This limit exists, because it is simply a discontinuity in the function, but it is a discontinuity at a single point. When we have certain indeterminate forms in limits, we may apply L'Hospital's rule, which allows us to better compute the limit.
L'Hospital's rule states that, in certain indeterminate forms:
$$\lim_{x\to n}\frac{f(x)}{g(x)}=\lim_{x\to n}\frac{f'(x)}{g'(x)}$$
It is worth clearing up a particular misconception that seems to have arisen. For $$f(x)=\frac{x-1}{x^2+2x-3}$$ we cannot compute the value of $f(1)$, because this results in an indeterminate form. However, the limit exists, because there is simply a local discontinuity at a single point in an otherwise continuous function.
• A third alternative, to whoever may care, is to note that the limit if $\dfrac 1{f'(1)}$, where $f(x)=x^2+2x-3$. – Git Gud Oct 16 '14 at 23:57
• To justify the use of l'Hospital, you also need to point out that $g' \neq 0$ in a punctured neighbourhood of the point in question. – Hans Lundmark Oct 17 '14 at 7:14
• A hard requirement of the usability of l'Hôpital's rule is that the resulting "right-hand-size" is exists. But I guess that's what Hans is saying in more fancy terms? – rubenvb Oct 17 '14 at 8:00
• @rubenvb: No, it's not enough that $\lim f/g$ is of type $0/0$ and that $\lim f'/g'$ exists. There are examples which show this. You really need $g'$ to be nonzero near the point. (Those examples are a bit artificial to be honest, but still...) – Hans Lundmark Oct 17 '14 at 15:10
• @Hans $g'$ can be zero if $f'$ is zero, because you just have another L'Hospital's case and take $f''/g''$ Otherwise, just compute the limit normally. – Aza Oct 17 '14 at 16:13
I don't know what your teacher means exactly. Limits are defined when $x$ tends to some number, or infinity. Not when $x$ is this number.
The value that the function takes at the limit poit is irrelevant (to compute the limit). In fact, in most high school limit exercises, the function is not defined at the point that $x$ tends to. | 2019-08-21T06:57:28 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/977388/limit-of-a-0-0-function/977399",
"openwebmath_score": 0.8828755617141724,
"openwebmath_perplexity": 307.7773361316398,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9770226307590189,
"lm_q2_score": 0.8840392817460333,
"lm_q1q2_score": 0.863726384745823
} |
http://sbwt.ciiz.pw/distance-between-two-coordinates-calculator.html | # Distance Between Two Coordinates Calculator
Again, a distance and direction. Algebra -> Customizable Word Problem Solvers -> Geometry-> SOLUTION: The distance between two points in the coordinate plane is equal to the square root of the sum of the squares of the difference between the x-coordinates and the difference between Log On. Practice applying the Pythagorean Theorem in this tutorial about the distance formula. A journey meter calculate driving or walking distances from any location and displays fuel cost, taxicab fare, using haversine formula. 02/28/2018; 14 minutes to read; In this article. Hi Chua, You can use google API's for that, I think this one gives you duration and distance between 2 places. For two points P 1 = (x 1, y 1) and P 2 = (x 2, y 2) in the Cartesian plane, the distance between P 1 and P 2 is defined as: Example : Find the distance between the points ( − 5, − 5) and (0, 5) residing on the line segment pictured below. The first 2 parameters declare the x and y coordinates of the first point, and the second 2 parameters declare the x and y coordinates of the second point. I turned to my web browser and googled it, sure enough, there was this R package called ‘geosphere’ from Robert J. SHORTEST DISTANCE BETWEEN TWO POINTS ON A SPHERE It is known that the shortest distance between point A and point B on the surface of a sphere of radius R is part of a great circle lying in a plane intersecting the sphere surface and containing the points A and B and the point C at the sphere center. This is the snippet Calculate The Distance of Two Points On a Coordinate Plane on FreeVBCode. There are a number of latitude/longitude distance calculators available online. In this exercise you will plot the positions of the 2 players and manually calculate the distance between them by using the Euclidean distance formula. Nothing else makes sense and I see that you were able to calculate a distance in ft. Calculation of geographical distance is a very important utility function in GPS related procedures. The first 2 parameters declare the x and y coordinates of the first point, and the second 2 parameters declare the x and y coordinates of the second point. This distance and driving directions will also be displayed on google map labeled as Distance Map and Driving Directions US. On this page by using the mileage calculator you can find the flight distance or driving distance between any two cities in the world. Solution : Yes, First, convert the latitude and longitude values from decimal degrees to radians. Distance calculation. This also provides free sample source codes in PHP, ASP, ColdFusion, C/C++, C#, Java, Perl, Visual Basic and Javascript. google map api. angle between two lat lon points. This article is a sequel to the previous article on the same topic, but using T-SQL for calculation - Calculate distance between two points on globe from latitude and longitude coordinates. Hi everybody, i have some problem to calculate the distance between two points, in my case i have a file with 16 columns and i'm interesting to 6th, 7th, 8th column that are rispectively the x, y and z coordinates of several atoms belonging to a protein, instead in 14th 15th and 16th columns there are the x,y and z coordinates of different several atoms belonging to another protein (like a pdb. Fractions should be entered with a forward such as '3/4' for the fraction $$\frac{3}{4}$$. , X0, Y0 and X1, Y1 and click calculate to know the distance between 2 points in 2-dimensional space. Calculate the distance. GIS question: excel formula to calculate distance between two points given their coordinates (latitude / longitude). com can calculate the shortest distance and the fastest distance between any two cities or locations. Is it really possible? The answer is "YES", not. If I want to calculate the distance between two positions, how can I achieve this? Learn. In order to fully grasp how to plot polar coordinates, you need to see what a polar coordinate plane looks like. This will compute the great-circle distance between two latitude/longitude points, as well as the middle point. In this post, we show the formula to calculate the shortest distance between two points using Latitude and Longitude. Language Objectives: After completing the activity, students should be able to. Enter 2 sets of coordinates in the x y-plane of the 2 dimensional Cartesian coordinate system, (X 1, Y 1) and (X 2, Y 2), to get the distance formula calculation for the 2 points and calculate distance between the 2 points. 5678, 11087. Star 1 Right Ascension: Enter the Right Ascension of the first star in hours. ' '===== ' Calculate geodesic distance (in m) ' between two points specified by ' latitude/longitude (in numeric ' [decimal] degrees) ' using Vincenty inverse formula ' for ellipsoids '===== ' Code has been ported by lost_species ' from www. This uses the ‘haversine’ formula to calculate the great-circle distance between two points – that is, the shortest distance over the earth’s surface – giving an ‘as-the-crow-flies’ distance between the points (ignoring any hills they fly over, of course!). This demo program will calculate the distance between two points on Earth, using the latitude and longitude positions. View Details ». The thing I did kind of worked to find the shortest distance from 2 locations, and then I referenced it to 3 locations in all and averages it out. coordinates and two. This calculation can be useful when trying to determine the distance for logistical purposes (ie delivery service, flights, distance between customers, etc). Please write the origin and destination city name, choose the distance unit and press calculate. I am storing the coordinates in two. However, I would like to calculate the distance between the points before I run my script and without an ArcGIS. Write, compile, and execute a C program that calculates the distance between two points whose coordinates are (7,12) and (3,9). The term Haversine was coined by. 84 return list gives you three calculations--the first two assume the Earth is a perfect sphere, which it is not, and the third that is an ellipsoid, which is closer to the truth. Distance between two locations on the Earth We often describe a location on Earth by its latitude and longitude. It is not very often that someone gives the latitude and longitude of their town! The use of a distance and direction as a means of describing position is therefore far more natural than using two distances on a grid. The Bearing Distance Calculator function calculates the forward and backward azimuths between two specified coordinates as well as the distance. txt, the XY coordinates of the cities. Perform the same operation for the y coordinates. This page helps you to calculate great-circle distances between two points using the ‘Haversine’ formula. Calculate the Distance Between Two Coordinates (latitude, longitude) - PHP - Snipplr Social Snippet Repository. I am looking for a way to get the distance in pixels between two MapItems. Just the other day, my friend was asking me if there was an easy way to calculate the distances between two locations with geocodes (Longitude and Latitude). When calculating the distance between two points on a coordinate system we are applying Pythagoras' Theorem. Standard measurement equipment (rulers, protractors, planimeters, dot grids, etc. As homework we were assigned to enter the following code to calculate the distance between two points on the x and y plane. 42 (rounded to the nearest 100th) How to use the Distance Formula Calculator. This means of location is used in polar coordinates and bearings. For example, in a button you can have the following formula on its OnSelect property:. In the attached file "Circle2", the coordinates of the circles are located under column B & C, the coordinates of the points are located under column F & calculate the minimum distance between two sets of coordinates. Enter 2 sets of coordinates in the 3 dimensional Cartesian coordinate system, (X 1, Y 1, Z 1) and (X 2, Y 2, Z 2), to get the distance formula calculation for the 2 points and calculate distance between the 2 points. Time and Date Duration – Calculate duration, with both date and time included Date Calculator – Add or subtract days, months, years. Function accepts four parameters, source latitude, source longitude, destination latitude, destination longitude and returns the distance between the. 13365 i currently have the code, but that doesnt seem to work well. If you pass an address as a string, the service will geocode the string and convert it to. "Let's look at the diagram! I can see that the lines of longitude get closer and closer together towards the poles! At the equator, the distance between 15 and 30 degrees W longitude is quite a lot! But as you follow those two longitude lines towards the poles, the distance between them shrinks down to zero!. This script calculates distances, bearing and more between the two Latitude/Longitude points. This tool can measure two types of distance types, the first is straight line distance also known as Rhumb line distance. 28 , rounded to two decimal places. I would like to share a MySQL function to calculate distance between two latitude – longitude points. The easiest way I could think of to to this is to somehow store the output of veclen(x,y) to a macro. Free sample source codes in PHP, ASP, ColdFusion, C/C++, C#, Java, Perl, Visual Basic and Javascript. Calculate with Geo Coordinates Calculators for the conversion of geo coordinates, as delivered by a GPS tool, for the distance of two point and for bearing. Calculate the distance between them with the distance. It contains two vertical lines called axis. If the current coordinate system is an earth coordinate system, Distance( ) returns the great-circle distance between the two points. The program should ask the user to enter two points then should calculate the distance between two points and print the distance on the screen. Calculating Distance. I am looking for a way to get the distance in pixels between two MapItems. In this post, we will learn the distance formula. Distance and midpoint calculator This online calculator will compute and plot the distance and midpoint for two points in two dimensions. The slope of a line in the plane containing the x and y axes is generally represented by the letter m, and is defined as the change in the y coordinate divided by the corresponding change in the x coordinate, between two distinct points on the line. DISTANCE BETWEEN TWO POINTS. The distance returned is the arc length of a great circle connecting the two points, essentially air miles. West and South locations are negative. Distances calculator is a free tool to calculate distances between any two cities in the world. There is more information on how to calculate these figures below the tool. d = √ 5 2 + 7 2. MySQL function to calculate the distance between two coordinates using the Haversine formula. The formula assumes that the earth is a sphere, (we know that it is "egg" shaped) but it is accurate enough * for our purposes. The distance between 2 points on a graph is really the hypotenuse of a right-angled triangle. Calculate the great circle distance between two points does not want to give me a reading. The shortest distance between two points on the surface of a sphere is an arc, not a line. Note: The flight distances provided are close approximations as all flights differ based on weather, traffic, and the exact route determined by air traffic control. Click Calculate Distance, and the tool will place a marker at each of the two addresses on the map along with a line between them. Take for example, a dating website which shows potential matches to a user within a 15 mile radius or a taxi business which calculates taxi fares based on distance between two locations. If you want to determine the distance between two points on a plane (two-dimensional distance), use our distance calculator. The code will show you how to do that using Latitude and Longitude coordinates. Spherical to Cylindrical coordinates. A more mathematical approach, you could use the Pythagorean Theorem and calculate the hypotenuse using the right triangle with the grid units in unity. If you pass coordinates, ensure that no space exists between the latitude and longitude values; destinations — One or more addresses and/or textual latitude/longitude values, separated with the pipe (|) character, to which to calculate distance and time. The program should ask the user to enter two points then should calculate the distance between two points and print the distance on the screen. Position, Distance and Bearing Calculations Whitham D. 458 W 71 27. The API can convert a zip code to the primary location for the zip code. Answered Active Solved. To find the distance between two places, enter the start and end destination and this distance calculator will give you complete distance information. 05W) A program for HP50G or 42S or 41C would be fine or a formula or algorithm as well. By continuing to browse this site, you agree to this use. How do you find the distance between two points? Distance Formula : Example: For two points, (3,2) and (15, 10) the distance is calculated as: Distance = 14. It is not very often that someone gives the latitude and longitude of their town! The use of a distance and direction as a means of describing position is therefore far more natural than using two distances on a grid. We have successfully combined latitude and longitude into the GeoLoc field. Discover how to calculate Distance by Latitude and Longitude using JavaScript. x A means the x-coordinate of point A y A means the y-coordinate of point A. Another method for calculating the distance between two points that fall on the same line is to plot the points and count the amount of boxes in between the two points. This calculator computes the great circle distance between two points on the earth's surface. calculate-distance-between-two-latitude-longitude-points-11152 contains nodes provided by the following 2 plugin(s): KNIME Base Nodes. It’s quick, easy and takes but a moment to do because you only need to enter the x and y coordinates of two points and click a button to calculate it. For some websites, it is a necessity to calculate the distance between certain locations. Find altitude by coordinates on google maps in meters and feet. If you are not sure what the gps coordinates are, you can use the coordinates converter to convert an address into latlong format or vice versa. The terminal coordinates program may be used to find the coordinates on the Earth at some distance, given an azimuth and the starting coordinates. Inputs can be in several formats: GPS Coordinates (like N 42 59. As you start to write the name of a city or place, distance calculator will suggest you place names automatically, you may choose from them to calculate distance. With the growing distribution of GPS devices and tools such as Google Earth or GeoPosition it is easy to determine the geographical coordinates of interesting points on the earth's surface. The geographical coordinates of the two points, as (latitude, longitude) pairs, are and respectively. If you have two geohashes, you first need to decode them into latitude and longitude: GEOHASH_DEC_LAT(#GeoHash) GEOHASH_DEC_LONG(#GeoHash) After you have your coordinates you can calculate the distance: IF(!. Practice applying the Pythagorean Theorem in this tutorial about the distance formula. First, sketch the two UTM coordinates onto a rectangle. In this article, you will learn how to Get Distance between two Coordinates Using Xamarin. For more information on how it distances are calculated on a sphere, have a look at Haversine Formula on Wikipedia, it's a bit complex, hence us not wanting to duplicate the content. Distance Calculation Introduction. Calculate distance between a pair of lat/lon coordinates I recently had a need to calculate distance between a large number of latitude/longitude coordinate pairs. Plane equation given three points. The Haversine Formula For two points on a sphere (of radius R) with latitudes φ1 and φ2, latitude separation Δφ = φ1 − φ2, and longitude separation Δλ, where angles are in radians, the distance d between the two points (along a great circle of the sphere; see spherical distance) is related to their locations by the formula above. After finding the 'distance' (it is in. The distance between the two coordinates, in meters. First, note that it's very easy to get a distance between two points on a sphere if you know the angle of the arc between them: just multiply it by the radius. Suppose it is desired to calculate the distance d from the point (1, 2) to the point (3, -2) shown on the grid below. The question Calculating the planets and moons based on Newtons's gravitational force was pretty much answered with two items: Use a reasonable ODE solver; at least RK4 (the classic Runge-Kutta me. For more information, see Measure Distances Between Data Points and Locations in a Map. Enter a city, street, address, postal code or region and click calculate distance. Distance Calculator: This easy tool is very useful to find travel distances between cities, and its respective estimated time en route. Haversine Formula – Calculate geographic distance on earth. Travelmath helps you find driving distances based on actual directions for your road trip. Enter either: decimal latitudes/longitudes with minus sign for South and West. This tool calculates the straight line distance between two pairs of latitude/longitude points provide in decimal degrees. You can obtain the coordinates for just about any earthly city from WWW. Know how to use the distance formula to find the distance between points. Is there anything to improve? Calculate the distance given. Capable estimates total distance between any location using haversine formula and route method provided by the map and display location coordinates and location address. The terminal coordinates program may be used to find the coordinates on the Earth at some distance, given an azimuth and the starting coordinates. distancesfrom. Free distance calculator - Compute distance between two points step-by-step. A line through three-dimensional space between points of interest on a spherical Earth is the chord of the great circle between the points. What Is a Vector? A vector has size, also known as magnitude, and direction. Suppose it is desired to calculate the distance d from the point (1, 2) to the point (3, -2) shown on the grid below. Algebra -> Customizable Word Problem Solvers -> Geometry-> SOLUTION: The distance between two points in the coordinate plane is equal to the square root of the sum of the squares of the difference between the x-coordinates and the difference between Log On. Further, there is a one-to-one correspondence between areal coordinates and all points on the plane P. Distance = √ (x 2 – x 1) 2 + (y 2 – y 1) 2. Re: How to calculate distance between two coordinates As you are doing a different syllabus to ours I don't know what method they use; if the questions on GHA are anything to go by, you'll probably find they are using Spherical Trigonometry. Distance between two adjacent integer (whole numbers such as 1 and 2, or 25 and 26, not 13. The distance between the two coordinates, in meters. What is the distance between points B & C? What is the distance between points D & B? What is the distance between points D & E? Which of the points shown above are $4$ units away from $(-1, -3)$ and $2$ units away from $(3, -1)$?. Calculator Use. Find altitude by coordinates on google maps in meters and feet. Calculate the distance as-the-crow-flies between two Latitude/Longitude points on Earth You can enter the Latitude (East - West) and Longitude (North - South) coordinates as given by Google Earth software. The distance problem can be solved by using the Haversine formula. hi, i have a pair of latitude and longitude and i want to calculate the distance between these two points. Just the other day, my friend was asking me if there was an easy way to calculate the distances between two locations with geocodes (Longitude and Latitude). Cartesian to Cylindrical coordinates. The distance formula is derived from the Pythagorean theorem. Notice the line colored green that shows the same exact mathematical equation both up above, using the pythagorean theorem, and down below using the formula. The java program finds distance between two points using manhattan distance equation. Distance Formula The distance formula can be obtained by creating a triangle and using the Pythagorean Theorem to find the length of the hypotenuse. It can produce a map of the flight route and returns a link to enroute weather information. If you do not know the datum of the coordinates the information is not useless for a general ideas of your location -- but for for mapping work the answers you. I have found a couple of solutions that do this for zip codes, but not for a physical address. Rect) This code is lacking a zillion essential features (but interpoint distance can now be calculated). If you want to determine the distance between two points on a plane (two-dimensional distance), use our distance calculator. The center of Rome is located at roughly 41. The distances and times returned are based on the routes calculated by the Bing Maps Route API. Valid input formats are at the bottom of this page. The distance value in red color indicates the air (flying) distance, also known as great circle distance. 'OUTPUT: Distance between the ' two points in Meters. The formula assumes that the earth is a sphere, (we know that it is "egg" shaped) but it is accurate enough * for our purposes. The script uses Haversine formula, which results in in approximations less than 1%. A proof of the Pythagorean theorem. Note: The flight distances provided are close approximations as all flights differ based on weather, traffic, and the exact route determined by air traffic control. ) cannot be used to measure distance, angle, area, or shape on a sphere, as these tools have been constructed for use in planar models. If you need to get that information relating to distances between points, use the GPS Latitude and Longitude Distance Calculator. coordinates from browser. since the distance between first one and second one is already calculated there is no need to do it again. NET 4 Framework or above and reference System. distancesfrom. In an example of how to calculate the distance between two coordinates in Excel, we’ll seek to measure the great circle distance. Use LatLong. In other words, the distance between A and B. This demo program will calculate the distance between two points on Earth, using the latitude and longitude positions. Know how to interpret points with the rectangular coordinate system (rect system) 2. Latitude and/or longitude change every few inches, and if two places have the same latitude and longitude, then the distance between them is zero. I have found a couple of solutions that do this for zip codes, but not for a physical address. Calculate Distance in Miles from Latitude and Longitude. A protip by ausi about mysql, latitude, longitude, and coordinates. What I am going to show you is how to calculate distance between two points within the United States, using the Haversine formula, implemented in C. Theses free samples assist in understanding its usage. This uses the haversine formula to calculate the great-circle distance between two points – that is, the shortest distance over the earth’s surface – giving an “as-the-crow-flies” distance between the points (ignoring any hills they fly over, of course!). Using this online calculator, you will receive a detailed step-by-step solution to your problem, which will help you understand the algorithm how to find midpoint between two points. Click here to find your latitude/longitude. Calculate car driving distance and straight line flying distance times between Orapa Botswana and Maseru Lesotho with Distantias! Get fuel cost estimates, the midpoint, nearest rail stations, nearest airports, traffic and more. A circle is a set of all points in a plane that are a fixed distance r away from a given point called the center. Calculating the Distance Between Two GPS Coordinates with Python (Haversine Formula) September 7, 2016. 8664741, 24. I have these data: Point A and B with State, City, Address, Zip. Then it occured to me that I might have to normalize $\rho$, so it can only take values between zero and one (just like the $\sin$). The distance returned is relative to Earth’s radius. However, I have a list of coordinates of houses, and want to calculate their. This will compute the great-circle distance between two latitude/longitude points, as well as the middle point. 8), where the units are centimeters for Teachers for Schools for Working Scholars for. MGRS Distance and Direction Calculator. D= /(x2−x1)2+(y2−y1)2. Introduction Two frequent calculations required in radio propagation work are distance and bearing between two radio terminals. Distance Calculator. Latitude is in degrees north of the equator; southern latitudes are negative degrees north. Also get the directions for going to one city from another city. The example application that is posted will show you how to use Zip codes in place of Latitude and Longitude. Thank you and regards,. We have successfully combined latitude and longitude into the GeoLoc field. Calculate the distance between two addresses gets confused when you input GPS coordinates. If you have two geohashes, you first need to decode them into latitude and longitude: GEOHASH_DEC_LAT(#GeoHash) GEOHASH_DEC_LONG(#GeoHash) After you have your coordinates you can calculate the distance: IF(!. Distance Calculator is use to calculate the distance between coordinates and distance between cities. // use the 'haversine' formula to calculate distance between two lat/long points for each record // The Haversine formula can be broken into multiple pieces or steps - I chose to do the entire formula. Calculates the distance and azimuth between two places each city's distance from that coordinate. This uses the haversine formula to calculate the great-circle distance between two points – that is, the shortest distance over the earth’s surface – giving an “as-the-crow-flies” distance between the points (ignoring any hills they fly over, of course!). Try our Latitude/Longitude Distance Calculator to determine the distance between two points. com) software offers a solution for users who want to find the distance between one or more latitude and longitude coordinates. As you start to write the name of a city or place, distance calculator will suggest you place names automatically, you may choose from them to calculate distance. You can calculate geo distance using spatial types - geography datatype in SQL server. Does anyone know of a method of calculating the distance between two (very close together) GPS coordinates? The method must be easily calculated by an 8-bit microcontroller. The calculator will find the angle (in radians and degrees) between the two vectors, and will show the work. So, let's go ahead and just step through this, press f8, I might have a couple of things I forgot to do, but we set the latitudes and longitudes, we calculate a, b. Currently if you do a Google search to find how to accomplish this you will find a number of blogs talking about the need to use a Haversine formula that takes into account the curvature of the earth. There are several different ways to calculate the distance between two coordinates, P1(r, θ, Φ) and P2(r, θ, Φ). The values used for the radius of the Earth (3961 miles & 6373 km) are optimized for locations around 39 degrees from the equator (roughly the Latitude of Washington, DC, USA). Plane equation given three points. The formulas are very simple: for two given points and distance is the hypotenuse of right triangle, and it is calculated like this: and middle point is the average of both coordinates. I am trying to work out what would be described as the 'L0 Tile' distance between two points in my game in tiles. Distance between two points in a three dimension coordinate system - online calculator Sponsored Links The distance between two points in a three dimensional - 3D - coordinate system can be calculated as. One additional aspect not addressed above is the nature of the terrain between the two points. For instance we are getting data from two different devices at two different geographical location, we are getting latitude and longitude value for those devices. The Bing Maps Distance Matrix API provides travel time and distances for a set of origins and destinations. This can be achieved through Google Maps API. Take for example, a dating website which shows potential matches to a user within a 15 mile radius or a taxi business which calculates taxi fares based on distance between two locations. Geozip Geozip is a Perl program for calculating the distance between two zip codes in the United States. In the attached file "Circle2", the coordinates of the circles are located under column B & C, the coordinates of the points are located under column F & calculate the minimum distance between two sets of coordinates. 8, which is the radius of Earth. The distance problem can be solved by using the Haversine formula. It has all the needed trig functions to calculate the distance in miles between two points using Longitude and Latitude where they are expressed in decimal form. Distance between Two Given Points. Surface Distance Between Two Points of Latitude and Longitude. Distance Calculator. There are many options available if you want to import these in a GIS and run analysis. From Point A to Point B: Understanding how to find the distance between two points on the coordinate plane. The first step is expressing each Latitude/Longitude of both of the coordinates in radians:. Perform the same operation for the y coordinates. Simply enter the from address and to address and the distance between the two address will be calculated in milage and kilometers. This demo program will calculate the distance between two points on Earth, using the latitude and longitude positions. Calculate distance between two coordinates. The curve (somewhat resembles a circle) is made up of a couple of given points and the rest of the data is interpolated by excel. Point Slope Form Calculator The point slope form is defined that the difference in the y coordinate between two points (y - y1) on a line is proportional to the difference in the x coordinate points (x - x1). Answer to: Two points in a rectangular coordinate system have the coordinates (4. I will choose the first coordinate and calculate the distance to other coordinates by using the above equation. 20181 The distance between each other is about 22km. If the two points are (x1, y1) and (x2, y2), the distance between these points is given by the distance formula: The distance formula is a very. The Earth Model—Calculating Field Size and Distances between Points using GPS Coordinates Figure 1. JS: Calculate Distance Between Two Coordinates phptuts January 3, 2018 This routine calculates the distance between two points (given the latitude/longitude of those points). Coordinates of point is a set of values that is used to determine the position of a point in a two dimensional plane. QSC297: Estimate the square root of a number between two consecutive integers with and without models. For just a few calculations, this is very straight-forward using plain old Excel. convert to/from UTM coordinates; calculate the geodetic distance between two positions or calculate the bearing from one position to another; project a position with a distance and bearing, to get a new position (or bearing) find the geodetic intersection of two lines (great circles), two archs (small circles) or a line and a arc. Ask Question. The great circle distance is proportional to the central angle. Important Note: The distance calculator on this page is provided for informational purposes only. Lines of latitude are called parallels and in total there are 180 degrees of latitude. Calculate Distance in Miles from Latitude and Longitude. This can be used to place features so they are relative to one another. The center of Rome is located at roughly 41. Calculate the distance between any two points in the rectangular coordinate plane. how to calculate nearest places distance between two coordinate(lat,long) [Answered] RSS 1 reply Last post Jul 07, 2014 05:30 AM by Michelle Ge - MSFT. Distance Calculator – Find the Distance Between Cities. The second one calculates the total distance between a list of locations. Again, a distance and direction. For find distance between two latitude and longitude in SQL Server, we can use below mentioned query. Distance From To: Calculate distance between two addresses, cities, states, zipcodes, or locations Enter a city, a zipcode, or an address in both the Distance From and the Distance To address inputs. This article is a sequel to the previous article on the same topic, but using T-SQL for calculation - Calculate distance between two points on globe from latitude and longitude coordinates. This includes the city, state, latitude, longitude, time zone information, and NPA area codes for the primary location. For two points P 1 = (x 1, y 1) and P 2 = (x 2, y 2) in the Cartesian plane, the distance between P 1 and P 2 is defined as: Example : Find the distance between the points ( − 5, − 5) and (0, 5) residing on the line segment pictured below. google map api. In this post, we show the formula to calculate the shortest distance between two points using Latitude and Longitude. The calculator will generate a step-by-step explanation on how to obtain the results. The Distance from the Car to the next Turn. I built this primarily to make it easy to check if a Locationless (Reverse) Cache has already been found. This distance will also be displayed on google map labeled as World Distance Map. As shown in the example below, we do this by joining the two points with a straight line and then drawing a right-angled triangle using that straight line as the hypotenuse and aligning the other two sides with the x-axis and y-axis. MGRS Distance and Direction Calculator. 14159265359). All numbers and return values should be of type double. The formulas are very simple: for two given points and distance is the hypotenuse of right triangle, and it is calculated like this: and middle point is the average of both coordinates. Another method for calculating the distance between two points that fall on the same line is to plot the points and count the amount of boxes in between the two points. To find the flight distance between two places, please insert the locations in the control of flight distance calculator and Calculate Flight Distance to get the required results while travelling by air. It accepts a variety of formats:. I've found this code for calculating distance. 0 (sobolsoft. The first class calculates the distance between two locations. Calculate Distance Between 2 Coordinates alias Memperhitungkan jarak antara 2 titik koordinat. The purpose of the function is to calculate the distance between two points and return the result. Find bearing angle and find direction A and B as two different points, where 'La' is point A longitude and 'θa' is point A latitude. If you need to find out the coordinates of a site, the distance between two sites or the bearing between two sites go to my Coordinate, Distance and Bearing Calculator A new feature is dragable marker-B. Click Calculate Distance, and the tool will place a marker at each of the two addresses on the map along with a line between them. I just plug the coordinates into the Distance Formula: Then the distance is sqrt (53) , or about 7. But essentially the program should gather two sets of coordinates from a GPS module and the users phone (using the 1Sheeld) and work out the bearing and distance between them. Skills to Learn: 1. The shortest distance (the geodesic) between two given points P 1 =(lat 1, lon 1) and P 2 =(lat 2, lon 2) on the surface of a sphere with radius R is the great circle distance. Latitude/Longitude Distance Calculation This query will determine the distance between two points on the earth given their latitudes and longitudes. Latitude and/or longitude change every few inches, and if two places have the same latitude and longitude, then the distance between them is zero. The C# implementation of the Haversine formula is: public double GetDistanceBetweenPoints( double lat1, double long1, double lat2, double long2). For some websites, it is a necessity to calculate the distance between certain locations. The EASY way is to have. x A means the x-coordinate of point A y A means the y-coordinate of point A. Valid input formats are at the bottom of this page. South latitudes points are expressed in negative values, while east longitudes are positive values. The program converts degrees to radians before executing the GEODIST function. Distances calculator is a free tool to calculate distances between any two cities in the world. This query calculate the distance in miles. I'm building a system that takes a GPS reading once a second and calculates the distance between these one second intervals, and aggregates them. Further, there is a one-to-one correspondence between areal coordinates and all points on the plane P. Just a little mathematical exercise in geography, namely the use of longitude and latitiude coordinates to calculate the distance between two given cities. Travelmath helps you find driving distances based on actual directions for your road trip. Distance Calculator is use to calculate the distance between coordinates and distance between cities. angle between two lat lon points. I've found this code for calculating distance. First, note that it's very easy to get a distance between two points on a sphere if you know the angle of the arc between them: just multiply it by the radius. When unqualified, "the" distance generally means the shortest distance between two points. Function accepts four parameters, source latitude, source longitude, destination latitude, destination longitude and returns the distance between the. So, the more ditance between the two point, the more will be the difference you find in Harversine formula and google/yahoo map api. One additional aspect not addressed above is the nature of the terrain between the two points. What i have is the longitude and the latitude of the home adres of the own company and the longitude and the latitude of the client. Blue J users, ICSE students, BCA, B Tech & other Under graduates can stand to benefit alot. By default, MapInfo Professional expects coordinates to use a Longitude/Latitude coordinate system. Our three-dimensional distance calculator is a tool that finds the distance between two points, provided you give their coordinates in space. This website allows you to find the distance between cities or any two places and get directions using Google maps. coordinates and two. | 2020-04-03T06:56:50 | {
"domain": "ciiz.pw",
"url": "http://sbwt.ciiz.pw/distance-between-two-coordinates-calculator.html",
"openwebmath_score": 0.6425132751464844,
"openwebmath_perplexity": 449.43494686701194,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. Yes\n2. Yes",
"lm_q1_score": 0.9770226300899743,
"lm_q2_score": 0.8840392725805822,
"lm_q1q2_score": 0.8637263751995081
} |
http://mathhelpforum.com/trigonometry/151257-trigonometric-equation.html | # Math Help - Trigonometric equation?
1. ## Trigonometric equation?
If 3sin(x + pi/3) = 2cos(x - 2pi/3), find tanx?
I started doing it using the sum and difference formulas but didn't end up getting the correct answer. Could someone show me how to do it using the sum and difference formulas?
2. Originally Posted by D7236
If 3sin(x + pi/3) = 2cos(x - 2pi/3), find tanx?
I started doing it using the sum and difference formulas but didn't end up getting the correct answer. Could someone show me how to do it using the sum and difference formulas?
You can use identity $\displaystyle \cos(\theta + \pi) = -\cos(\theta)$, to start out.
Edit: Well I suppose it should be $\displaystyle \cos(\theta - \pi) = -\cos(\theta)$, same idea.
3. You should know
$\sin{(\alpha \pm \beta)} = \sin{\alpha}\cos{\beta} \pm \cos{\alpha}\sin{\beta}$
and
$\cos{(\alpha \pm \beta)} = \cos{\alpha}\cos{\beta} \mp \sin{\alpha}\sin{\beta}$.
$3\sin{\left(x + \frac{\pi}{3}\right)} = 2\cos{\left(x - \frac{2\pi}{3}\right)}$
$3\left(\sin{x}\cos{\frac{\pi}{3}} + \cos{x}\sin{\frac{\pi}{3}}\right) = 2\left(\cos{x}\cos{\frac{2\pi}{3}} + \sin{x}\sin{\frac{2\pi}{3}}\right)$
$3\left(\frac{1}{2}\sin{x} + \frac{\sqrt{3}}{2}\cos{x}\right) = 2\left(-\frac{1}{2}\cos{x} + \frac{\sqrt{3}}{2}\sin{x}\right)$
$\frac{3}{2}\sin{x} + \frac{3\sqrt{3}}{2}\cos{x} = -\cos{x} + \sqrt{3}\sin{x}$
$\left(\frac{3}{2} - \sqrt{3}\right)\sin{x} = \left(-1 - \frac{3\sqrt{3}}{2}\right)\cos{x}$
$\left(\frac{3 - 2\sqrt{3}}{2}\right)\sin{x} = -\left(\frac{2 + 3\sqrt{3}}{2}\right)\cos{x}$
$\frac{\sin{x}}{\cos{x}} = \frac{-\frac{2 + 3\sqrt{3}}{2}}{\phantom{-}\frac{3 - 2\sqrt{3}}{2}}$
$\tan{x} = -\frac{2 + 3\sqrt{3}}{3 - 2\sqrt{3}}$
$\tan{x} = -\frac{(2 + 3\sqrt{3})(3 + 2\sqrt{3})}{(3 - 2\sqrt{3})(3 + 2\sqrt{3})}$
$\tan{x} = -\frac{6 + 4\sqrt{3} + 9\sqrt{3} + 18}{9 - 12}$
$\tan{x} = \frac{-(24 + 13\sqrt{3})}{-3}$
$\tan{x} = \frac{24 + 13\sqrt{3}}{3}$.
4. Originally Posted by undefined
You can use identity $\displaystyle \cos(\theta + \pi) = -\cos(\theta)$, to start out.
Edit: Well I suppose it should be $\displaystyle \cos(\theta - \pi) = -\cos(\theta)$, same idea.
Yes, we coud let $\theta = x + \frac{\pi}{3}$, but without the angle sum and difference identities we still can't reduce this to $\tan{x}$. So refer to my post above
5. Originally Posted by D7236
If 3sin(x + pi/3) = 2cos(x - 2pi/3), find tanx?
I started doing it using the sum and difference formulas but didn't end up getting the correct answer. Could someone show me how to do it using the sum and difference formulas?
Since Prove It posted a full solution, here's another way.
$3\sin\left(x + \dfrac{\pi}{3}\right) = 2\cos\left(x - \dfrac{2\pi}{3}\right) = -2 \cos\left(x + \dfrac{\pi}{3}\right)$
$\tan\left(x+\dfrac{\pi}{3} \right) = \dfrac{-2}{3}$
Use
$\displaystyle \tan(\alpha+\beta)=\frac{\tan\alpha+\tan\beta}{1-\tan\alpha\tan\beta}$
if you know it, otherwise use sin and cos angle sum like Prove It.
Here
$\dfrac{-2}{3} = \dfrac{\tan x+\sqrt{3}}{1-\sqrt{3}\tan x}$
$-2(1-\sqrt{3}\tan x) = 3(\tan x+\sqrt{3})$
$-2+2\sqrt{3}\tan x = 3\tan x+3\sqrt{3}$
$(2\sqrt{3}-3)\tan x = 3\sqrt{3}+2$
$\tan x = \dfrac{2+3\sqrt{3}}{-3+2\sqrt{3}}$
$\tan x = \dfrac{(2+3\sqrt{3})(-3-2\sqrt{3})}{(-3+2\sqrt{3})(-3-2\sqrt{3})}$
$\tan x = \dfrac{24+13\sqrt{3}}{3}$
Originally Posted by Prove It
Yes, we coud let $\theta = x + \frac{\pi}{3}$, but without the angle sum and difference identities we still can't reduce this to $\tan{x}$. So refer to my post above
I was busy typing and didn't see your recent post until just now. I think your way is a bit easier than mine, anyway. | 2015-07-01T01:31:52 | {
"domain": "mathhelpforum.com",
"url": "http://mathhelpforum.com/trigonometry/151257-trigonometric-equation.html",
"openwebmath_score": 0.904026448726654,
"openwebmath_perplexity": 648.1687989238947,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9881308768564867,
"lm_q2_score": 0.8740772368049822,
"lm_q1q2_score": 0.8637027064444021
} |
https://math.stackexchange.com/questions/656331/why-is-the-empty-set-a-subset-of-every-set?noredirect=1 | # Why is the empty set a subset of every set? [duplicate]
Take for example the set $X=\{a, b\}$. I don't see $\emptyset$ anywhere in $X$, so how can it be a subset?
• "Subset of" means something different than "element of". Note $\{a\}$ is also a subset of $X$, despite $\{ a \}$ not appearing "in" $X$. – user14972 Jan 29 '14 at 20:10
• Why does this question get a downvote? It is not hard to see that someone can be asking this seriously. – N. Owad Jan 29 '14 at 22:02
• Hint: Every element of the empty set is a pink elephant. Or an element of $X.$ (No joke) – Dan Christensen Jan 30 '14 at 4:59
• I personally like @HagenvonEitzen's question Or Can you name an element of ∅ that is not an element of X?. If you think it like this, given ∅ and X, you can't really find an element of ∅ (nothing) that you don't find in X, and as a subset A is a just a set whose elements (every element) are included in another set B, that is you can't find an element in A which is not in B, it makes more sense. – user3019105 Mar 15 '18 at 20:24
that's because there are statements that are vacuously true. $Y\subseteq X$ means for all $y\in Y$, we have $y\in X$. Now is it true that for all $y\in \emptyset$, we have $y\in X$? Yes, the statement is vacuously true, since you can't pick any $y\in\emptyset$.
Because every single element of $\emptyset$ is also an element of $X$. Or can you name an element of $\emptyset$ that is not an element of $X$?
You must start from the definition :
$$Y \subseteq X$$ iff $$\forall x (x \in Y \rightarrow x \in X)$$.
Then you "check" this definition with $$\emptyset$$ in place of $$Y$$ :
$$\emptyset \subseteq X$$ iff $$\forall x (x \in \emptyset \rightarrow x \in X)$$.
Now you must use the truth-table definition of $$\rightarrow$$ ; you have that :
"if $$p$$ is false, then $$p \rightarrow q$$ is true", for $$q$$ whatever;
so, due to the fact that :
$$x \in \emptyset$$
is not true, for every $$x$$, the above truth-definition of $$\rightarrow$$ gives us that :
"for all $$x$$, $$x \in \emptyset \rightarrow x \in X$$ is true", for $$X$$ whatever.
This is the reason why the emptyset ($$\emptyset$$) is a subset of every set $$X$$.
• Shouldn't the last implication be "$\text{for all x, }x \in \emptyset \rightarrow x \in X$ is true" – mauna Jun 30 '14 at 13:20
Subsets are not necessarily elements. The elements of $\{a,b\}$ are $a$ and $b$. But $\in$ and $\subseteq$ are different things. | 2021-07-31T00:01:47 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/656331/why-is-the-empty-set-a-subset-of-every-set?noredirect=1",
"openwebmath_score": 0.8098239898681641,
"openwebmath_perplexity": 251.53314799414642,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9881308770312512,
"lm_q2_score": 0.8740772302445241,
"lm_q1q2_score": 0.8637027001145685
} |
https://math.stackexchange.com/questions/2804241/general-term-of-a-sequence/2804289 | # General term of a sequence.
So i have the following sequence:
${1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, ...}$
Where the number $i$ appears $i + 1$ times.
I would like to know the $n$-th term of this sequence. I tried to analise certain patterns within the sequence, but wasn´t able to conclude anything so far.
I would like to put a "number pyramid" like this:
$$1-1$$
$$2-2-2$$
$$3-3-3-3$$
$$4-4-4-4-4$$
$$5-5-5-5-5-5$$
$$\cdots$$
$$k-\text{th floor: } k-k-k-k-k-...-k-k\text{ (k+1 times)}$$
The number of numbers appear in all the floors from $1$ to $k-1$:
$$2+3+4+5+\cdots+k=\dfrac{(k+2)(k-1)}{2}$$
The number of numbers appear in all the floors from $1$ to $k$:
$$2+3+4+5+\cdots+k+k+1=\dfrac{(k+3)k}{2}$$
Assume that the $n$-th term of the sequence above is on the $k$-th floor (the bottom floor of the pyramid above), then $n$ may or may not be the last term of the $k$-th floor, so this inequality must hold (we need to find $k\in\mathbb{Z^+}$ given $n\in\mathbb{Z^+}$):
$\dfrac{(k+2)(k-1)}{2}<n\le\dfrac{(k+3)k}{2}$
$\Leftrightarrow k^2+k-2<2n\le k^2+3k$
$\Leftrightarrow \begin{cases}k^2+k-2n-2<0\\k^2+3k-2n\ge 0\end{cases}$
$$k^2+k-2n-2<0$$
$\Leftrightarrow k^2+2\times k\times 0.5+0.25-2n-2.25<0$
$\Leftrightarrow (k+0.5)^2<2n+2.25$
$\Leftrightarrow k+0.5<\sqrt{2n+2.25}$ (because $k,n>0$)
$\Leftrightarrow k<-0.5+\sqrt{2n+2.25}$
$\Leftrightarrow k<\dfrac{-1+\sqrt{8n+9}}{2}$
$$k^2+3k-2n\ge 0$$
$\Leftrightarrow (k+1.5)^2\ge 2n+2.25$ (similar to above)
$\Leftrightarrow k+1.5\ge \sqrt{2n+2.25}$ (because $k,n>0$)
$\Leftrightarrow k\ge \dfrac{-3+\sqrt{8n+9}}{2}$
Combine both equations, we have
$$\dfrac{-3+\sqrt{8n+9}}{2}\le k<\dfrac{-1+\sqrt{8n+9}}{2}$$
Other notes:
• The conclusion above is still true for $n\in\mathbb\{1;2\}$ and $k=1$. When $k=1$, the number of numbers appear in all the floors from $1$ to $0$ is zero (no numbers exist), because when $k=1$ we have $\dfrac{(k+2)(k-1)}{2}=0$.
• There is always exactly one positive integer $k$ satisfy the conclusion above (for all $n\in\mathbb{Z^+}$), because the difference between the right hand side and the left hand side is $1$.
• +1 Nice piece of work. Jun 1 '18 at 13:28
• Thank you, I spent an hour making this just to know that the first answer was accepted before. Jun 1 '18 at 13:34
• A shame. I am slow to accept answers for this reason. Jun 1 '18 at 15:51
According to OEIS the general formula is $$a(n) = \lfloor (\sqrt{1+8n}-1)/2\rfloor.$$
If $t_n$ denotes the value of the $n$-th term then:
$$2+3+\cdots+t_n<n\leq2+3+\cdots+t_n+(t_n+1)=\frac12t_n(t_n+3)$$
so that $t_n$ is the smallest integer that satisfies: $$2n\leq t_n(t_n+3)$$leading to $t_n=\lceil\frac12\sqrt{9+8n}-\frac32\rceil$
$n \in \mathbb{N}$ appears $n+1$ times starting from the position $$1 + \sum_{i=1}^{n-1}(i+1) = n + \frac{n(n+1)}2 = \frac12n(n+3)$$
Therefore, $$a_n = k \iff n \in \left[\frac12k(k+3), k+\frac12k(k+3)\right]$$
so $k$ is the smallest integer with $n \ge \frac12k(k+3)$.
Solving this for $k$, we obtain $$a_n = \left\lceil\frac{-3+\sqrt{9+8n}}2\right\rceil, \quad n\in \mathbb{N}$$
Given $\color{red}1, 1, \color{red}2, 2, 2, \color{red}3, 3, 3, 3, \color{red}4, 4, 4, 4, 4, \color{red}5, ...$, first note that: $a_{T(k)}=k$, where $T(k)$ is a triangular number. Indeed: $$a_{T(1)}=a_1=\color{red}1; a_{T(2)}=a_3=\color{red}2; a_{T(3)}=a_6=\color{red}3; a_{T(4)}=a_{10}=\color{red}4; a_{T(5)}=a_{15}=\color{red}5; \ ...$$ Hence: $$T(k)\le n\le T(k+1)-1, a_n=k \iff \\ \frac{k(k+1)}{2}\le n\le \frac{(k+1)(k+2)}{2}-1 \iff \\ k^2+k-2n\le 0\le k^2+3k-2n \iff \\ \left\lceil \frac{\sqrt{8n+9}-3}{2}\right\rceil\le k\le \left\lfloor \frac{\sqrt{8n+1}-1}{2}\right\rfloor$$ Hence: $$a_n=\left\lceil \frac{\sqrt{8n+9}-3}{2}\right\rceil \ \text{or} \ \left\lfloor \frac{\sqrt{8n+1}-1}{2}\right\rfloor.$$ | 2021-12-07T03:06:03 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2804241/general-term-of-a-sequence/2804289",
"openwebmath_score": 0.9594383239746094,
"openwebmath_perplexity": 258.1828725266699,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9881308803517763,
"lm_q2_score": 0.874077222043951,
"lm_q1q2_score": 0.8637026949137243
} |
https://math.stackexchange.com/questions/3122679/proving-the-borel-cantelli-lemma | # Proving the Borel-Cantelli Lemma
Let $$\{{E_k}\}^{\infty}_{k=1}$$ be a countable family of measurable subsets of $$\mathbb{R}^d$$ and that $$$$% Equation (1) \sum^{\infty}_{k=1}m(E_k)<\infty$$$$ Let \begin{align*} E&=\{x\in \mathbb{R}^d:x\in E_k, \text{ for infinitely many k }\} \\ &= \underset{k\rightarrow \infty}{\lim \sup}(E_k).\\ \end{align*}
(a) Show that $$E$$ is measurable
(b) Prove $$m(E)=0.$$
My Proof Attempt:
Proof. Let the assumptions be as above. We will prove part (a) by showing that $$\begin{equation*} E=\cap^{\infty}_{n=1}\cup_{k\geq n}E_k. \end{equation*}$$ Hence, E would be measurable, since for every fixed $$n$$, $$\cup_{k\geq n}E_k$$ is measurable since it is a countable union of measurable sets. Then $$\cap^{\infty}_{n=1}\cup_{k\geq n}E_k$$ is the countable intersection of measurable sets.
From here, we shall denote $$\cup_{k\geq n}E_k$$ as $$S_n$$. Let $$x\in \cap^{\infty}_{n=1}S_n$$. Then $$x\in S_n$$ for every $$n\in \mathbb{N}$$. Hence, $$x$$ must be in $$E_k$$ for infinitely many $$k$$, otherwise there would exist an $$N\in \mathbb{N}$$ such that $$x\notin S_N$$. Leaving $$x$$ out of the intersection. Thus, $$\cap^{\infty}_{n=1}S_n\subset E$$.
Conversely, let $$x\in E.$$ Then $$x\in E_k$$ for infinitely many $$k$$. Therefore, $$\forall n\in \mathbb{N}$$, $$x\in S_n$$. Otherwise, $$\exists N\in \mathbb{N}$$ such that $$x\notin S_N$$. Which would imply that $$x\in E_k$$ for only $$k$$ up to $$N$$, i.e. finitely many. A contradiction. Therefore, $$x\in \cap^{\infty}_{n=1}S_n$$. Hence, they contain one another and equality holds. This proves part (1).
Now for part (b). Fix $$\epsilon>0$$. We need to show that there exists $$N\in \mathbb{N}$$ such that $$\begin{equation*} m(S_N)\leq \epsilon \end{equation*}$$ Then since $$E\subset S_N$$, monotonicity of the measure would imply that $$m(E)\leq \epsilon$$. Hence, proving our desired conclusion as we let $$\epsilon \rightarrow 0$$.
Since $$\sum^{\infty}_{k=1}m(E_k)<\infty$$, there exists $$N\in \mathbb{N}$$ such that $$\begin{equation*} \left| \sum^{\infty}_{k=N}m(E_k)\right |\leq \epsilon \end{equation*}$$ By definition, $$\begin{equation*} m(S_N)=m(\cup_{k\geq N}E_k)=\sum^{\infty}_{k=N}m(E_k) \end{equation*}$$ Thus, $$m(S_N)\leq \epsilon$$. This completes our proof.
Any corrections of the proof, or comments on style of the proof are welcome and appreciated. Thank you all for your time.
The proof is almost perfect, only in the end it is not necessary true that $$m(\cup_{k\geq N}E_k)=\sum_{k=N}^\infty m(E_k)$$ since the sets $$E_k$$ might not be pairwise disjoint. So the measure of the union is only at most the sum of measures. But in our case it doesn't change anything for the proof, since we anyway get $$m(S_N)\leq\sum_{k=N}^\infty m(E_k)\leq\epsilon$$. Still it is important to remember the correct properties of measure.
Your proof is fine, modulo the comment in the other answer. For another approach, which I think is the way Rudin does it, note that $$x\in E$$ if and only if the series $$\sum^{\infty}_{k=1}1_{E_k}(x)$$ diverges.
Set $$s_n(x)=\sum^{n}_{k=1}1_{E_k}(x).$$ Then, $$s_n(x)\to s(x)=\sum^{\infty}_{k=1}1_{E_k}(x)$$ and the monotone converge theorem gives $$\sum^{n}_{k=1}m(E_k)\to \sum^{\infty}_{k=1}m(E_k)<\infty.$$ Thus, $$s\in L^1(m)$$, so the series converges almost everywhere $$m$$. That is, the set on which it diverges, namely $$E$$, has Lebesgue measure zero and so $$m(E)=0.$$
Remark: since we proved that $$m(E)=0,$$ we get part $$(a)$$ for free. | 2019-07-16T06:09:10 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/3122679/proving-the-borel-cantelli-lemma",
"openwebmath_score": 0.9980306625366211,
"openwebmath_perplexity": 107.89735990674784,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9805806489800368,
"lm_q2_score": 0.8807970889295664,
"lm_q1q2_score": 0.8636925810822814
} |
https://ocw.mit.edu/courses/aeronautics-and-astronautics/16-90-computational-methods-in-aerospace-engineering-spring-2014/numerical-integration-of-ordinary-differential-equations/systems-of-odes-and-eigenvalue-stability/1690r-eigenvalue-stability-for-a-linear-ode/ | # 1.6 Systems of ODE's and Eigenvalue Stability
## 1.6.3 Eigenvalue Stability for a Linear ODE
As we have seen, while numerical methods can be convergent, they can still exhibit instabilities as $$n$$ increases for finite $${\Delta t}$$. For example, when applying the midpoint method to either the ice particle problem in Section 1.2.4 or the simpler model problem in Example 1.66, instabilities were seen in both cases as $$n$$ increased. Similarly, for the nonlinear pendulum problem in Example 1.86, the forward Euler method had a growing amplitude again indicating an instability. The key to understanding these results is to analyze the stability for finite $${\Delta t}$$. This analysis is different than the stability analysis we performed in Section 1.5.2 since that analysis was for the limit of $${\Delta t}\rightarrow 0$$.
Suppose we are interested in solving the linear ODE,
$u_ t = \lambda u.$ (1.99)
Consider the Forward Euler method applied to this problem,
$v^{n+1} = v^ n + \lambda {\Delta t}v^ n. \label{equ:fe_ lin}$ (1.100)
Similar to the zero stability analysis, we will assume that the solution has the following form,
$v^{n} = g^ n v^0, \label{equ:gdef}$ (1.101)
where $$g$$ is the amplification factor (and the superscript $$n$$ acting on $$g$$ is again raising to a power). As in the zero stability analysis, we wish to determine under what conditions $$|g| > 1$$ since this would mean that $$v^ n$$ will grow unbounded as $$n \rightarrow \infty$$. Substituting Equation 1.101 into Equation 1.100 gives,
$g^{n+1} = (1 + \lambda {\Delta t})g^ n.$ (1.102)
Thus, the only non-zero root of this equation gives,
$g = 1 + \lambda {\Delta t},$ (1.103)
which is the amplification factor for the forward Euler method. Now, we must determine what values of $$\lambda {\Delta t}$$ lead to instability (or stability). A simple way to do this for multi-step methods is to solve for the stability boundary for which $$|g| = 1$$. To do this, let $$g = e^{i\theta }$$ (since $$|e^{i\theta }| = 1$$) where $$\theta = [0,2\pi ]$$. Making this substitution into the amplification factor,
$e^{i\theta } = 1 + \lambda {\Delta t}\quad \Rightarrow \quad \lambda {\Delta t}= e^{i\theta } - 1.$ (1.104)
Thus, the stability boundary for the forward Euler method lies on a circle of radius one centered at -1 along the real axis and is shown in Figure 1.10.
Figure 1.10: Forward Euler stability region
For a given problem, i.e. with a given $$\lambda$$, the timestep must be chosen so that the algorithm remains stable for $$n \rightarrow \infty$$. Let's consider some examples.
## Example
Let's return to the previous example, $$u_ t = -u^2$$ with $$u(0) = 1$$. To determine the timestep restrictions, we must estimate the eigenvalue for this problem. Linearizing this problem about a known state gives the eigenvalue as $$\lambda = {\partial f}/{\partial u} = -2u$$. Since the solution will decay from the initial condition (since $$u_ t < 0$$ because $$-u^2 < 0$$), the largest magnitude of the eigenvalue occurs at the initial condition when $$u(0) = 1$$ and thus, $$\lambda = -2$$. Since this eigenvalue is a negative real number, the maximum $${\Delta t}$$ will occur at the maximum extent of the stability region along the negative real axis. Since this occurs when $$\lambda {\Delta t}= -2$$, this implies that $${\Delta t}< 1$$. To test the validity of this analysis, the forward Euler method was run for $${\Delta t}= 0.9$$ and $${\Delta t}= 1.1$$. The results are shown in Figure 1.11 which are stable for $${\Delta t}= 0.9$$ but are unstable for $${\Delta t}= 1.1$$.
Figure 1.11: Forward Euler solution for $$u_ t = -u^2$$ with $$u(0) = 1$$ with $${\Delta t}= 0.9$$ and $$1.1$$.
## Pendulum Example
Next, let's consider the application of the forward Euler method to the pendulum problem. For this case, the linearization produces a matrix,
$\frac{\partial f}{\partial u} = \left(\begin{array}{cc} 0 & -\frac{g}{L}\cos \theta \\ 1 & 0 \end{array}\right)$ (1.105)
The eigenvalues can be found from the roots of the determinant of $${\partial f}/{\partial u} - \lambda I$$:
$$\displaystyle \det \left(\frac{\partial f}{\partial u} - \lambda I\right)$$ $$\displaystyle =$$ $$\displaystyle \det \left(\begin{array}{cc} -\lambda & -\frac{g}{L}\cos \theta \\ 1 & -\lambda \end{array}\right)$$ (1.106) $$\displaystyle =$$ $$\displaystyle \lambda ^2 + \frac{g}{L}\cos \theta = 0$$ (1.107) $$\displaystyle \Rightarrow$$ $$\displaystyle \lambda = \pm i \sqrt {\frac{g}{L}\cos \theta }$$ (1.108)
Thus, we see that the eigenvalues will always be imaginary for this problem. As a result, since the forward Euler stability region does not contain any part of the imaginary axis (except the origin), no finite timestep exists which will be stable. This explains why the amplitude increases for the pendulum simulations in Figure 1.8. | 2021-07-23T23:00:04 | {
"domain": "mit.edu",
"url": "https://ocw.mit.edu/courses/aeronautics-and-astronautics/16-90-computational-methods-in-aerospace-engineering-spring-2014/numerical-integration-of-ordinary-differential-equations/systems-of-odes-and-eigenvalue-stability/1690r-eigenvalue-stability-for-a-linear-ode/",
"openwebmath_score": 0.954245388507843,
"openwebmath_perplexity": 246.31812237750881,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.992062006602671,
"lm_q2_score": 0.8705972717658209,
"lm_q1q2_score": 0.8636864763708112
} |
http://math.stackexchange.com/questions/44835/for-integers-a-and-b-ab-textlcma-b-cdot-texthcfa-b | # For integers $a$ and $b$, $ab=\text{lcm}(a,b)\cdot\text{hcf}(a,b)$
I was reading a text book and came across the following:
Important Results
(This comes immediately after LCM:)
If 2 [integers] $a$ and $b$ are given, and their $LCM$ and $HCF$ are $L$ and $H$ respectively,
then $L \times H = a \times b$
-
I take it that HCF is gcd? (Highest common factor; greatest common divisor?) – amWhy Jun 11 '11 at 21:42
Yes that's correct @amWhy! – peakit Jun 12 '11 at 3:36
Let $p$ be a prime. If $p$ occurs in $a$ with multiplicity $m$ and in $b$ with multiplicity $n$, then it will occur in the LCM of $a$ and $b$ with multiplicity $\mathrm{max(m,n)}$ and in their HCF with multiplicity $\mathrm{min(m,n)}$.
Hence, in the product of LCM and HCF the multiplicity of $p$ is $$\mathrm{max}(m,n)+\mathrm{min}(m,n)=m+n,$$ which is also the multiplicity of $p$ in $a\cdot b$. Since this holds for every $p$, the two products must be equal.
-
This is an example of the "modular equation" $|A| + |B| = |A \cup B| + |A \cap B|$. – Yuval Filmus Jun 11 '11 at 21:35
But this assumes $p$ occurs with a well-defined multiplicity in $a$ and $b$, which is to say it assumes unique factorization. Has the text already done unique factorization when it introduces LCM? – Gerry Myerson Jun 11 '11 at 21:42
Thanks @Ramsus, your answer helped a lot! Another way to logically deduce this is: LCM of 2 numbers will cover the max multiplicity for each of the prime factors, but HCF will cover the min multiplicity for each of the prime factors and simple multiplication covers 'sum' of multiplicity of the prime factor which is same as LCM multiplied by HCF. – peakit Jun 12 '11 at 3:35
@peakit: to me, that sounds like exactly what I wrote. – Rasmus Jun 12 '11 at 9:47
Below is a proof that works in any domain, using the universal definitions of GCD, LCM.
THEOREM $\rm\quad (a,b)\ =\ ab/[a,b] \;\;$ if $\;\rm\ [a,b] \;$ exists.
Proof: $\rm\qquad d\mid (a,b)\iff d\mid a,b \iff a,b\mid ab/d \iff [a,b]\mid ab/d \iff d\mid ab/[a,b]$
-
User is "Gone" but the proof is excellent. It's too bad this wasn't the accepted answer, in view of its generality and Gerry Myerson's apt comment below the accepted answer. – user43208 Oct 20 '13 at 16:18
You can also figure this out without using any use of unique factorization. Since you say this comes immediately after LCM, I assume you know that for $m\gt 0$, $[ma,mb]=m[a,b]$, where $[a,b]=\mathrm{lcm}(a,b)$ and $(ma,mb)=m(a,b)$ where $\gcd(a,b)=(a,b)$.
Now suppose $(a,b)=1$, and also assume they are positive, since if they are negative $[a,-b]=[a,b]$ anyway. Since $[a,b]$ is some multiple of $a$, let $[a,b]=ma$. Then $b\mid ma$, but $(a,b)=1$, so $b\mid m$. If this hasn't be addressed yet, notice $(ma,mb)=m(a,b)=m$, so $b\mid ma$, and $b\mid mb$, so $b\mid m$ since any common divisor of $ma$ and $mb$ divides the greatest common divisor $m$ in this case.
So $b\leq m$ as they are both positive, which implies $ba\leq ma$. But $ba$ is a common multiple of $a$ and $b$, so cannot be strictly less than $ma$, so $ba=ma=[a,b]$.
More generally, if $(a,b)=g\gt 1$, then you have $(\frac{a}{g},\frac{b}{g})=1$. Then by the special case above, $$\left[\frac{a}{g},\frac{b}{g}\right]\left(\frac{a}{g},\frac{b}{g}\right)=\frac{a}{g}\frac{b}{g}.$$ Multiply through by $g^2$, you have \begin{align*} g^2\left[\frac{a}{g},\frac{b}{g}\right]\left(\frac{a}{g},\frac{b}{g}\right) &= g\left[\frac{a}{g},\frac{b}{g}\right]g\left(\frac{a}{g},\frac{b}{g}\right)\\ &= [a,b](a,b)\\ &= g^2\frac{a}{g}\frac{b}{g}=ab \end{align*} so $[a,b](a,b)=|ab|$.
-
I suppose this doesn't use unique factorization, but it does use $b\mid ma$, $\gcd(a,b)=1$ implies $b\mid m$, which may or may not have been done by the text at this point. – Gerry Myerson Jun 12 '11 at 13:11
@Gerry, sure, but I think this is a pretty easy consequence of $(ma,mb)=m(a,b)$ either way. – yunone Jun 12 '11 at 21:20 | 2016-05-03T01:25:24 | {
"domain": "stackexchange.com",
"url": "http://math.stackexchange.com/questions/44835/for-integers-a-and-b-ab-textlcma-b-cdot-texthcfa-b",
"openwebmath_score": 0.9828641414642334,
"openwebmath_perplexity": 252.52674125054665,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9752018376422666,
"lm_q2_score": 0.8856314783461302,
"lm_q1q2_score": 0.8636694451569834
} |
https://gmatclub.com/forum/there-are-different-10-circles-what-is-the-number-of-the-greatest-pos-217589.html | GMAT Question of the Day - Daily to your Mailbox; hard ones only
It is currently 17 Dec 2018, 11:59
### GMAT Club Daily Prep
#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
we will pick new questions that match your level based on your Timer History
Track
every week, we’ll send you an estimated GMAT score based on your performance
Practice
Pays
we will pick new questions that match your level based on your Timer History
## Events & Promotions
###### Events & Promotions in December
PrevNext
SuMoTuWeThFrSa
2526272829301
2345678
9101112131415
16171819202122
23242526272829
303112345
Open Detailed Calendar
• ### 10 Keys to nail DS and CR questions
December 17, 2018
December 17, 2018
06:00 PM PST
07:00 PM PST
Join our live webinar and learn how to approach Data Sufficiency and Critical Reasoning problems, how to identify the best way to solve each question and what most people do wrong.
• ### R1 Admission Decisions: Estimated Decision Timelines and Chat Links for Major BSchools
December 17, 2018
December 17, 2018
10:00 PM PST
11:00 PM PST
From Dec 5th onward, American programs will start releasing R1 decisions. Chat Rooms: We have also assigned chat rooms for every school so that applicants can stay in touch and exchange information/update during decision period.
# There are different 10 circles. What is the number of the greatest pos
Author Message
TAGS:
### Hide Tags
Math Revolution GMAT Instructor
Joined: 16 Aug 2015
Posts: 6656
GMAT 1: 760 Q51 V42
GPA: 3.82
There are different 10 circles. What is the number of the greatest pos [#permalink]
### Show Tags
29 Apr 2016, 19:16
2
10
00:00
Difficulty:
35% (medium)
Question Stats:
59% (01:04) correct 41% (01:30) wrong based on 167 sessions
### HideShow timer Statistics
There are different 10 circles. What is the number of the greatest possible points with which the circles intersect?
A. 90
B. 100
C. 110
D. 180
E. 200
* A solution will be posted in two days.
_________________
MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
"Only $99 for 3 month Online Course" "Free Resources-30 day online access & Diagnostic Test" "Unlimited Access to over 120 free video lessons - try it yourself" ##### Most Helpful Expert Reply Math Expert Joined: 02 Aug 2009 Posts: 7111 Re: There are different 10 circles. What is the number of the greatest pos [#permalink] ### Show Tags 29 Apr 2016, 19:49 3 3 MathRevolution wrote: There are different 10 circles. What is the number of the greatest possible points with which the circles intersect? A. 90 B. 100 C. 110 D. 180 E. 200 * A solution will be posted in two days. Hi, if someone is not aware of the formula, you can easily do the Q through systematic approach.. VISUALIZATION can help us in these type of Qs, first circle - no intersection second circle - 2-points third circle- two existing circles s0 2*2 - 4.. and so on till 10th - 9 existing circle and 2-points on each = 2*9=18.. $$TOTAL = 0+2+4+...16+18 = 2(1+2+3+...8+9) = 2*9*\frac{10}{2} = 90$$ A _________________ 1) Absolute modulus : http://gmatclub.com/forum/absolute-modulus-a-better-understanding-210849.html#p1622372 2)Combination of similar and dissimilar things : http://gmatclub.com/forum/topic215915.html 3) effects of arithmetic operations : https://gmatclub.com/forum/effects-of-arithmetic-operations-on-fractions-269413.html GMAT online Tutor ##### General Discussion SC Moderator Joined: 13 Apr 2015 Posts: 1688 Location: India Concentration: Strategy, General Management GMAT 1: 200 Q1 V1 GPA: 4 WE: Analyst (Retail) Re: There are different 10 circles. What is the number of the greatest pos [#permalink] ### Show Tags 29 Apr 2016, 19:38 2 1 1 Maximum points of intersection between n different circles = n*(n - 1) = 10*9 = 90 Answer: A Similar question from Math Revolution: what-is-the-greatest-possible-number-of-points-at-which-11-circles-210362.html Math Revolution GMAT Instructor Joined: 16 Aug 2015 Posts: 6656 GMAT 1: 760 Q51 V42 GPA: 3.82 Re: There are different 10 circles. What is the number of the greatest pos [#permalink] ### Show Tags 04 May 2016, 06:24 1 1 2+2*2+…+2*9=2(1+2+…+9)=2(9)(10)/2=90 Hence, the correct answer is A. - Forget conventional ways of solving math questions. In DS, Variable approach is the easiest and quickest way to find the answer without actually solving the problem. Remember equal number of variables and independent equations ensures a solution. _________________ MathRevolution: Finish GMAT Quant Section with 10 minutes to spare The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy. "Only$99 for 3 month Online Course"
"Free Resources-30 day online access & Diagnostic Test"
"Unlimited Access to over 120 free video lessons - try it yourself"
Director
Status: Tutor - BrushMyQuant
Joined: 05 Apr 2011
Posts: 610
Location: India
Concentration: Finance, Marketing
Schools: XLRI (A)
GMAT 1: 700 Q51 V31
GPA: 3
WE: Information Technology (Computer Software)
Re: There are different 10 circles. What is the number of the greatest pos [#permalink]
### Show Tags
11 May 2017, 08:36
1
Top Contributor
MathRevolution wrote:
There are different 10 circles. What is the number of the greatest possible points with which the circles intersect?
A. 90
B. 100
C. 110
D. 180
E. 200
* A solution will be posted in two days.
_________________
Ankit
Check my Tutoring Site -> Brush My Quant
GMAT Quant Tutor
How to start GMAT preparations?
How to Improve Quant Score?
Gmatclub Topic Tags
Check out my GMAT debrief
How to Solve :
Statistics || Reflection of a line || Remainder Problems || Inequalities
Math Expert
Joined: 02 Sep 2009
Posts: 51263
Re: There are different 10 circles. What is the number of the greatest pos [#permalink]
### Show Tags
11 May 2017, 08:38
BrushMyQuant wrote:
MathRevolution wrote:
There are different 10 circles. What is the number of the greatest possible points with which the circles intersect?
A. 90
B. 100
C. 110
D. 180
E. 200
* A solution will be posted in two days.
_______________
Done. Thank you.
_________________
Director
Joined: 31 Jul 2017
Posts: 505
Location: Malaysia
GMAT 1: 700 Q50 V33
GPA: 3.95
WE: Consulting (Energy and Utilities)
Re: There are different 10 circles. What is the number of the greatest pos [#permalink]
### Show Tags
29 Jul 2018, 04:58
MathRevolution wrote:
There are different 10 circles. What is the number of the greatest possible points with which the circles intersect?
A. 90
B. 100
C. 110
D. 180
E. 200
* A solution will be posted in two days.
Maximum point of Intersection between n different Circles. = 2 *nC2, where n >= 2.
_________________
If my Post helps you in Gaining Knowledge, Help me with KUDOS.. !!
Re: There are different 10 circles. What is the number of the greatest pos &nbs [#permalink] 29 Jul 2018, 04:58
Display posts from previous: Sort by | 2018-12-17T19:59:56 | {
"domain": "gmatclub.com",
"url": "https://gmatclub.com/forum/there-are-different-10-circles-what-is-the-number-of-the-greatest-pos-217589.html",
"openwebmath_score": 0.5327728390693665,
"openwebmath_perplexity": 12661.079443611106,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. Yes\n2. Yes",
"lm_q1_score": 0.9752018398044143,
"lm_q2_score": 0.8856314723088732,
"lm_q1q2_score": 0.8636694411843053
} |
http://math.stackexchange.com/questions/132768/proof-of-equivalence | # Proof of equivalence?
How do I prove that if two numbers $a$ and $N$ are co-prime, then in the equation:
$$ax ≡ ay \pmod N$$
necessarily $x ≡ y \pmod N$
-
(Standard boilerplate): What have you tried? Is this homework? Are you working from a certain course/textbook on number theory? If you can avoid imperative words ("Prove") and favor infinitive questions ("How do I prove...?"), you might find a more fulfilling response from other users! – The Chaz 2.0 Apr 17 '12 at 1:23
Thanks for the advice! I'll keep it in mind next time. This isn't homework, just a bit of reading I am doing. – user26649 Apr 17 '12 at 1:36
$ax ≡ ay$ $(mod$ $N$) implies that $ax = ay + pN$ where $p \in \mathbb{Z}$. Then by subtracting $ay$ from both sides, we see that $ax - ay = a(x-y) = pN$. $a$ divides the left hand side of the equation, so it also must divide $pN$. But because $a \mid pN$ and $\gcd(a, N) = 1$, it must be the case that $a \mid p$. So there exists an integer $m$ such that $am = p$.
Then going back to $ax = ay + pN$, we can rewrite it as $ax = ay + (am)N$. If we divide the equation by $a$, we get $x = y + mN$. So we get $x \equiv y$ $(mod$ $N$)
-
You completely lost me after you arrived at a(x-y)= pN. Could you please explain the rest with a bit more detail? – user26649 Apr 17 '12 at 3:47
@FarhadYusufali: $a \mid a(x-y)$ means that there is an integer $k$ such that $ak = a(x-y)$. Do you see what $k$ should be? Since $a(x-y) = pN$, by substitution we see that $a \mid pN$. Then since we know $a \mid pN$ and $\gcd(a, N) = 1$ that means $a$ and $N$ do not have any factors in common, so $a \mid p$. – Student Apr 17 '12 at 15:34
Awesome thanks! – user26649 Apr 17 '12 at 15:53
$ax \equiv ay \mod N \implies N | (ax - ay) \implies N|a(x-y)$
But $N$ doesn't divide $a$, so $N | x-y \implies x \equiv y \mod N$
Here, I used that if $(c,d) = 1$, then $c | de \implies c | e$. If that's not immediately obvious, or known, try to prove that first.
-
Hint $\rm\ (a,n) = 1,\ n\:|\:az\:\Rightarrow\:n\:|\:az,nz\:\Rightarrow\:n\:|\:(az,nz) = (a,n)z = z.\:$ Now put $\rm\:z = x-y.$
-
Hint: If $\gcd(a,b)=1$ then there are $x,y\in\mathbb Z$ so that $ax+by=1$.
- | 2015-05-23T14:06:09 | {
"domain": "stackexchange.com",
"url": "http://math.stackexchange.com/questions/132768/proof-of-equivalence",
"openwebmath_score": 0.9406384229660034,
"openwebmath_perplexity": 217.4848934636518,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9752018405251303,
"lm_q2_score": 0.8856314617436728,
"lm_q1q2_score": 0.8636694315193912
} |
https://math.stackexchange.com/questions/3756066/modifying-frac-prod-alpha-a-alpha-prod-alpha-b-alpha-simeq-prod-alph | # Modifying $\frac{\prod_\alpha A_\alpha}{\prod_\alpha B_\alpha}\simeq \prod_\alpha\frac{A_\alpha}{B_\alpha}$ for direct sums
Let $$\{A_\alpha\}$$ be a family of $$R$$-modules, each $$B_\alpha\subset A_\alpha$$ a submodule and $$\pi_\alpha:A_\alpha\to A_\alpha/B_\alpha$$ be the canonical projection map. Then the map
$$\prod_\alpha\pi_\alpha:\prod_\alpha A_\alpha\to \prod_\alpha\frac{A_\alpha}{B_\alpha}$$
is surjective, and has kernel $$\prod_\alpha B_\alpha$$. Therefore, by the first isomorphism theorem we have
$$\frac{\prod_\alpha A_\alpha}{\prod_\alpha B_\alpha}\simeq \prod_\alpha\frac{A_\alpha}{B_\alpha}$$
What I'm curious about is how to modify this proof for direct sums. I know that when the family is finite then the direct sum and direct product coincide, so there's nothing to do there. It's when it's an infinite family where I'm uncertain. With $$\bigoplus_\alpha A_\alpha$$ then only finitely many components are non-zero, but I'm not sure if that means I'd need to alter the argument to account for this, or if it can simply be applied to direct sums as well to show that
$$\frac{\bigoplus_\alpha A_\alpha}{\bigoplus_\alpha B_\alpha}\simeq \bigoplus_\alpha\frac{A_\alpha}{B_\alpha}$$
So my question is, is an alteration to the argument above necessary for infinite direct sums?
• The argument is exactly the same, no? Rewrite everything with $\bigoplus$ in place of $\prod$. Jul 13, 2020 at 23:36
• @Batominovski Well that's what I'm not 100% sure about. Infinite direct sums and direct products have never sat well in my imagination, so I don't want to rely on intuition when it comes to justifying that the arguments would be identical. Jul 13, 2020 at 23:39
This answer here is solely for the purpose of giving this question an answer. Since the OP obtained the desired answer (see the comments under the question), I am providing a different way using category theory to show that $$P:=\frac{\prod\limits_{\alpha\in J}\,A_\alpha}{\prod\limits_{\alpha\in J}\,B_\alpha}\cong \prod_{\alpha\in J}\,\frac{A_\alpha}{B_\alpha}\text{ and }S:=\frac{\bigoplus\limits_{\alpha\in J}\,A_\alpha}{\bigoplus\limits_{\alpha\in J}\,B_\alpha}\cong \bigoplus_{\alpha\in J}\,\frac{A_\alpha}{B_\alpha}\,.$$ Explicit isomorphisms can be seen in (*) and (#).
For each $$\beta \in J$$, $$\iota_\beta:A_\beta\to \bigoplus\limits_{\alpha\in J}\,A_\alpha$$ and $$\pi_\beta: \prod\limits_{\alpha\in J}\,A_\alpha\to A_\beta$$ denote the canonical injection and the canonical projection, respectively. Let $$q:\bigoplus\limits_{\alpha\in J}\,A_\alpha\to S$$ be the quotient map. Then, $$q\circ \iota_\beta$$ vanishes on $$B_\beta$$. Therefore, $$q\circ \iota_\beta$$ factors through the quotient map $$q_\beta:A_\beta\to\dfrac{A_\beta}{B_\beta}$$. In other words, there exists a (unique) map $$i_\beta:\dfrac{A_\beta}{B_\beta}\to S$$ such that $$q\circ \iota_\beta=i_\beta\circ q_\beta\,.$$ We claim that $$S$$ together with the maps $$i_\beta:\dfrac{A_\beta}{B_\beta}\to S$$ for $$\beta\in J$$ is a categorical coproduct (direct sum) of the family $$\left(\dfrac{A_\alpha}{B_\alpha}\right)_{\alpha\in J}$$. Let $$T$$ be any $$R$$-module together with morphisms $$\tau_\beta:\dfrac{A_\beta}{B_\beta}\to T$$ for each $$\beta\in J$$. We want to show that a there exists a unique morphism $$\phi:S\to T$$ such that $$\phi\circ i_\beta=\tau_\beta$$ for each $$\beta\in J$$.
We define $$\phi\left((a_\alpha)_{\alpha\in J}+\bigoplus_{\alpha\in J}\,B_\alpha\right):=\sum_{\alpha\in J}\,\tau_\alpha\left(a_\alpha+B_\alpha\right)\text{ for all }(a_\alpha)_{\alpha\in J}\in\bigoplus_{\alpha\in J}\,A_\alpha\,.$$ It is easy to verified that $$\phi$$ is a well defined morphism, and it is the only morphism such that $$\phi\circ i_\beta=\tau_\beta$$ for all $$\beta\in J$$. We can now then conclude that $$S$$ is a coproduct of the family $$\left(\dfrac{A_\alpha}{B_\alpha}\right)_{\alpha\in J}$$. Since coproducts are unique up to isomorphism, we obtain $$S\cong \bigoplus\limits_{\alpha \in J}\,\dfrac{A_\alpha}{B_\alpha}$$, via the isomorphism $$\sigma:S\to \bigoplus\limits_{\alpha \in J}\,\dfrac{A_\alpha}{B_\alpha}$$ given by $$\sigma\left((a_\alpha)_{\alpha\in J}+\bigoplus_{\alpha\in J}\,B_\alpha\right):=\sum_{\alpha\in J}\,\bar{\iota}_\alpha\left(a_\alpha+B_\alpha\right)\text{ for all }(a_\alpha)_{\alpha\in J}\in\bigoplus_{\alpha\in J}\,A_\alpha\,,\tag{*}$$ where $$\bar{\iota}_\beta:\dfrac{A_\beta}{B_\beta}\to \bigoplus\limits_{\alpha\in J}\,\dfrac{A_\alpha}{B_\alpha}$$ is the canonical injection for each $$\beta\in J$$.
Observe now that, for every $$\beta\in J$$, $$q_\beta\circ \pi_\beta$$ vanishes on $$\prod\limits_{\alpha\in J}\,B_\alpha$$. Therefore, $$q_\beta\circ\pi_\beta$$ factors through the quotient map $$k:\prod\limits_{\alpha\in J}\,A_\alpha\to P$$. Ergo, there exists a (unique) morphism $$\varpi_\beta:P\to \dfrac{A_\beta}{B_\beta}$$ such that $$q_\beta\circ\pi_\beta=\varpi_\beta\circ k\,.$$ We claim that $$P$$ together with the morphisms $$\varpi:P\to \dfrac{A_\beta}{B_\beta}$$ is a categorical product (direct product) of the family $$\left(\dfrac{A_\alpha}{B_\alpha}\right)_{\alpha\in J}$$. Let $$Q$$ be any $$R$$-module together with morphisms $$\kappa_\beta:Q\to\dfrac{A_\beta}{B_\beta}$$ for all $$\beta\in J$$. We need to show that there exists a unique morphism $$\psi:Q\to P$$ such that $$\varpi_\beta\circ \psi=\kappa_\beta$$ for all $$\beta\in J$$.
We define $$\psi\left(x\right):=\big(\kappa_\alpha(x)\big)_{\alpha\in J}+\prod_{\alpha\in J}\,B_\alpha\text{ for all }x\in Q\,.$$ It is easily seen that $$\psi$$ is a well defined morphism, and it is the only morphism such that $$\varpi_\beta\circ \psi=\kappa_\beta$$ for all $$\beta\in J$$. We now conclude that $$P$$ is indeed a product of the family $$\left(\dfrac{A_\alpha}{B_\alpha}\right)_{\alpha\in J}$$. Since products are unique up to isomorphism, we have $$P\cong \prod\limits_{\alpha\in J}\,\dfrac{A_\alpha}{B_\alpha}$$ via the isomorphism $$\varsigma: \prod\limits_{\alpha\in J}\,\dfrac{A_\alpha}{B_\alpha}\to P$$ given by $$\varsigma\Big(\big(a_\alpha+B_\beta\big)_{\alpha\in J}\Big):=\big(a_\alpha\big)_{\alpha\in J}+\prod_{\alpha\in J}\,B_\alpha\text{ for all }\big(a_\alpha\big)_{\alpha\in J}\in \prod_{\alpha\in J}\,A_\alpha\,.\tag{#}$$ | 2022-07-01T07:27:01 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/3756066/modifying-frac-prod-alpha-a-alpha-prod-alpha-b-alpha-simeq-prod-alph",
"openwebmath_score": 0.9745703339576721,
"openwebmath_perplexity": 59.39496517026847,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9861513910054508,
"lm_q2_score": 0.8757869965109765,
"lm_q1q2_score": 0.8636585648337853
} |
http://www.summitcontractors.co.uk/nu4xa/7e6f32-maximum-flow-problem-with-vertex-capacities | We can construct a network Definition. f A flow f is a function on A that satisfies capacity constraints on all arcs and conservation constraints at all vertices except s and t. The capacity constraint for a A is 0 f(a) u(a) (flow does not exceed capacity). In 1955, Lester R. Ford, Jr. and Delbert R. Fulkerson created the first known algorithm, the Ford–Fulkerson algorithm. being the source and the sink of The flow value for an edge is non-negative and does not exceed the capacity for the edge. } {\displaystyle t} • Maximum flow problems find a feasible flow through a single-source, single-sink flow network that is maximum. ) with a set of sources The maximum value of an s-t flow is equal to the minimum capacity over all s-t cuts. V and Y {\displaystyle G} Perform one iteration of Ford-Fulkerson. 2. The main theorem links the maximum flow through a network with the minimum cut of the network. Max-Flow with Multiple Sources: There are multiple source nodes s 1, . {\displaystyle N} has a vertex-disjoint path cover {\displaystyle s} The aim of the max flow problem is to calculate the maximum amount of flow that can reach the sink vertex from the source vertex keeping the flow capacities of edges in consideration. Only edges with positive capacities are needed. {\displaystyle s} units of flow on edge it is given by: Definition. ′ The dynamic version of the maximum flow problem allows the graph underlying the flow network to change over time. However, this reduction does not preserve the planarity of the graph. The capacity of the cut is the sum of the capacities of the arcs in the cut pointing from S s to S t. It is a fundamental result that Max Flow = Min Cut. The residual capacity of an edge is equal to the original flow capacity of an edge minus the current flow. ( The maximum flow problem is to find a maximum flow given an input graph G, its capacities c uv, and the source and sink nodes s and t. 1. July 2020; Journal of Mathematics and Statistics 16(1) ... flow problem obtained by interpreting transit times as . ∈ One also adds the following edges to E: In the mentioned method, it is claimed and proved that finding a flow value of k in G between s and t is equal to finding a feasible schedule for flight set F with at most k crews.[16]. N t = {\displaystyle k} and {\displaystyle k} {\displaystyle G} Edge capacities: cap : E → R ≥0 • Flow: f : E → R ≥0 satisfying 1. Therefore, the problem can be solved by finding the maximum cardinality matching in out ) {\displaystyle G} That is, the positive net flow entering any given vertex is subject to a capacity constraint. 2. {\displaystyle n} This algorithm is efficient in determining maximum flow in sparce graphs. The push operation increases the flow on a residual edge, and a height function on the vertices controls through which residual edges can flow be pushed. ) A cut in a graph G=(V,E) is defined as C=(S,T) where S and T are two disjoint subsets of the V. A cut-set of the cut C is defined as subset of E, where for every edge (u,v), u is in S and v is in T. In level graph we assign a level to each node, which is equal to the shortest distance of the source to the node. s Given a network 0 / 4 10 / 10 Since every vertex allows only unit capacity, it has only one path passing through it. { Each edge e=(v,w) from v to w has a defined capacity, denoted by u(e) or u(v,w). From each company to t with residual capacity of the time complexity of the graph! Through it R ≥0 • flow: raw ( or gross ) flow total. Connected to j∈B be solved in polynomial time using a reduction to the minimum capacity over s-t... Whose nodes are the source and the destination vertex is the sink along which the flow network we the... Used to find vertex dijoint paths any given vertex is subject to a smaller height node that are number. Used to find the minimum needed crews to perform all the vertices with zero excess,. As long as there is no path left from the source to pixel i to pixel i by an from. Exceed the given capacity of an edge is fuv, then our algorithm is in! S and t { \displaystyle s } and t ) entering any given vertex is (... Does not preserve the planarity of the residual capacities is called a residual graph assigning. ], in addition to its Structure or capacities and consequently the value of flow that can flow through flow... A capacity one edge from a to b if the source to height! Value associated with it s-t flow is the inflow at t. maximum st-flow ( maxflow problem... With a source vertex s∈V and a sink vertex flow ) possible that the algorithm is a which. And Statistics 16 ( 1 )... flow problem for maximum goods can. 25 july 2018 18 / 28 of edges and vertices respectively to.... ) { \displaystyle G ' } instead segmenting an image network is a map c: E\to {. Considers one vertex for each arc in the path network to change over time a time. Description and links to implementations ( c, Fortran, C++, Pascal, maximum flow problem with vertex capacities can be implemented in (. Lecture notes to draw the residual graph remaining flow capacity in the network whose are! At least flow by $1$ destination vertex is Relabeled ( its height is ). Cs 401/MCS 401 ) two Applications of maximum flow ) assigning levels to job! Called a residual graph extended maximum network flow only unit capacity, it remains to compute a maximum flow problem with vertex capacities cut be! The first known algorithm, the vertex capacity constraints in the flow on an edge weight... Effect on proper estimation and ignoring them may mislead decision makers by overestimation the reduction of the problem is find... A: # ( s ) < # a maximum amount of passing! Flow algorithm graph with edge capacities equal to the Dictionary of algorithms maximum flow problem with vertex capacities Structures! Polynomial time maximum flow problem with vertex capacities for the static version of the maximum cardinality matching in G ′ { \displaystyle (. ^ { + }. [ 14 ] network whose nodes are the number of edges and vertices.! Can pass through an edge is the amount of flow that travels through the is. Which contains the information about where and when each flight departs and arrives one and Ace your interview... Through a flow network where the start vertex is the inflow at t. st-flow! Scheduling: every flight has 4 parameters, departure time, and we can possibly the... Capacities on both vertices and arcs and with multiple sources: there are multiple source nodes s 1, the! A flowto each edge can be treated as the original network transit times as the maximum-flow problem a... Minimum needed crews to perform all the flights with negative constraints, the augmenting paths are chosen at.. We being asked for in a network with the minimum cut can be.. V, a list of sinks { t 1, O ( VElogV ) be network. Request from the remaining flow capacity on an edge from s to t with capacity! Matching in G ′ { \displaystyle c: E\to \mathbb { R ^! … in optimization theory, maximum flow problem no NULLs, Optimizations in Union find Structure... Be extended by adding source and the sink they present an algorithm for the static version of airline the! S, t ∈ V being the source, enters the sink formulated! And ignoring them may mislead decision makers by overestimation Implementation is a set of f. Home page the first place: there are multiple sources and sinks ask expert... The bipartite graph is made such that we have an edge from t to from each student is equivalent solving! Treated as the source and the sink along which the flow through a can. Be considered as an application of extended maximum network flow the augmenting ow algorithm the... Efficient in determining maximum flow problem in directed planar graphs with capacities on vertices. Sources { s 1, ) be a network is a circulation that satisfies the demand through a flow the... Path passing through a flow is k { \displaystyle k }. }. [ 14 ] return... Equal to the height function we loose pij … one vertex for each arc i... The value of a flow function is a set of flights f which contains the information about and. State condition, find a flow network by adding source and the sink to Dictionary! Scheduling is finding the maximum flow problem the planarity of the network whose nodes are the of... V, E ) } be a network with the possibility of excess in the residual capacity at least a. Which suffers from risky events as there is an open path through the residual graph regarding to minimum. } instead: there are multiple source nodes s 1, in 1955, Lester R. Ford, Jr. Delbert... Run max-flow on this network, the maximum flow problem the capacities of the residual maximum flow problem with vertex capacities both. Adding source and sink only guaranteed to find the maximum flow is the maximum L-16. With vertex capacities and consequently the value of the problem and a capacity of u.! Is only guaranteed to find the maximum flow problems, such as circulation problem efficient! That can flow through a flow network by adding a lower bound for computing flows! Now, it pushes flow to a capacity one edge from V should point from v_out perform j... With each other to maintain a reliable flow ( except for s \displaystyle! Underlying the flow through it adjacent vertex with positive excess, i.e REST API in Flask finding a feasible through! Correction types are treated: edge capacity corrections and constant degree vertex additions/deletions and hence end up the! & Tarjan ( 1988 ) to each of the time complexity for dynamic. G, a list of sinks { t 1, 3 a breadth-first or dept-first Search computes cut... Vertex additions/deletions reliable flow and ignoring them may mislead decision makers by overestimation if there is an path! And height value associated with it L-16 25 july 2018 18 /.! ) { \displaystyle s } and t ) on this network and compute the result flow. Has no chance to finish the season Goldberg & Tarjan ( 1988.. Your tech interview Ford-Fulkerson algorithm to find the minimum cut, which to. The selection model are presented in this paper run the Ford-Fulkerson algorithm to vertex. Np-Hard even for simple networks pixel i to the minimum cut, and arrival time the minimum-cost flow problem a... Question and join our community Technology, new Delhi the vertex-capacity be implemented in O ( n ).! The vertex-capacity the relabel operation cross a minimum cut in O ( )! [ 14 ] maximum flows 22 the maximum-flow problem long as there is an open through... Has no chance to finish the season in the path b if the same face, then our algorithm be! { R } ^ { + }. }. }. 14... By interpreting transit times as graph, send the minimum needed crews to perform all flights. That network ( or equivalently a maximum flow problem, we 'll add an infinite capacity edge from to., internet routing B1 reminder the flow value on these edges graph receives to! Pixel, plus a source vertex is subject to a capacity one edge from s to vertex! J with weight pij a network flow problem 22 the maximum-flow problem real … maximum ow with capacity! To solve the problem becomes strongly NP-hard even for simple networks the flights \displaystyle N= ( V \in. Are two ways of defining a flow is equal to the Dictionary of algorithms and Data Structures home.... Regarding to the sink are on the same face, then the total cost is auvfuv variants! A preflow, i.e in most variants, the vertex each augmenting ˇfrom... Proper definitions of these operations guarantee that the algorithm is only guaranteed find! More complex network flow problem the first place pipes, internet routing B1 reminder the flow network key question how! And can be implemented in linear time, we 'll add an infinite capacity from... Which after removal would disconnect the source and the sink respectively on both vertices and arcs and with multiple and! Convention in the path consists of lower height directed graphs, where edge has a cost-coefficient auv in addition its! With capacity, the time complexity in this graph whose nodes are the number edges! Cardinality matching in G ′ { \displaystyle s } and t ) departure time, and can seen! Integer optimization { University of Jordan ) the maximum flow possible in the flow an... Compute the result allows only unit capacity, it pushes flow to a capacity for... 4 the minimum total weight of maximum flow problem with vertex capacities algorithm is run on the face...
Blue Dragon Street Food Satay Skewers, Rowing Scull Seats, Jeux Interdits - Guitare, Mobility Assistance Dog, Chrysanthemum Plant In Tamil, 70mm Offset Pan Connector, Bhldn Order Status, | 2021-04-11T16:23:48 | {
"domain": "co.uk",
"url": "http://www.summitcontractors.co.uk/nu4xa/7e6f32-maximum-flow-problem-with-vertex-capacities",
"openwebmath_score": 0.6996989846229553,
"openwebmath_perplexity": 1046.9943647938,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9787126441706494,
"lm_q2_score": 0.882427872638409,
"lm_q1q2_score": 0.8636433165198184
} |
https://gmatclub.com/forum/is-x-3-2-1-2-3-x-1-x-3-2-x-x-62992-20.html?kudos=1 | GMAT Question of the Day - Daily to your Mailbox; hard ones only
It is currently 21 Sep 2019, 12:35
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
we will pick new questions that match your level based on your Timer History
Track
every week, we’ll send you an estimated GMAT score based on your performance
Practice
Pays
we will pick new questions that match your level based on your Timer History
Is ((x-3)^2)^(1/2) = 3-x? (1) x ≠ 3 (2) -x|x| > 0
Author Message
TAGS:
Hide Tags
Intern
Joined: 16 Apr 2019
Posts: 9
Re: Is ((x-3)^2)^(1/2) = 3-x? (1) x ≠ 3 (2) -x|x| > 0 [#permalink]
Show Tags
04 Jun 2019, 10:05
Dear Brunel,
You said-
"Is (x−3)2−−−−−−−√=3−x(x−3)2=3−x?
Remember: x2−−√=|x|x2=|x|. Why?
Couple of things:
The point here is that square root function can not give negative result: wich means that some expression−−−−−−−−−−−−−−√≥0some expression≥0.
So x2−−√≥0x2≥0. But what does x2−−√x2 equal to?
Let's consider following examples:
If x=5x=5 --> x2−−√=25−−√=5=x=positivex2=25=5=x=positive;
If x=−5x=−5 --> x2−−√=25−−√=5=−x=positivex2=25=5=−x=positive."
My doubt is as follows-
All we know that sqrt of a number can be positive or negative results both, how you are saying "square root function can not give negative result"? If you kindly answer this question it would be a great help for me. Looking forward to hear you from.
Manhattan Prep Instructor
Joined: 04 Dec 2015
Posts: 813
GMAT 1: 790 Q51 V49
GRE 1: Q170 V170
Re: Is ((x-3)^2)^(1/2) = 3-x? (1) x ≠ 3 (2) -x|x| > 0 [#permalink]
Show Tags
04 Jun 2019, 10:14
tamalmallick wrote:
Dear Brunel,
You said-
"Is (x−3)2−−−−−−−√=3−x(x−3)2=3−x?
Remember: x2−−√=|x|x2=|x|. Why?
Couple of things:
The point here is that square root function can not give negative result: wich means that some expression−−−−−−−−−−−−−−√≥0some expression≥0.
So x2−−√≥0x2≥0. But what does x2−−√x2 equal to?
Let's consider following examples:
If x=5x=5 --> x2−−√=25−−√=5=x=positivex2=25=5=x=positive;
If x=−5x=−5 --> x2−−√=25−−√=5=−x=positivex2=25=5=−x=positive."
My doubt is as follows-
All we know that sqrt of a number can be positive or negative results both, how you are saying "square root function can not give negative result"? If you kindly answer this question it would be a great help for me. Looking forward to hear you from.
A lot of people ask this question - you're not alone. I'm not Bunuel, but I did write a short article about it once that should clear things up:
https://www.manhattanprep.com/gmat/blog ... -the-gmat/
_________________
Chelsey Cooley | Manhattan Prep | Seattle and Online
My latest GMAT blog posts | Suggestions for blog articles are always welcome!
Manager
Joined: 20 Feb 2018
Posts: 51
Location: India
Schools: ISB '20
Re: Is ((x-3)^2)^(1/2) = 3-x? (1) x ≠ 3 (2) -x|x| > 0 [#permalink]
Show Tags
25 Jun 2019, 00:17
Bunuel wrote:
gautamsubrahmanyam wrote:
I understand that 1) is insuff
But for 2) -x|x| > 0 means x cant be +ve => |x| = -x so that -x (-x) = x^2> 0
If x is -ve => (x-3)^2 = X^2+9-6x = (-ve)^2+9-6(-ve) = +ve+9-(-ve) = +ve +9 + (+ve) = +ve
=> sqrt ((x-3)^2) = +X-3
=> sqrt ( (x-3) ^2 ) is not equal to 3-x
=> Option B
Yes, the answer for this question is B.
Is $$\sqrt{(x-3)^2}=3-x$$?
Remember: $$\sqrt{x^2}=|x|$$. Why?
Couple of things:
The point here is that square root function cannot give negative result: wich means that $$\sqrt{some \ expression}\geq{0}$$.
So $$\sqrt{x^2}\geq{0}$$. But what does $$\sqrt{x^2}$$ equal to?
Let's consider following examples:
If $$x=5$$ --> $$\sqrt{x^2}=\sqrt{25}=5=x=positive$$;
If $$x=-5$$ --> $$\sqrt{x^2}=\sqrt{25}=5=-x=positive$$.
So we got that:
$$\sqrt{x^2}=x$$, if $$x\geq{0}$$;
$$\sqrt{x^2}=-x$$, if $$x<0$$.
What function does exactly the same thing? The absolute value function! That is why $$\sqrt{x^2}=|x|$$
Back to the original question:
So $$\sqrt{(x-3)^2}=|x-3|$$ and the question becomes is: $$|x-3|=3-x$$?
When $$x>3$$, then RHS (right hand side) is negative, but LHS (absolute value) is never negative, hence in this case equations doesn't hold true.
When $$x\leq{3}$$, then $$LHS=|x-3|=-x+3=3-x=RHS$$, hence in this case equation holds true.
Basically question asks is $$x\leq{3}$$?
(1) $$x\neq{3}$$. Clearly insufficient.
(2) $$-x|x| >0$$, basically this inequality implies that $$x<0$$, hence $$x<3$$. Sufficient.
Hope it helps.
Hi Bunuel, in the highlighted portion above, how can we deduce that x will be less than 3 if x is less than 0? x can be 1,2 also, right? May be I am missing something. Can you please clarify?
Math Expert
Joined: 02 Sep 2009
Posts: 58133
Re: Is ((x-3)^2)^(1/2) = 3-x? (1) x ≠ 3 (2) -x|x| > 0 [#permalink]
Show Tags
25 Jun 2019, 00:20
shobhitkh wrote:
Bunuel wrote:
gautamsubrahmanyam wrote:
I understand that 1) is insuff
But for 2) -x|x| > 0 means x cant be +ve => |x| = -x so that -x (-x) = x^2> 0
If x is -ve => (x-3)^2 = X^2+9-6x = (-ve)^2+9-6(-ve) = +ve+9-(-ve) = +ve +9 + (+ve) = +ve
=> sqrt ((x-3)^2) = +X-3
=> sqrt ( (x-3) ^2 ) is not equal to 3-x
=> Option B
Yes, the answer for this question is B.
Is $$\sqrt{(x-3)^2}=3-x$$?
Remember: $$\sqrt{x^2}=|x|$$. Why?
Couple of things:
The point here is that square root function cannot give negative result: wich means that $$\sqrt{some \ expression}\geq{0}$$.
So $$\sqrt{x^2}\geq{0}$$. But what does $$\sqrt{x^2}$$ equal to?
Let's consider following examples:
If $$x=5$$ --> $$\sqrt{x^2}=\sqrt{25}=5=x=positive$$;
If $$x=-5$$ --> $$\sqrt{x^2}=\sqrt{25}=5=-x=positive$$.
So we got that:
$$\sqrt{x^2}=x$$, if $$x\geq{0}$$;
$$\sqrt{x^2}=-x$$, if $$x<0$$.
What function does exactly the same thing? The absolute value function! That is why $$\sqrt{x^2}=|x|$$
Back to the original question:
So $$\sqrt{(x-3)^2}=|x-3|$$ and the question becomes is: $$|x-3|=3-x$$?
When $$x>3$$, then RHS (right hand side) is negative, but LHS (absolute value) is never negative, hence in this case equations doesn't hold true.
When $$x\leq{3}$$, then $$LHS=|x-3|=-x+3=3-x=RHS$$, hence in this case equation holds true.
Basically question asks is $$x\leq{3}$$?
(1) $$x\neq{3}$$. Clearly insufficient.
(2) $$-x|x| >0$$, basically this inequality implies that $$x<0$$, hence $$x<3$$. Sufficient.
Hope it helps.
Hi Bunuel, in the highlighted portion above, how can we deduce that x will be less than 3 if x is less than 0? x can be 1,2 also, right? May be I am missing something. Can you please clarify?
If a number is less than 0, does not it mean that it's less than 3?
_________________
Director
Joined: 24 Oct 2016
Posts: 511
GMAT 1: 670 Q46 V36
GMAT 2: 690 Q47 V38
Is ((x-3)^2)^(1/2) = 3-x? (1) x ≠ 3 (2) -x|x| > 0 [#permalink]
Show Tags
26 Jun 2019, 04:34
gmatnub wrote:
Is $$\sqrt{(x-3)^2} = 3-x$$?
(1) $$x\neq{3}$$
(2) $$-x|x| > 0$$
Attachment:
fasdfasdfasdfasdf.JPG
Alternative Approach
$$\sqrt{(x-3)^2} = 3-x$$?
|x - 3| = 3-x?
Case 1: |x-3| > 0 => x > 3
x-3 = 3-x?
2x=6?
x=3?
x=3 is not possible ever since x > 3
Case 2: |x-3| <= 0 => x <= 3
-x + 3 = 3-x?
0=0?
LHS = RHS?
This case would always be true since it can't violate any conditions.
Rephrased Q: Is x <= 3?
Stmt 1: x != 3
Doesn't tell anything about x if it's more than or less than 3. Not sufficient.
Stmt 2: -x|x| > 0
That implies x is always negative or x < 0. Hence x < 3 is also true. Sufficient.
Bunuel EducationAisle VeritasKarishma I got this Q wrong with my initial approach (shown below) of squaring both sides. I was wondering whether we can solve this Q by squaring both sides. If not, why not? I'm also confused how x=1 can be transformed with a few steps to give x=1 & -1 (shown below)? I would really appreciate if you could help me improve my understanding on this issue. Thanks!
Initial Approach: Square both sides
$$\sqrt{(x-3)^2} = 3-x$$?
Square both sides
(x-3)^2 = (3-x)^2?
x^2 + 9 - 6x = 9 + x^2 - 6x?
0 = 0?
LHS = RHS?
Not sure how to proceed?
x=1 transforms to x=+1,-1?
x = 1
Square both sides
x^2 = 1
Take square root of both sides
|x| = 1
x = +1, -1
_________________
If you found my post useful, KUDOS are much appreciated. Giving Kudos is a great way to thank and motivate contributors, without costing you anything.
Senior Manager
Joined: 19 Nov 2017
Posts: 254
Location: India
Schools: ISB
GMAT 1: 670 Q49 V32
GPA: 4
Re: Is (x-3)^2 =3-x ? (1) x not = 3 (2) -x|x| > 3 [#permalink]
Show Tags
30 Aug 2019, 22:20
jan4dday wrote:
Is $$\sqrt{(x-3)^2}=3-x$$?
(1) $$x\neq{3}$$
(2) -x|x| > 3
$$\sqrt{(x-3)^2}=3-x$$
This will be true only when x = 3 or x= 2
Statement 1
$$x\neq{3}$$
It might be equal to 2, 4, anything.
Insufficient.
Statement 2
$$-x|x| > 3$$
$$|x|$$ is always +ve
if $$-x|x| > 3$$, then $$-x > 0$$
this means that $$x$$ is -ve
if $$x$$ is -ve, it cannot equal either $$3$$ or $$2$$.
Sufficient.
Hence, B.
_________________
Vaibhav
Sky is the limit. 800 is the limit.
~GMAC
Intern
Joined: 20 Jun 2019
Posts: 41
Re: Is (x-3)^2 =3-x ? (1) x not = 3 (2) -x|x| > 3 [#permalink]
Show Tags
04 Sep 2019, 21:59
@Bunel - can you please explain how to approach this?
I am also confused of how to simplify the equation given in the question stem.
Math Expert
Joined: 02 Sep 2009
Posts: 58133
Re: Is ((x-3)^2)^(1/2) = 3-x? (1) x ≠ 3 (2) -x|x| > 0 [#permalink]
Show Tags
04 Sep 2019, 22:35
pzgupta wrote:
@Bunel - can you please explain how to approach this?
I am also confused of how to simplify the equation given in the question stem.
My solution is on the first page: https://gmatclub.com/forum/is-x-3-2-1-2 ... ml#p737280
_________________
Re: Is ((x-3)^2)^(1/2) = 3-x? (1) x ≠ 3 (2) -x|x| > 0 [#permalink] 04 Sep 2019, 22:35
Go to page Previous 1 2 [ 28 posts ]
Display posts from previous: Sort by | 2019-09-21T19:35:50 | {
"domain": "gmatclub.com",
"url": "https://gmatclub.com/forum/is-x-3-2-1-2-3-x-1-x-3-2-x-x-62992-20.html?kudos=1",
"openwebmath_score": 0.7552911043167114,
"openwebmath_perplexity": 3916.025053612328,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. Yes\n2. Yes",
"lm_q1_score": 0.9518632261523028,
"lm_q2_score": 0.9073122169746363,
"lm_q1q2_score": 0.8636371339768755
} |
https://math.stackexchange.com/questions/3731275/question-on-when-to-use-polar-coordinates-to-prove-existence-of-limit-does-the | # Question on when to use polar coordinates to prove existence of limit/ does the method always work?
Show that the following limit exists or does not exist (general example)
$$\lim \limits_{(x,y) \to (0,0)} \dfrac{e^{-x^2-y^2}-1}{x^2+y^2}$$
i) Direct substitution of $$x=0$$ , $$y=0$$ leads to indeterminate form of $$\frac{0}{0}$$
ii) Taking the limit along $$x$$ , $$y$$ axes and $$y=x$$ all result with the value $$0$$
iii) Convert to polar:
$$\lim \limits_{r \to 0^+} \dfrac{e^{-r^2}-1}{r^2}->\frac{0}{0}$$
$$L'Hopital's$$ $$rule$$
$$\lim \limits_{r \to 0^+} \dfrac{-2re^{-r^2}}{2r}=-1$$
So the limit exists and its value is -1
My questions:
1. After converting the limit expression to polar, why is $$\lim \limits_{r \to 0^+}$$ instead of $$\lim \limits_{r \to 0}$$ ? Both have the same computation
1. From the example above, how would I know if the limit $$DNE$$ when taking the limit after converting to polar? Would taking the limit of the polar converted expression $$DNE$$ or not give a finite number to know that the original limit $$DNE$$? This is of course if I chose to convert to polar without knowing that a different path gave a different limit.
2. When would it be appropriate to covert to polar to show the existence of a limit when not told that it existed or not in the first place? Does converting to polar always work?
$$\lim \limits_{(x,y) \to (0,0)} \dfrac{{xy^4}}{x^2+y^8}$$
• this limit $$DNE$$ as it has different limits along different paths namely $$y=0$$ and $$x = y^4$$, respectively 0 $$≠$$ $$\frac{1}{2}$$
Polar conversion: (this limit DNE, but polar conversion results in 0, a finite number)- to check
$$\lim \limits_{r \to 0^+} \dfrac{{rcosθ*r^4sin^4θ}}{r^2cos^2θ+r^8sin^8θ}$$
$$\lim \limits_{r \to 0^+} \dfrac{r^5({cosθ*sin^4θ})}{r^2(cos^2θ+r^6sin^8θ)}$$
$$\lim \limits_{r \to 0^+} \dfrac{r^3({cosθ*sin^4θ})}{cos^2θ+r^6sin^8θ}$$
$$\frac{0}{(cos^2(θ))}=0$$
The limit is 0
• Does converting to polar only work when (x,y) is approaching (0,0) or also work for say (x,y) is approaching a point like (-1,7)? Jun 23, 2020 at 11:11
• For the first question, I think it is just emphasising that $r$ cannot be negative so if you approach to $0$ you can only approach from the right Jun 23, 2020 at 11:16
• So does it mean that in polar coordinates, since it goes in counterclock-wise direction, it is same as $r->0^{+}$? Jun 23, 2020 at 11:18
For question 1, we take the limit as $$r \to 0^{+}$$ because in polar coordinates, $$r$$ represents the distance from the origin to point $$(x, y)$$ which is always non-negative.
For questions 2 and 3, keep in mind that we have
$$\lim_{(x, y) \to (0, 0)} \frac{e^{-x^2-y^2} - 1}{x^2 + y^2} = c$$
for some finite number $$c$$ if and only if
$$\lim_{r \to 0^{+}} \frac{e^{-r^2} - 1}{r^2} = c$$
In other words, the first limit is DNE if and only if the second one is DNE. Thus, if you manage to find some finite result $$c$$ for the second one, then you have also solved the first one. Sometimes, it is easier to evaluate limits in polar coordinates that in Cartesian coordinates so we take advantage of this when this applies.
An important note
Taking the limit along x , y axes and y=x all result with the value 0
It is important to note that in order for limit of a sequence to exist in a metric space like $$\mathbb{R}^2$$, all of its sub-sequences must also converge to that limit. That means that no matter how you walk your way to the limit, you must always arrive at the limit.
Hence, taking the limit along the $$x$$-axis, $$y$$-axis and the line $$y = x$$ is just one way to warn yourself early when the limit actually does not exist when these limits give different values.
But, if these limits all agree, this is not sufficient to say that the limit does converge to some finite number $$c$$ because there can be some distorted path to approach $$(0, 0)$$ for which a different limit can be computed.
However, the polar form takes into consideration all possible ways to walk to the origin because no matter how you approach $$(0, 0)$$, the distance from your point to $$(0, 0)$$ always converges to $$0$$, hence we have $$r \to 0^{+}$$.
• Also if the original limit had (x,y) approaching some other point like (-2,9), would converting to polar not work then since r is not approaching the origin? Jun 23, 2020 at 11:23
• For this specific limit in this question, yes, you cannot take advantage of the nice polar form to evaluate your limit easily if $(x, y)$ does not approach the origin. Jun 23, 2020 at 11:30
• Wait I put another example in my question now, and the limit does not exist by taking limit of different paths, but when converting to polar, the limit is 0, a finite number Jun 23, 2020 at 11:30
• Unfortunately, for that supposed counter-example, you can't take advantage of that nice polar form. Usually, the hint is the presence of $x^2 + y^2$. This is because $r$ is equal to the distance of $(x, y)$ to the origin, i.e. $r = \sqrt{x^2 + y^2}$ which is equivalent to $r^2 = x^2 + y^2$, the classic Pythagorean theorem. :) Jun 23, 2020 at 11:33
• Actually, there is a problem with the evaluation of your limit. The end result is $0/\cos^{2}\theta$ which is not always zero for all angles $\theta$. For instance, if you approach along the angle $\theta = \pi/2$, the expression evaluates to the indeterminate form $0/0$. However, in the first question, you had that nice $x^2 + y^2$ in it that you eliminated the $\theta$'s entirely when converted to polar form, so we were able to evaluate it easily to $-1$ without problems. :) Jun 23, 2020 at 11:44
If you restrict the polar argument to the range $$[0,2\pi)$$, the Cartesian-to-polar transformation is a bijection. Hence whatever limit computation you perform in polar coordinates gives exactly the same conclusion as when computed in Cartesian.
Polar coordinates are used for convenience when a polar symmetry (like in your example) or a significant simplification is apparent. | 2022-05-20T03:24:58 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/3731275/question-on-when-to-use-polar-coordinates-to-prove-existence-of-limit-does-the",
"openwebmath_score": 0.9587662816047668,
"openwebmath_perplexity": 248.28534330993153,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9683812318188365,
"lm_q2_score": 0.8918110468756548,
"lm_q1q2_score": 0.8636130801230928
} |
https://stats.stackexchange.com/questions/520033/determine-the-off-diagonal-elements-of-covariance-matrix-given-the-diagonal-e | # Determine the off - diagonal elements of covariance matrix, given the diagonal elements
I have some covariance matrix $$A = \begin{bmatrix}121 & c\\c & 81\end{bmatrix}$$
The problem is to determine the possible values of $$c$$.
Now I know that the elements of this matrix are given by the usual definition of the covariance,
$$\frac{1}{N-1} \sum_{i=1}^N (X_i - \bar{x})(Y_i - \bar{y})$$
and so e.g.
$$\frac{1}{N-1} \sum_{i=1}^N (X_i - \bar{x})^2 = 121$$
$$\frac{1}{N-1} \sum_{i=1}^N (Y_i - \bar{y})^2 = 81$$
But I can't see how to go from here to determining $$c$$?
• is it always 2x2 matrix? Apr 16 at 13:58
You might find it instructive to start with a basic idea: the variance of any random variable cannot be negative. (This is clear, since the variance is the expectation of the square of something and squares cannot be negative.)
Any $$2\times 2$$ covariance matrix $$\mathbb A$$ explicitly presents the variances and covariances of a pair of random variables $$(X,Y),$$ but it also tells you how to find the variance of any linear combination of those variables. This is because whenever $$a$$ and $$b$$ are numbers,
$$\operatorname{Var}(aX+bY) = a^2\operatorname{Var}(X) + b^2\operatorname{Var}(Y) + 2ab\operatorname{Cov}(X,Y) = \pmatrix{a&b}\mathbb A\pmatrix{a\\b}.$$
Applying this to your problem we may compute
\begin{aligned} 0 \le \operatorname{Var}(aX+bY) &= \pmatrix{a&b}\pmatrix{121&c\\c&81}\pmatrix{a\\b}\\ &= 121 a^2 + 81 b^2 + 2c^2 ab\\ &=(11a)^2+(9b)^2+\frac{2c}{(11)(9)}(11a)(9b)\\ &= \alpha^2 + \beta^2 + \frac{2c}{(11)(9)} \alpha\beta. \end{aligned}
The last few steps in which $$\alpha=11a$$ and $$\beta=9b$$ were introduced weren't necessary, but they help to simplify the algebra. In particular, what we need to do next (in order to find bounds for $$c$$) is complete the square: this is the process emulating the derivation of the quadratic formula to which everyone is introduced in grade school. Writing
$$C = \frac{c}{(11)(9)},\tag{*}$$
we find
$$\alpha^2 + \beta^2 + \frac{2c^2}{(11)(9)} \alpha\beta = \alpha^2 + 2C\alpha\beta + \beta^2 = (\alpha+C\beta)^2+(1-C^2)\beta^2.$$
Because $$(\alpha+C\beta)^2$$ and $$\beta^2$$ are both squares, they are not negative. Therefore if $$1-C^2$$ also is non-negative, the entire right side is not negative and can be a valid variance. Conversely, if $$1-C^2$$ is negative, you could set $$\alpha=-c\beta$$ to obtain the value $$(1-C^2)\beta^2\lt 0$$ on the right hand side, which is invalid.
You therefore deduce (from these perfectly elementary algebraic considerations) that
If $$A$$ is a valid covariance matrix, then $$1-C^2$$ cannot be negative.
Equivalently, $$|C|\le 1,$$ which by $$(*)$$ means $$-(11)(9) \le c \le (11)(9).$$
There remains the question whether any such $$c$$ does correspond to an actual variance matrix. One way to show this is true is to find a random variable $$(X,Y)$$ with $$\mathbb A$$ as its covariance matrix. Here is one way (out of many).
I take it as given that you can construct independent random variables $$A$$ and $$B$$ having unit variances: that is, $$\operatorname{Var}(A)=\operatorname{Var}(B) = 1.$$ (For example, let $$(A,B)$$ take on the four values $$(\pm 1, \pm 1)$$ with equal probabilities of $$1/4$$ each.)
The independence implies $$\operatorname{Cov}(A,B)=0.$$ Given a number $$c$$ in the range $$-(11)(9)$$ to $$(11)(9),$$ define random variables
$$X = \sqrt{11^2-c^2/9^2}A + (c/9)B,\quad Y = 9B$$
(which is possible because $$11^2 - c^2/9^2\ge 0$$) and compute that the covariance matrix of $$(X,Y)$$ is precisely $$\mathbb A.$$
Finally, if you carry out the same analysis for any symmetric matrix $$\mathbb A = \pmatrix{a & b \\ b & d},$$ you will conclude three things:
1. $$a \ge 0.$$
2. $$d \ge 0.$$
3. $$ad - b^2 \ge 0.$$
These conditions characterize symmetric, positive semi-definite matrices. Any $$2\times 2$$ matrix satisfying these conditions indeed is a variance matrix. (Emulate the preceding construction.)
• It might be worth mentioning that $C$ here is the correlation and, as shown, is always between $-1$ and $+1$ Apr 17 at 12:00
An intuitive method to determine this answer quickly is to just remember that covariance matrices may be interpreted in the form
$$$$A = \begin{pmatrix} \sigma_1^2 & \rho_{12}\sigma_1\sigma_2 &\rho_{13}\sigma_1\sigma_3 & \cdots & \rho_{1n}\sigma_1 \sigma_n \\ & \sigma_2^2 & \rho_{23}\sigma_2\sigma_3 & \cdots & \rho_{2n}\sigma_2 \sigma_n \\ & & \sigma_3^2 & \cdots & \rho_{3n}\sigma_3 \sigma_n \\ & & & \ddots & \vdots \\ & & & & \sigma_n^2 \end{pmatrix}$$$$
where $$\rho_{ab} \in [-1,1]$$ is a Pearson Correlation Coefficient. In your case you have
\begin{align} \sigma_1^2 = 121 ,~~~ \sigma_2^2 = 81 ~\Longrightarrow ~ |c| \leq \sqrt{121\cdot 81} = 99 \end{align}
i.e. $$c \in [-99, 99]$$.
• +1 This is a great answer for readers familiar with this representation of covariance matrices. I don't think it would be remiss, though, to point out that when $n\gt 2$ the correlation coefficients are subject to additional restrictions: it doesn't suffice for them all just to lie between $-1$ and $1.$ The case $n=3$ is discussed at stats.stackexchange.com/questions/72790.
– whuber
Apr 17 at 18:05
$$A$$ is posdef so by Sylvesters criterion $$det(A) = 121 \cdot 81 - c^2 \geq 0$$. Thus, any $$c \in [-99, 99]$$ will produce a valid covariance matrix.
• Covariance matrices can be positive semi-definite right? Does the semi here change anything? Apr 16 at 15:23
• semi is the case when c is exactly 99 and det = 0. Apr 16 at 16:16
• @Hunaphu $c=+99$ and $c=-99$ both lead to zero determinant. If $-99 < c < +99$ then you would have a strictly positive definite matrix Apr 17 at 12:03
There are three main possibilities of note. One is that the variable are uncorrelated, in which case the off-diagonal entries are easy to calculate as 0. Another possibility is that you don't really have two different variables. $$y$$ is simply a scalar multiple of $$x$$ (i.e. perfect correlation). If $$y= c x$$, then $$\sigma_{xy} =\sigma_{x}\sigma_{xy}=99$$. We get a third possibility in noting that the above assumes $$c>0$$. For $$c<0$$, we get $$\sigma_{xy} =-99$$.
Geometrically, the covariance between two vectors is the product of their lengths times the cosine of the angle between them. Since the cosine varies from $$-1$$ to $$1$$, the covariance ranges from the product of their lengths to the negative of the product.
Another approach is to consider $$z_1 = \frac{x-\mu_{x}}{\sigma_{x}}$$ and $$z_2 = \frac{y-\mu_y}{\sigma_{y}}$$. $$\sigma_{xy} = \sigma_{(\sigma_x z_1)(\sigma_y z_2)}=\sigma_x \sigma_y \sigma_{z_1z_2}=99\sigma_{z_1z_2}$$ and $$\sigma_{z_1z_2}$$ is simply the correlation between $$x$$ and $$y$$, which ranges from $$-1$$ to $$1$$. | 2021-10-28T03:12:52 | {
"domain": "stackexchange.com",
"url": "https://stats.stackexchange.com/questions/520033/determine-the-off-diagonal-elements-of-covariance-matrix-given-the-diagonal-e",
"openwebmath_score": 0.9890829920768738,
"openwebmath_perplexity": 230.55744433819177,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9899864287859482,
"lm_q2_score": 0.8723473813156294,
"lm_q1q2_score": 0.8636120686894337
} |
https://math.stackexchange.com/questions/452889/do-all-symmetric-n-times-n-invertible-matrices-have-a-square-root-matrix | # Do all symmetric $n\times n$ invertible matrices have a square root matrix?
My question relates to the conditions under which the spectral decomposition of a nonnegative definite symmetric matrix can be performed. That is if $A$ is a real $n\times n$ symmetric matrix with eigenvalues $\lambda_{1},...,\lambda_{n}$, $X=(x_{1},...,x_{n})$ where $x_{1},...,x_{n}$ are a set of orthonormal eigenvectors that correspond to these eigenvalues (i.e. $X$ is an orthogonal matrix), and $\Lambda=\text{diag}(\lambda_{1},...,\lambda_{n})$ then
$A=X\Lambda X'$
is the spectral decomposition of $A$. If we then let $A^{1/2}=X\Lambda^{1/2}X'$, where $\Lambda^{1/2}$ is a square root matrix of $\Lambda$ - i.e. $\Lambda^{1/2}\Lambda^{1/2}=\Lambda$, then $A^{1/2}A^{1/2}=A$. Thus $A^{1/2}$ is a square root matrix of $A$.
So if a real nonnegative definite symmetric $n\times n$ matrix $A$ has $n$ eigenvalues then the matrix has a spectral decomposition and thus a square root matrix too. My question is do all symmetric $n\times n$ invertible matrices have $n$ eigenvalues, and thus a square root matrix? Furthermore it is not clear to me whether the eigenvalues have to be distinct or not.
• All real symmetric matrices are diagonalisable, does that help?? – Vishesh Jul 26 '13 at 16:37
• The eigenvalues can be repeated. If the geometric multiplicity of the eigenvalues is the same as the algebraic multiplicity then the matrix can be diagonalized. Not all symmetric matrices have distinct eigenvalues, take the identity. – Wintermute Jul 26 '13 at 16:46
• Oh yes, my bad, I totally forgot that. Thanks – Vishesh Jul 26 '13 at 16:50
• @dandar: Your question suggests you're asking about matrices with real entries, in which case perhaps $\Lambda$ is also required to be real? If that's correct, it's instructive to look at the $1 \times 1$ case. – Andrew D. Hwang Jul 26 '13 at 16:52
• Yes the OP should clarify whether the matrix is real, and (if so) whether the square-root is supposed to be real. On the other hand, all complex matrices have complex square-roots; no symmetry is required for that. – GEdgar Jul 26 '13 at 16:56
## 4 Answers
All symmetric matrices are diagonalizable, therefore they have $n$ eigenvalues (which don't have to be distinct, by the way), all of which are real. The spectral theorem says:
We can decompose any symmetric matrix $A\in S^n$ using symmetric eigendecomposition: $$A = \sum_{i=1}^n\lambda_iq_iq_i^T = Q\Lambda Q^T, \qquad \Lambda=diag(\lambda_i,\dots,\lambda_n)$$ where the matrix $Q = [q_1,\dots,q_n]$ is orthogonal (with $Q^TQ=I_n$), and contains the eigenvectors of $A$, while the diagonal matrix $\Lambda$ contains the eigenvalues of A.
The matrix "power rule": $$A^k = Q\Lambda^k Q^{-1}$$ can be used (with $k<0$ being allowed for invertible matrices, which means there should be no $\lambda_i=0$). Note that if there are negative eigenvalues, $\Lambda^{\frac{1}{2}}$ will become complex.
Note that in the complex case, the transpose operations should be replaced with the Hermitian operation (the conjugate transpose).
• Thank-you for the reply, and yes I now see that all symmetric matrices are diagonalizable. This is because if the matrix is $n\times n$ then we can always construct a set of $n$ orthonormal eigenvectors - i.e. regardless of whether the eigenvalues are repeated or not. Thus we can always compute the spectral decomposition and hence the square root matrix will exist. – dandar Jul 26 '13 at 17:12
What about the matrix $(-1){}{}{}{}{}{}{}{}{}{}{}$?
• Thank-you for your response. You have found a flaw in my inital summary of the use of the spectral decomposition to find the square root matrix of $A$. I should have stated that $A$ needs to be nonnegative definite. This ensures all the eigenvalues of $A$ are greater than or equal to $0$ which precludes your counter-example. – dandar Jul 26 '13 at 17:31
For your first question: that you can diagonalize real symmetric matrices is the so-called spectral theorem.
For the second: your argument is general; you did not use that the eigenvalues were distinct.
• Thanks for the reply. Yes you are right the theory for the spectral theorem does not care about whether or not the $n$ eigenvalues of $A$ are distinct or not. – dandar Jul 26 '13 at 17:13
Matrix square root can be defined in many ways. If you just want $X$ such that $X^2 = A$, you approach is good.
However, the principal square root is defined only for the matrices with no strictly negative eigenvalues and zero being at most nonderogatory eigenvalue (which is unimportant here, since symmetric matrices are diagonalizable).
The importance of the principal square root lies in the fact that it is a unique square root with the spectrum in the open right half-plane. If we extended this to the matrices with the real negative eigenvalues, we would either lose uniqueness, or the "open right half-plane" would have to be replaced by something less nice. Of course, there are reasons to ask for this. Read more in Higham's "Functions of Matrices".
Since you ask about symmetric matrices, your eigenvalues are real, so you can only define principal square root if your matrix has nonnegative eigenvalues, which means it is positive semidefinite. That also means that your square (or any other) root will also be positive semidefinite, which can be easily seen from the eigenvalue (spectral) decomposition.
• Thank-you for your reply. I had not realised the definition of a square root matrix has many forms. – dandar Jul 26 '13 at 17:19
• You can compare it to the square root in the set of the nonnegative real numbers. Principal square root is, for example, $\sqrt{4}=2$, but nothing prevents us to also consider $-2$ as a square root of $4$. We even do so, for example, when solving quadratic equations (the $\pm$ sign before $\sqrt{b^2-4ac}$). Unlike the real numbers, which can be considered matrices with a single element, general matrices have much more elements ($n^2$ of them), so you get a much wider variety of candidates for a square root (basically, all combinations of choices for the square root of the eigenvalues). – Vedran Šego Jul 26 '13 at 17:41 | 2021-06-16T01:27:04 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/452889/do-all-symmetric-n-times-n-invertible-matrices-have-a-square-root-matrix",
"openwebmath_score": 0.9345937967300415,
"openwebmath_perplexity": 170.44613063158704,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9822877007780707,
"lm_q2_score": 0.8791467580102418,
"lm_q1q2_score": 0.8635750475723754
} |
https://diydrones.com/forum/topics/tricopter-physics-help?commentId=705844%3AComment%3A2443655 | # Tricopter physics help
Hello!
I have been studying how exactly a tricopter works and I came across a problem that is not quite clear to me...
I understand that the tail rotor has to be slightly tilted for a specific angle alpha in order for the horizontal component Fx to counteract the unbalanced torques of the 3 propellers. However this Fx component of force F now causes that the sum of all forces is not zero - therefore the tricopter will constantly try to drift in the direction of Fx when trying to hoover!?
(see the attached sketch)
Am I missing something here or is my conclusion correct?
How is this problem handled? Do you constantly have to correct for this drift by rolling or is this effect negligible?
Thank you for any input! =)
Views: 2612
### Replies to This Discussion
The angle is adjusted by a servo to keep the heading constant.
I can help you out. But first I want you to draw a full tricopter diagram so that way I can better explain it to you by referencing your own figure.
So draw a tricopter from a top down. Include all the the prop rotations, the resulting moments, and resulting forces like you have above. Label each motor to make things easier. If you do that I can do my best to explain what is going on.
Conventional helicopters have this same problem too as a result of the tail rotor, and often hover at a very slight roll angle.
I had not considered the tri copter in this same way before, but at first glance, I believe you are right.
Thank you for all the responses! =)
@Johnatan Hair
Somehow I forgot that the helicopter has a very similar situation going on with the tail rotor! Thank you for reminding me on that! =)
@WuStangDan
I would be very grateful if you could do that and explain the problem from your perspective. I draw a figure by hand as you asked - I hope it is clear enough. I chose the tricopter where the front two rotors rotate in opposite directions, so that the unbalanced torque and therefore angle alpha can be smaller.
In addition I added two pages of my calculations. On first page there are the three conditions for balancing torques and on the second page I wrote the sums of forces. Clearly the force Fx remains in the end.
Thank you!
Okay perfect.
So yes your calculations are correct. If a tricopter was flying exactly like you have drawn, where the servo motor is at the exact angle $\alpha$ to balance out the the moment in the z axis, the triopter would have a single force in the x axis.
The reason why I wanted you to do the full calculations is make sure that you understood that you haven't actually missed something in your calculations. Becuase the real answer to your question is somewhat of a let down, I didn't want you to go back to your calculations because you didn't believe me.
So tricopters don't "drift" in the x direction when flying in real life. So that means there is something missing from your drawing. You have propellers, motors that can rotate the propellers, and most of the standard parts of a multirotor. But you don't have a negative feedback controller that all multirotors have. Now the IMU in a multirotor cannot detect when it is "drifting" at a constant velocity. So if you had your multirotor sitting in the trunk of your car while you drove down the highway, the gyros would report the same values as if they were flat on the ground. But a constant force on a body does not move it at a constant velocity. Newtons second law states that the tricopter would begin accelerating in the x direction, not just slowly "drift" like I'm assuming you thought it would based on the wording you used in your question. IMU's can detect acceleration so therefore the negative feed back controller would detect it, and change the speed between the two front motors to balance that acceleration.
This will make the tricopter no longer perfectly flat, but rather at a slight angle, making it so that F1 and F2 now both have x components.
First of all thank you very much for the detailed answer!
Reading your explanation confirmed my own thinking when I was doing the calculations above:
"Tricopter cannot hoover still when oriented horizontally. It has to be slightly tilted around y axis to counteract the F3x force"
Maybe "drifting" was a poorly chosen word - I understand that the tricopter would accelerate in direction of F3x until in equillibrium with air drag.
Thanks - now I really understand how a tricopter works. =)
Hi. I was hoping you still check this site or whatever but you would greatly help me if you could tell me about the sources of your knowledge and where you got to know such detailed info along with the diagrams and stuff? i desperately need them and wherever i look, its wayyy to complex for my understanding. Its imperative that i manage to find the completer working of the tricopter-equations,torque balancing and all. Thanks! :D
Vidur said:
Hi. I was hoping you still check this site or whatever but you would greatly help me if you could tell me about the sources of your knowledge and where you got to know such detailed info along with the diagrams and stuff? i desperately need them and wherever i look, its wayyy to complex for my understanding. Its imperative that i manage to find the completer working of the tricopter-equations,torque balancing and all. Thanks! :D
Hi Vidur! I was notified per email of your reply, however, I am afraid I don't have any specific sources I could recommend because I derived the equations above myself.
I started by researching the tricopters frame geometry and kinematics, then I found a suitable (simplified) relationship between propellers angular velocity and its thrust & torque. After that you just need to set the balance of forces and torques in all three directions (x,y & z) and use algebra to get to the solution you seek.
Note that my deriavation is far from complete since it is limited to a steady-state solution (tricopter hovering still). I only used it to clear up some confusion I had about the hovering state of a tricopter. If you wanted to derive a complete dynamic model for a tricopter you would also need to include acceleration terms, as well take air drag into account. Note that at higher velocities, incoming airflow could also significantly affect the thrust on the rotor, which you would somehow have to take into account and when flying at low altitutudes ground effect might also play a role.
As you probably see, there are many physical phenomenon that affect tricopter's flight, which is probably the reason most derivations of dynamics equations become so complex. You first need to consider what is actually the goal you are trying to achieve with your model (equations) and then evaluate which physical effects you will have to include and which you could neglect.
oh i see. Well that definitely seems like an uphill task. Could you provide me whatever links that you used in order to get any sort of insight into this? I would be very glad if i could get some sort of starting point to go about my research!
Primoz K said:
Vidur said:
Hi. I was hoping you still check this site or whatever but you would greatly help me if you could tell me about the sources of your knowledge and where you got to know such detailed info along with the diagrams and stuff? i desperately need them and wherever i look, its wayyy to complex for my understanding. Its imperative that i manage to find the completer working of the tricopter-equations,torque balancing and all. Thanks! :D
Hi Vidur! I was notified per email of your reply, however, I am afraid I don't have any specific sources I could recommend because I derived the equations above myself.
I started by researching the tricopters frame geometry and kinematics, then I found a suitable (simplified) relationship between propellers angular velocity and its thrust & torque. After that you just need to set the balance of forces and torques in all three directions (x,y & z) and use algebra to get to the solution you seek.
Note that my deriavation is far from complete since it is limited to a steady-state solution (tricopter hovering still). I only used it to clear up some confusion I had about the hovering state of a tricopter. If you wanted to derive a complete dynamic model for a tricopter you would also need to include acceleration terms, as well take air drag into account. Note that at higher velocities, incoming airflow could also significantly affect the thrust on the rotor, which you would somehow have to take into account and when flying at low altitutudes ground effect might also play a role.
As you probably see, there are many physical phenomenon that affect tricopter's flight, which is probably the reason most derivations of dynamics equations become so complex. You first need to consider what is actually the goal you are trying to achieve with your model (equations) and then evaluate which physical effects you will have to include and which you could neglect.
1
2
3
4
5
6
7
8
9
## Groups
4 members
283 members
1074 members
77 members
• ### X-UAV Talon
164 members
Season Two of the Trust Time Trial (T3) Contest
A list of all T3 contests is here. The current round, the Vertical Horizontal one, is here | 2019-11-12T19:23:48 | {
"domain": "diydrones.com",
"url": "https://diydrones.com/forum/topics/tricopter-physics-help?commentId=705844%3AComment%3A2443655",
"openwebmath_score": 0.5613716840744019,
"openwebmath_perplexity": 617.6492788618665,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9822876992225169,
"lm_q2_score": 0.8791467564270271,
"lm_q1q2_score": 0.863575044649643
} |
https://math.stackexchange.com/questions/584242/number-of-elements-of-3n-binary-tuples-where-the-ordinates-add-up-to-2n | # Number of elements of $3n$ binary tuples, where the ordinates add up to $2n$.
I have the following problem.
Take $$\Omega_n=\{(a_1, a_2 , \cdots , a_{3n})| a_i= 0\rm{\,or}\, 1\}$$. Define $$A_n=\{\omega \in \Omega_n|\exists k, \sum _{i=1}^{3k} a_i = 2k\}$$ and $$S_m=\{(a_1, a_2 , \cdots , a_{3m}) \in A_m|\inf \{ k,| \sum _{i=1}^{3k} a_i = 2k\}=m\}$$ we are interested in finding $$|S_m|$$ the cardinality of $$S_m$$
There is a straightforward recursive formula$$S_n={3n \choose 2n}-\left (S_1 {3(n-1) \choose 2(n-1)}+S_2{3(n-2) \choose 2(n-2)}+ \cdots S_{n-1} {3\cdot(1) \choose 2\cdot(1)} \right )= {3n\choose 2n}-\left (\sum _{i=1}^{n-1}S_i {3(n-i)\choose 2(n-i)} \right )$$ I was not sure how to compute that so I used OEIS to see if it has some nice formula. After finding by hand the first values $$3,6,21,90,429$$ it suggested me the formula $$\frac{2}{3n-1}{3n\choose 2n}$$. I managed to prove it by induction.
I would be interested in some combinatorial proof of that, a bijection would be highly appreciated.
• What is "inf" ? Do you mean the smallest $k$ for which the summation holds? – Doc Nov 28 '13 at 6:20
• @Doc out of habit infimum, yes exactly – clark Nov 28 '13 at 6:24
• Not at all there yet, but it seems interesting that the answer also takes the form $\frac{1}{n} {3n-1\choose n}$. – Doc Nov 28 '13 at 6:37
• oops .... that should say $\frac{3}{3n-1} {3n-1\choose n}$. – Doc Nov 28 '13 at 7:36
• @Doc: Or $\frac3n\binom{3n-2}{n-1}$, though that isn’t obviously any more useful. – Brian M. Scott Nov 29 '13 at 19:42
Code heads as 1 and tails as 0, and the problem can be phrased in the following way: Flip a fair coin until you have exactly twice as many heads as tails, and then stop. The value of $|S_n|$ is the number of such sequences of coin flips that have length exactly $3n$.
For this rephrased version, I asked the same question as the OP a couple of years ago on this site, under "Combinatorial proof of $\binom{3n}{n} \frac{2}{3n-1}$ as the answer to a coin-flipping problem." It took me a few weeks before I found an answer to my own question, so I wouldn't call this an easy combinatorial proof to come up with. (In fact, I generalized my argument, recast it in terms of counting certain lattice paths, and got the argument published in the Electronic Journal of Combinatorics as "Enumerating Lattice Paths Touching or Crossing the Diagonal at a Given Number of Lattice Points.")
Anyway, I'll reproduce my original combinatorial argument here. It uses the equivalent $|S_n| = \frac{3}{3n-1} \binom{3n-1}{n}$ as the formula to be proved. It also uses the following result (see, for example, Section 7.5 of Concrete Mathematics):
Raney's Lemma: Let $a_1, ... a_m$ be a sequence of integers such that $\sum a_i = 1$. There is a unique index $j$ such that the partial sums of the sequence $a_j, a_{j+1}, ... a_{j+m-1}$ (cyclic indices) are positive.
On to the proof.
Intro.
Consider the sequences with $2n$ occurrences of $-1$ (i.e., $2n$ heads) and $n$ occurrences of $+2$ (i.e., $n$ tails). We want to show that the number of these sequences with all partial sums nonzero is $\binom{3n-1}{n} \frac{3}{3n-1}$. The complete sum and empty sum are clearly $0$, so "partial sum" excludes those two cases. The sequences we want to count can be split into three groups: (1) all partial sums positive, (2) all partial sums negative, (3) some partial sums positive and some negative.
Group 1: The number of these sequences with all partial sums positive is $\binom{3n-1}{n} \frac{1}{3n-1}$.
This is the part that uses Raney's lemma. If all partial sums are positive, the last element in the sequence must be $-1$. Thus we want to count the number of sequences with $2n-1$ occurrences of $-1$ and $n$ occurrences of $+2$ that add to $+1$ and have all partial sums positive. Ignoring the partial sums restriction, there are $\binom{3n-1}{n}$ such sequences. If we partition these $\binom{3n-1}{n}$ sequences into equivalence classes based on cyclic shifts, Raney's lemma says that exactly one sequence in each equivalence class has all partial sums positive. Because there are $3n-1$ elements in each sequence there are $3n-1$ sequences with the same set of cyclic shifts, and so there are $3n-1$ sequences in each equivalence class. Thus the number of sequences in Group 1 is $\binom{3n-1}{n} \frac{1}{3n-1}$.
Group 2: The number of these sequences with all partial sums negative is also $\binom{3n-1}{n} \frac{1}{3n-1}$.
To see this, just reverse the sequences counted in Part 1.
Group 3: The number of these sequences with some positive partial sums and some negative partial sums is, yet again, $\binom{3n-1}{n} \frac{1}{3n-1}$.
This one is a little trickier. First, because of the $-1$'s, it is not possible to switch from positive partial sums to negative partial sums. Thus any sequence counted here must have exactly one switch: from negative partial sums to positive partial sums. The switch must occur at some point where the partial sum is $-1$ and the next element is $+2$. Thus we have some sequence $(a_1, \ldots, a_m, +2, a_{m+2}, \ldots, a_n)$ where the sums $a_1, a_1 + a_2, \ldots, a_1 + \cdots + a_m$ are all negative. Consider the sequence $(+2, a_m, \ldots, a_2, a_1, a_{m+2}, \ldots, a_n)$. Since $+2 + a_m + \cdots + a_1 = 1$, and $a_k + a_{k-1} + \cdots + a_1 < 0$ for all $k$, $1 \leq k \leq m$, it must be the case that $+2 + a_m + \cdots + a_{k+1} > 1$ for all $k$, $1 \leq k \leq m-1$. So the sequence $(+2, a_m, \ldots, a_2, a_1, a_{m+2}, \ldots, a_n)$ is in Group 1. To see that this mapping is a bijection, note that any sequence in Group 1 must start with $+2$ and have a first time that a partial sum is equal to $+1$. Thus this transformation is reversible.
Summing up.
Putting Groups 1, 2, and 3 together we see that the total number of sequences we want to count is $\binom{3n-1}{n} \frac{3}{3n-1}$.
• This is great! I didnt know about Ranney's Lemma, it was hidden all along this problem, it was nicely exploited! – clark Dec 5 '13 at 0:05 | 2021-01-23T23:38:08 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/584242/number-of-elements-of-3n-binary-tuples-where-the-ordinates-add-up-to-2n",
"openwebmath_score": 0.9342162609100342,
"openwebmath_perplexity": 183.75081048575186,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.987946220128863,
"lm_q2_score": 0.8740772482857833,
"lm_q1q2_score": 0.8635413135445773
} |
https://www.physicsforums.com/threads/prove-by-induction.211809/ | # Prove by Induction.
1. Jan 29, 2008
### PFStudent
1. The problem statement, all variables and given/known data
1.1.2
Write,
$${\frac{1}{1\cdot2}} + {\frac{1}{2\cdot3}} + {\frac{1}{3\cdot4}} + . . . + {\frac{1}{99\cdot100}}$$
as a fraction in lowest terms.
3. The attempt at a solution
Rewriting the problem as a summation,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\frac{1}{1\cdot2}} + {\frac{1}{2\cdot3}} + {\frac{1}{3\cdot4}} + . . . + {\frac{1}{n\cdot(n+1)}}$$
Then considering the first few terms,
$${\frac{1}{1\cdot2}} = \frac{1}{2}$$
$${\frac{1}{1\cdot2}} + {\frac{1}{2\cdot3}} = \frac{2}{3}$$
$${\frac{1}{1\cdot2}} + {\frac{1}{2\cdot3}} + {\frac{1}{3\cdot4}} = \frac{3}{4}$$
This leads to the conjecture that,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\frac{n}{n+1}}$$
How would I prove the above by induction?
-PFStudent
Last edited: Jan 29, 2008
2. Jan 29, 2008
### rock.freak667
Assume the statement is true for n=N, then prove true for n=N+1
EDIT:
$$\sum_{i=1} ^{n} \frac{1}{i(i+1)}=\frac{n}{n+1}$$
3. Jan 29, 2008
### jdavel
the last term in your sum (where i = n) is going to be 1/n(n+1). if you take the sum one further (to i = n+1) what will the last term be now?
4. Jan 29, 2008
### PFStudent
Hey,
Thanks for the reply rock.freak667 and jdavel.
Assume,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\frac{n}{n+1}}$$
is true for k. That is,
$${{\sum_{i = 1}^{k}}{\frac{1}{i(i+1)}}} = {\frac{k}{k+1}}$$
Then to prove it is true for k+1, consider the following,
$${{\sum_{i = 1}^{k+1}}{\frac{1}{i(i+1)}}} = {{\sum_{i = 1}^{k}}{\frac{1}{i(i+1)}}} + {\frac{1}{k+1((k+1)+1)}}$$
Which reduces to,
$${{\sum_{i = 1}^{k+1}}{\frac{1}{i(i+1)}}} = {\frac{k}{k+1}} + {\frac{1}{{k^2}+3k+1)}}$$
However, how do I know the above is true?
In other words how do I know if the proof by induction actually proved it?
Thanks,
-PFStudent
5. Jan 29, 2008
### rock.freak667
Well you basically want to get
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\frac{(k+1)}{(k+1)+1}}$$
basically the sum is the same but instead of "n" put k+1
6. Jan 29, 2008
### jdavel
you're missing a pair of parenetheses in your 3rd equation that's leading to an error in the last term of your 4th equation. what should that last term be?
7. Jan 29, 2008
### PFStudent
Hey,
Consider the following,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\frac{n}{n+1}}$$
Assume it is true for k,
$${{\sum_{i = 1}^{k}}{\frac{1}{i(i+1)}}} = {\frac{k}{k+1}}$$
Now, if it is true for k+1 the result expected is,
$${{\sum_{i = 1}^{k+1}}{\frac{1}{i(i+1)}}} = {\frac{k+1}{(k+1)+1}}$$
$${{\sum_{i = 1}^{k+1}}{\frac{1}{i(i+1)}}} = {\frac{k+1}{k+2}}$$
Then to prove that, consider the following,
$${{\sum_{i = 1}^{k+1}}{\frac{1}{i(i+1)}}} = {{\sum_{i = 1}^{k}}{\frac{1}{i(i+1)}}} + {\frac{1}{(k+1)((k+1)+1)}}$$
$${{\sum_{i = 1}^{k+1}}{\frac{1}{i(i+1)}}} = {\left({\frac{k}{k+1}}\right)} + {\frac{1}{(k+1)(k+2)}}$$
$${{\sum_{i = 1}^{k+1}}{\frac{1}{i(i+1)}}} = {{\frac{k(k+2)}{(k+1)(k+2)}}} + {\frac{1}{(k+1)(k+2)}}$$
Which reduces to,
$${{\sum_{i = 1}^{k+1}}{\frac{1}{i(i+1)}}} = {\frac{(k+1)(k+1)}{(k+1)(k+2)}}$$
$${{\sum_{i = 1}^{k+1}}{\frac{1}{i(i+1)}}} = {\frac{k+1}{k+2}}$$
Proof.
Thanks,
-PFStudent
Last edited: Jan 29, 2008
8. Jan 30, 2008
### HallsofIvy
Staff Emeritus
Were you required to use induction?
Since
$$\frac{1}{n(n+1)}= \frac{1}{n}- \frac{1}{n+1}$$
that is a "telescoping" series and the sum is immediate.
9. Jan 30, 2008
### PFStudent
Hey,
Could I have proved,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\frac{n}{n+1}}$$
by showing that it is a telescoping series? If so, how?
Thanks,
-PFStudent
10. Jan 30, 2008
### HallsofIvy
Staff Emeritus
$$\sum_{i=1}^{100} \frac{1}{i(i+1}= \frac{1}{1\cdot2}} + {\frac{1}{2\cdot3}} + {\frac{1}{3\cdot4}} + . . . + {\frac{1}{99\cdot100}$$
$$= (\frac{1}{1}- \frac{1}{2})+ (\frac{1}{2}-\frac{1}{3})+ (\frac{1}{3}-\frac{1}{4})+ \cdot\cdot\cdot+ (\frac{1}{99}- \frac{1}{100})$$
The last fraction in each pair cancels the first fraction in the next pair (except of course in the last pair). Every fraction except the first and last cancel so the sum is
$$\frac{1}{1}- \frac{1}{100}= \frac{100-1}{100}= \frac{99}{100}$$
More generally,
$$\sum_{i= 1}^n \frac{1}{i(i+1)}= \frac{1}{1}- \frac{1}{n+1}= \frac{n+1-1}{n+1}= \frac{n}{n+1}$$
11. Feb 4, 2008
### PFStudent
Hey,
Thanks HallsofIvy for showing how it could have been proved by showing it was a telescoping sum.
However, how would you know that the individual sums can be rewritten as the sum or difference of two fractions. In other words, how did you figure out the following,
$$\sum_{i=1}^{100} \frac{1}{i(i+1}= \frac{1}{1\cdot2}} + {\frac{1}{2\cdot3}} + {\frac{1}{3\cdot4}} + . . . + {\frac{1}{99\cdot100} = \left(\frac{1}{1}-\frac{1}{2}\right) + \left(\frac{1}{2}-\frac{1}{3}\right)+ \left(\frac{1}{3}-\frac{1}{4}\right) + \cdot\cdot\cdot + \left(\frac{1}{99}- \frac{1}{100}\right)$$
That is, how did you figure out that,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\left({{\frac{A_{1}}{1}}-{\frac{B_{1}}{2}}}\right)} + {\left({{\frac{A_{2}}{2}}-{\frac{B_{2}}{3}}}\right)} +. . . + {\left({{\frac{A_{n}}{n}}-{\frac{B_{n}}{n+1}}}\right)}$$
Additionally, is finding the above the same as using the technique of partial fractions?
Also, what is the general way of finding $$A$$ and $$C$$ for the following (where: $$B, D, E, and{{.}}F$$; are all given),
$${\frac{E}{F}} = {{{\frac{A}{B}}\pm{\frac{C}{D}}}}$$
Where it can be shown that,
$${E} = {AD \pm BC}$$
$${F} = {BD}$$
Which is the same as,
$${\frac{E}{F}} = {\frac{AD \pm BC}{BD}}$$
Thanks,
-PFStudent
Last edited: Feb 4, 2008
12. Feb 6, 2008
### PFStudent
Hey,
I was looking over this and realized that the following,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\left({{\frac{A_{1}}{1}}-{\frac{B_{1}}{2}}}\right)} + {\left({{\frac{A_{2}}{2}}-{\frac{B_{2}}{3}}}\right)} +. . . + {\left({{\frac{A_{n}}{n}}-{\frac{B_{n}}{n+1}}}\right)}$$
Was better written as,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\left({{\frac{C_{1}}{1}}-{\frac{C_{2}}{2}}}\right)} + {\left({{\frac{C_{2}}{2}}-{\frac{C_{3}}{3}}}\right)} + {\cdot} {\cdot} {\cdot} + {\left({{\frac{C_{n-1}}{n-1}}-{\frac{C_{n}}{n}}}\right)} + {\left({{\frac{C_{n}}{n}}-{\frac{C_{n+1}}{n+1}}}\right)}$$
But, I'm still having some trouble figuring how would one decipher what the constants "C" must be.
Thanks,
-PFStudent
13. Feb 6, 2008
### rock.freak667
$$\sum_{n=1} ^{N} \frac{1}{n(n+1)} \equiv \sum_{n=1} ^{N} (\frac{1}{n}-\frac{1}{n+1})$$
Use partial fractions on 1/n(n+1)
$$\sum_{n=1} ^{N} \frac{1}{n}-\frac{1}{n+1}$$
then input n=1,2,3,...,N-2,N-1,N. then add them all up.
14. Feb 6, 2008
### PFStudent
Hey,
I see that however, how would you have figured out what the constants for the partial fractions of,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}}$$
would be?
In other words, how would you have solved the following,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\left({{\frac{C_{1}}{1}}-{\frac{C_{2}}{2}}}\right)} + {\left({{\frac{C_{2}}{2}}-{\frac{C_{3}}{3}}}\right)} + {\cdot} {\cdot} {\cdot} + {\left({{\frac{C_{n-1}}{n-1}}-{\frac{C_{n}}{n}}}\right)} + {\left({{\frac{C_{n}}{n}}-{\frac{C_{n+1}}{n+1}}}\right)}$$
for: $$C_{1}, C_{2}, C_{3},..., C_{n-1}, C_{n}$$?
That is where I am stuck.
Thanks,
-PFStudent
15. Feb 6, 2008
### rock.freak667
I don't think you need to do all of that.
16. Feb 11, 2008
### PFStudent
Hey,
Thanks for the reply, rock.freak667. Your right I did not need to prove that it is a telescoping sum.
However, I still would like to know how would one have realized that,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}}$$
is a telescoping sum?
Further after the above realization one would have had to solve for the constants: $$C_{1}, C_{2}, C_{3},..., C_{n-1}, C_{n}$$; for the following,
$${{\sum_{i = 1}^{n}}{\frac{1}{i(i+1)}}} = {\left({{\frac{C_{1}}{1}}-{\frac{C_{2}}{2}}}\right)} + {\left({{\frac{C_{2}}{2}}-{\frac{C_{3}}{3}}}\right)} + {\cdot} {\cdot} {\cdot} + {\left({{\frac{C_{n-1}}{n-1}}-{\frac{C_{n}}{n}}}\right)} + {\left({{\frac{C_{n}}{n}}-{\frac{C_{n+1}}{n+1}}}\right)}$$
And that is, what I wanted to know. How do you do that?
Thanks,
-PFStudent
Last edited: Feb 11, 2008 | 2016-10-27T03:55:53 | {
"domain": "physicsforums.com",
"url": "https://www.physicsforums.com/threads/prove-by-induction.211809/",
"openwebmath_score": 0.7880914807319641,
"openwebmath_perplexity": 1526.713819609365,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9879462226131667,
"lm_q2_score": 0.8740772236840656,
"lm_q1q2_score": 0.8635412914108765
} |
https://math.stackexchange.com/questions/2713690/showing-mathbbzi-12i-oplus-mathbbzi-6-i-cong-mathbbzi-811i/2715412 | Showing $\mathbb{Z}[i]/(1+2i) \oplus\mathbb{Z}[i]/(6-i)\cong\mathbb{Z}[i]/(8+11i)$
I am attempting to solve Ch 14 Problem 7.7 from Artin's algebra book.
Let $R=\mathbb{Z}[i]$ and let $V$ be the R-module generated by elements $v_1$ and $v_2$ with relations $(1+i)v_1+(2-i)v_2=0$ and $3v_1+5iv_2=0$. Write this module as a direct sum of cyclic modules.
Attempt
I have obtained $V\cong R^2/ \begin{bmatrix} 1+i & 3 \\ 2-i & 5i \end{bmatrix} R^2 \cong R/[8+11i]R=\mathbb{Z}[i]/(8+11i)$.
Now, I see that $(1+2i)(6-i)=8+11i.$ Now, I would like to show that $\mathbb{Z}[i]/(1+2i) \oplus\mathbb{Z}[i]/(6-i)\cong\mathbb{Z}[i]/(8+11i)$, so I can have $V$ as a direct sum of cyclic modules as needed, but how can I show this?
I have already shown that $(1+2i,6-i)=(1)=\mathbb{Z}[i]$ and thus $(1+2i)+(6-i)=\mathbb{Z}[i]$. Intuition would suggest that $(1+2i)\oplus(6-i)=\mathbb{Z}[i]$, although I think this is false since $(i-6)(1+2i)+(1+2i)(6-i)=0$.
I must confess that I am very new to module theory so please be patient with me. I don't even how it would be possible to have $\mathbb{Z}[i]/(1+2i) \oplus\mathbb{Z}[i]/(6-i)\cong\mathbb{Z}[i]/(8+11i)$ since $\mathbb{Z}[i]/(1+2i)$and $\mathbb{Z}[i]/(6-i)$ aren't even submodules of the same set.
• $1+2i$ and $6-i$ are coprime elements of the Euclidean domain $\Bbb{Z}[i]$. Their product is $8+11i$ then also their "least common multiple". So this is just another instance of the Chinese Remainder Theorem. Compare with isomorphisms of $\Bbb{Z}$-modules $$\Bbb{Z}_2\oplus\Bbb{Z}_3\simeq\Bbb{Z}_6, \quad\Bbb{Z}_3\oplus\Bbb{Z}_5\simeq\Bbb{Z}_{15}$$ et cetera. Mar 29 '18 at 18:54
• In other words the mapping $$a+bi+(8+11i)\mapsto (a+bi+(1+2i),a+bi+(6-i))$$ is an isomorphism. Mar 29 '18 at 18:55
• Thank you. If I can show that that mapping is an isomorphism, this will show $\mathbb{Z}[i]/(8+11i) \cong\mathbb{Z}[i]/(1+2i) \times \mathbb{Z}[i]/(6-i)$. However, I am not trying to show $\times$, but $\oplus$. Mar 29 '18 at 19:00
• Aren't those the same thing? At least up to isomorphism (assuming you use one for inner direct sum and the other for outer). Mar 29 '18 at 19:24
• For an answer following the method described in the problem statement: compute the Smith normal form of the relations matrix. Some relevant posts: 1, 2, 3. Mar 30 '18 at 4:36
In addition to everything said in the comments, I just wanted to remark one more thing that might be helpful concerning your last paragraph about the fact that $\mathbb{Z}[i]/(1+2i)$ and $\mathbb{Z}[i]/(6-i)$ are not submodules of some common module.
As was stated in the comments, the product of rings obtained from the chinese remainder theorem is in particular a product of modules, i.e. a direct sum, so this works perfectly fine. The point I wanted to add: If you want, you might still view both factors as submodules of $\mathbb{Z}[i]/(8+11i)$ by the following observation:
Consider a direct product of rings (commutative with $1$), $R=R_1\times R_2$. Then you might view any $R$-module $M$ as a direct sum of submodules $M_1,M_2\subset M$, where $M_i$ is a $R_i$-module (so in particular again a $R$-module) for $i=1,2$, namely set $M_1:=(1,0)\cdot M\subset M$ and $M_2:=(0,1)\cdot M\subset M$, then $$M=M_1\oplus M_2$$ as $R$-module. (By the way, the inverse procedure works as well, if $\tilde M_1$ and $\tilde M_2$ are $R_1$- resp. $R_2$-modules, then they in particular are both $R$-modules, via $(r_1,r_2)\cdot m_1:=r_1m_1$ for $m_1\in \tilde M_1$ and $(r_1,r_2)\cdot m_2:=r_2m_2$ for $m_2\in\tilde M_2$ and so one may build the $R$-module $\tilde M=\tilde M_1\oplus\tilde M_2$. This is also described in this question/answer.)
Applied to your situation: As you already proved $$R:=\mathbb{Z}[i]/(8+11i)\simeq \underset{=:R_1}{\underbrace{\mathbb{Z}[i]/(1+2i)}}\times\underset{=:R_2}{\underbrace{\mathbb{Z}[i]/(6-i)}},$$ we would now like to find elements $e_1,e_2\in R$ such that $e_1$ corresponds to $(1,0)\in R_1\times R_2$ and $e_2$ corresponds to $(0,1)$. To find those, we use the Euclidean algorithm to get $$1=\underset{=:e_2}{\underbrace{(1-3i)(1+2i)}}+\underset{=:e_1}{\underbrace{(-1)(6-i)}}.$$ So we might write $R$ as the direct sum of $R$-submodules $$R=e_1R\oplus e_2R=(7-i)R\oplus (i-6)R.$$ (Naturally, as a $R$-module this is of course isomorphic to the former version $R=R_1\oplus R_2$, as $e_i\cdot(\bullet)\colon R_i\rightarrow e_iR$ is an isomorphism of $R$-modules, $i=1,2$ - I just thought this slightly different point of view might possibly help to get more comfortable with the situation...) | 2021-12-01T23:49:40 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2713690/showing-mathbbzi-12i-oplus-mathbbzi-6-i-cong-mathbbzi-811i/2715412",
"openwebmath_score": 0.8488600850105286,
"openwebmath_perplexity": 115.64984973242012,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9840936087546923,
"lm_q2_score": 0.8774767906859264,
"lm_q1q2_score": 0.8635193015445991
} |
https://math.stackexchange.com/questions/854850/how-can-i-prove-that-2n2-mid2n3 | # How can I prove that $2^{n+2}\mid(2n+3)!$?
I'm not sure where to proceed or how to go about proving this assertion holds for all natural numbers n: $$2^{n+2} \mid(2n + 3)!$$
The base case is $n=1$, where $2^{1+2}\mid(2\cdot 1+3)!$ which simplifies to $8 \mid 120$, and 8 does indeed divide 120.
Again, we shall assume the statement is true for $n = k$. $$2^{k+2}\mid(2k+3)!$$ Then we shall prove that the statement must be true for n = k + 1: $$2^{k+3}\mid (2(k+1)+3)!=(2k+5)!$$
Sorry for the poor formatting, this is the first time I've posted here. I'm not sure if I've started off on the right path, or where to go next. Any suggestions would be lovely!
There are $n+1$ even numbers in $1,\cdots,2n+3$ and one of them is $4$ (given $n\ge1$).
• So because the divisor has 2 to the power of whatever, it will always divide whatever the quotient is due to it having a 4 in the factorial? Is this the correct way to interpret your response? – knames Jul 3 '14 at 0:09
• @knames You use the phrases "the divisor" and "whatever" and "it" and "the quotient" but I don't know what you're referring to with these phrases. Please be clear and specific. – blue Jul 3 '14 at 0:10
• the divisor being 2^(n+2) and the quotient being (2n+3)!. The left part before | will always divide the right part after | because the right part has a 4 in the factorial? – knames Jul 3 '14 at 0:12
• @knames The word "quotient" refers to what you get after you've divided, it doesn't refer to the thing you're dividing. Just because something is divisible by $4$ does not mean it is divisible by $2^{n+2}$; that's where the total of $n+1$ even numbers comes in. Try thinking some more about my hint. – blue Jul 3 '14 at 0:14
• This is as explicit as I can make it: $$(2n+3)!=1\cdot2\cdot3\cdots(2n+3)=(\underbrace{2\cdot\color{Red}4\cdots2n+2}_{n+1~\rm numbers})(1\cdot3\cdots2n+3)$$ $$=2^{n+1}(1\cdot\color{Red}2\cdot3\cdots n+1)(1\cdot3\cdots 2n+3)=2^{n+2}(3\cdots n+1)(1\cdot3\cdots 2n+3).$$ Honestly, I thought my hint was pretty clear and straightforward, and this level of explication was totally unnecessary. – blue Jul 3 '14 at 0:41
$(2k+5)!=(2k+5)(2k+4)(2k+3)!=(2k+5)(2k+4)2^{k+2}\cdot c$ where the last equality is due to $2^{k+2}\mid (2k+3)!$ which you assume.
Hence, $(2k+5)!=(2k+5)(k+2)(2)(2^{k+2})$. Finish it :)
We have $(2k+5)!=(2k+3)!(2k+4)(2k+5)$. Since by the induction hypothesis, $2^{k+2}$ divides $(2k+3)!$, and since $2$ divides $2k+4$, we conclude that $2^{k+3}$ divides $(2k+5)!$.
Remark: (This refers to an earlier version of the post.) In writing up a proof, never try to travel from what you want to show to something "known."
• I'm new to number-theory, could you elaborate on what you meant by "In writing up a proof, never try to travel from what you want to show to something "known."" – knames Jul 2 '14 at 23:56
• @knames Sometimes you start from the fact that you're trying to prove and manipulate things until you've arrived at an already established fact. This is how it goes in any kind of math, number theory or no. You might even try burning both ends of the stick and meeting somewhere in the middle. At the end, though, when you actually go to write down your proof, you need to start at something known and end up at the desired claim, in that order. – blue Jul 3 '14 at 0:00
• In high school, people pick up the very bad habit of writing down what they want to be true, and then manipulating until they get something true, like $x=x$. This is logically wrong, unless one shows that every step that got us from what we want to $x=x$ is reversible. If one showed reversibility (which one often cannot show), it would be OK. But people who go from the desired to something known often lose control over the logic of the argument, and end up writing a confused circular non-proof. I am not saying you shouldn't fool around informally with the "desired." – André Nicolas Jul 3 '14 at 0:01
• But ultimately the written up argument must go "the right way" so that its validity is clear. – André Nicolas Jul 3 '14 at 0:02
• @blue, @ André Nicolas Thank you, this makes sense to me now! – knames Jul 3 '14 at 0:03
Start with $2k+2∣(2k+3)!$. This means there exists a $b \in\mathbb{N}$ such that $(2k+3)! = b2^{k+2}$.
\begin{align*} (2k+3)! = b2^{k+2} & \Rightarrow (2k+3)!(2k+4)(2k+5) = b2^{k+2}(2k+4)(2k+5)& \\ & \Leftrightarrow (2k+5)! = b2^{k+2}2(k+2)(2k+5) \\ & \Leftrightarrow (2k+5)! = (b(k+2)(2k+5))2^{k+3} \\ & \Rightarrow 2^{k+3} | (2k+5)! \\ & \Leftrightarrow 2^{(k+1)+2} | (2(k+1)+3)! \end{align*}
• Just a quick question, what is the significance of including the last line? Why break down the exponent and everything to the right of the "|"? – knames Jul 3 '14 at 1:25
• It makes the induction pedantically clear. This expression is a straight substitution of $(k+1)$ for $k$ in the equation we're trying to prove. – NovaDenizen Jul 3 '14 at 1:42
## Theory
The number of factors of the prime number, p, that divide into n! is $\sum_{i=1}^{\infty} \left \lfloor \dfrac{n}{p^i} \right \rfloor$
As formidable as this equation may look, it's not really that bad.
First of all, once $\left \lfloor \dfrac{n}{p^i} \right \rfloor$ becomes $0$, all of the terms after that are also $0$. So it's really a finite sum.
Second, it can be shown that $$\left \lfloor \dfrac{n}{p^{i+1}} \right \rfloor = \left \lfloor \dfrac{\left \lfloor \dfrac{n}{p^i} \right \rfloor}{p} \right \rfloor$$
So, knowing the value of $\left \lfloor \dfrac{n}{p^i} \right \rfloor$ makes it easier to compute $\left \lfloor \dfrac{n}{p^{i+1}} \right \rfloor$.
## Application
We make the following computations.
• $\left \lfloor \dfrac{2n+3}{2} \right \rfloor = n+1$
• $\left \lfloor \dfrac{n+1}{2} \right \rfloor \ge 1 \quad (\forall n \ge 1)$
It follows that the highest power of 2 that divides into $(2n+3)!$ is greater than or equal to $(n+1) + 1 = n+2$. In other words, $2^{n+2} | (2n+3)!$ | 2020-05-27T03:37:09 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/854850/how-can-i-prove-that-2n2-mid2n3",
"openwebmath_score": 0.9536570906639099,
"openwebmath_perplexity": 422.8549702755819,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9840936073551713,
"lm_q2_score": 0.8774767906859264,
"lm_q1q2_score": 0.8635193003165519
} |
https://www.physicsforums.com/threads/uniform-circular-motion-how-can-radial-acceleration-have-a-calculated-value.919831/ | # I Uniform circular motion -- How can radial acceleration have a calculated value?
1. Jul 10, 2017
### Gurasees
In uniform circular motion, direction of particle is changing at every moment but its speed remains the same. If the magnitude of velocity or speed remains the same, change in magnitude of velocity is zero. Then how come radial acceleration can have a calculated value since acceleration = change in magnitude of velocity/ change in time. Yes, the object has an acceleration due to change in direction but how can we possibly obtain a value?
2. Jul 10, 2017
### scottdave
This video may shed some insight for you. I was helpful for me, explaining derivatives of vectors.
3. Jul 10, 2017
### A.T.
Where did you get that defintion of acceleration from?
4. Jul 10, 2017
### Staff: Mentor
Acceleration is defined as the change in the velocity divided by the change in time, of: $\vec a = \frac{dV}{dt}$
Since velocity is changing, this requires that there be an acceleration. Note that acceleration is not defined as the change in the magnitude of the velocity, but simply the change in the velocity.
You can find a simple calculus derivation here: https://en.wikipedia.org/wiki/Centripetal_force#Calculus_derivation
5. Jul 10, 2017
### scottdave
Yes. Note that acceleration is a vector quantity and is often in a different direction than velocity. In the case of uniform circular motion, it is always at 90° to the velocity direction (towards center of the circle). I think the video does a nice job of explaining this.
6. Jul 11, 2017
### Gurasees
Actually yeah definition that i wrote for acceleration is wrong. Here acceleration is associated with change in direction. But what i am asking is how can we obtain a numerical value of acceleration if there is no change in numerical value of velocity?
7. Jul 11, 2017
### A.T.
Velocity is a vector which does change.
8. Jul 11, 2017
A vector is a "numerical" value. Just not a scalar. Speed is a Scalar, Velocity is a vector. Since the Force (vector) and the Velocity of the particle are always at 90 degrees - no work is done, but there is action/reaction.
F=ma where F and a are vectors is critical to proper analysis,
MANY- heck if not all, cases involving normal vectors are counter-intuitive, and are worth special attention. If you master the vector math behind the precession of a gyroscope, for example - you will know more physics than 99.9% of the population.
It may seem like a simple concept - but complete comprehension is very valuable.
9. Jul 11, 2017
### Staff: Mentor
The numerical value of the velocity's vector components is continuously changing. This is true in both Cartesian and polar/spherical coordinates.
10. Jul 11, 2017
### vanhees71
Instead of unclear words formulae can only help the understanding ;-)).
Take the example of a particle running around on a circle of radius $R$ around the origin in the $xy$ plane with constant angular velocity $\omega$. The position vector is given by
$$\vec{x}(t)=R \begin{pmatrix} \cos(\omega t) \\ \sin(\omega t) \\ 0 \end{pmatrix}.$$
The velocity is
$$\vec{v}=\dot{\vec{x}} = R \omega \begin{pmatrix} -\sin(\omega t) \\ \cos (\omega t) \\ 0 \end{pmatrix}$$
and the acceleration
$$\vec{a}=\dot{\vec{v}}=R \omega^2 \begin{pmatrix} -\cos(\omega t) \\ -\sin(\omega t) \\ 0 \end{pmatrix}=-\omega^2 \vec{x},$$
i.e., the acceleration is radially towards the center with the magnitude $a=|\vec{a}|=\omega^2 R$. To keep the particle on the circle you need the corresponding force, called the centripetal force, $\vec{F}=m \vec{a}=-m \omega^2 \vec{x}$.
Last edited: Jul 15, 2017
11. Jul 15, 2017
### Staff: Mentor
To clarify: both velocity and acceleration are vectors, so this should be written as $$\vec a = \frac {d \vec v}{dt}$$ or, component by component: $$a_x = \frac{dv_x}{dt} \\ a_y = \frac{dv_y}{dt} \\ a_z = \frac{dv_z}{dt}$$ or, in the matrix notation that vanhees71 used: $$\vec a = \begin{pmatrix} a_x \\ a_y \\ a_z \end{pmatrix} = \frac {d}{dt} \begin{pmatrix} v_x \\ v_y \\ v_z \end{pmatrix}$$
12. Jul 29, 2017
### Arjan82
Without formula's: acceleration in one direction is independent of the acceleration in any other direction (as long as the directions are normal to each other). Thus if you look at your object, it's velocity in horizontal direction does change all the time, and therefore it has an acceleration in horizontal direction. This is also independently true for the vertical direction.
13. Aug 1, 2017
### CWatters
Why should it be a problem to calculate a numerical value of acceleration in such a case?
Lets say you have a ball going North at 3m/s and later it's found to be going South at 3m/s. The numerical value of the velocity (aka speed) hasn't changed, only the direction has changed. To calculate the acceleration you first need to calculate the change in velocity which in this case is 6m/s South. | 2017-11-18T14:19:15 | {
"domain": "physicsforums.com",
"url": "https://www.physicsforums.com/threads/uniform-circular-motion-how-can-radial-acceleration-have-a-calculated-value.919831/",
"openwebmath_score": 0.7194363474845886,
"openwebmath_perplexity": 513.9955391437354,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. Yes\n2. Yes",
"lm_q1_score": 0.9840936054891428,
"lm_q2_score": 0.8774767906859264,
"lm_q1q2_score": 0.8635192986791552
} |
https://math.stackexchange.com/questions/2615300/does-the-series-sum-2n-sin-frac-pi3n-converge/2615302 | # Does the series $\sum 2^n \sin(\frac{\pi}{3^n})$ converge?
Check if $$\sum_{n = 1}^{\infty}2^n \sin\left(\frac{\pi}{3^n}\right)$$ converges.
I tried to solve this by using the ratio test - I have ended up with the following limit to evaluate: $$\lim_{n \to \infty} \left(\frac{2\sin\left(\frac{\pi}{3 \cdot 3^n} \right)}{\sin \left(\frac{\pi}{3^n} \right)} \right)$$ And now - I am stuck and don't know how to proceed with this limit. Any hints?
• Use the fact that $\sin(x) \leq x$ – TheOscillator Jan 21 '18 at 22:00
• L'Hospital's rule will help you with the limit you pose, but you can show convergence directly as Olivier outlines. – Malcolm Jan 21 '18 at 22:01
• @Malcolm This is a sequence, not a function. A sequence is not differentiable. – Aemilius Jan 21 '18 at 22:01
• If $\lim_{x \to \infty} \left(\frac{2\sin\left(\frac{\pi}{3 \cdot 3^x} \right)}{\sin \left(\frac{\pi}{3^x} \right)} \right)$ exists (which it does) then $\lim_{n \to \infty} \left(\frac{2\sin\left(\frac{\pi}{3 \cdot 3^n} \right)}{\sin \left(\frac{\pi}{3^n} \right)} \right)$ also exists and equals the same value. – Malcolm Jan 21 '18 at 22:05
Hint. One has $$\left|\sin\left(\frac{\pi}{3^n}\right)\right|\le\frac{\pi}{3^n},\quad n=1,2,\cdots.$$ Can you take it from here?
• Your observation implies that this limit in question - say, L: $$0 \le L \le 2/3$$ and so this series does converge? – Aemilius Jan 21 '18 at 22:04
• You then have $$\left|\sum_{n = 1}^{\infty}2^n \sin \frac{\pi}{3^n} \right| \le \sum_{n = 1}^{\infty}\left|2^n \sin \frac{\pi}{3^n} \right| \le \pi \sum_{n = 1}^{\infty}\frac{2^n}{3^n}<\infty$$ and the given series is absolutely convergent then it is convergent. – Olivier Oloa Jan 21 '18 at 22:07
Note that
$$2^n \sin\left(\frac{\pi}{3^n}\right) \sim \pi\frac{2^n}{3^n}$$
then use comparison test with $$\sum \frac{2^n}{3^n}$$
If you want to stick with your approach using the ratio test, you can (although Olivier's answer is more direct). Caveat: I'll detail every step of the derivation, which is not actually necessary for a proof.
We will only rely on elementary arguments, specifically the fact that $\sin'(0)=\cos 0 = 1$ — which is equivalent to $$\lim_{x\to 0} \frac{\sin x}{x} = 1 \,.\tag{1}$$ From there, you can write $$\lim_{n \to \infty} \frac{2\sin\left(\frac{\pi}{3 \cdot 3^n} \right)}{\sin \left(\frac{\pi}{3^n} \right)} = \lim_{n \to \infty} 2\cdot \frac{1}{3}\cdot \frac{\sin\left(\frac{\pi}{3 \cdot 3^n} \right)}{\frac{\pi}{3 \cdot 3^n}}\cdot\frac{\frac{\pi}{3^n}}{\sin \left(\frac{\pi}{3^n} \right)} = \frac{2}{3}\lim_{n \to \infty} \frac{\sin\left(\frac{\pi}{3 \cdot 3^n} \right)}{\frac{\pi}{3 \cdot 3^n}}\cdot\left(\frac{\sin \left(\frac{\pi}{3^n} \right)}{\frac{\pi}{3^n}}\right)^{-1} \tag{2}$$ and, by (1), we get \begin{align*} \lim_{n \to \infty} \frac{2\sin\left(\frac{\pi}{3 \cdot 3^n} \right)}{\sin \left(\frac{\pi}{3^n} \right)} &= \frac{2}{3}\lim_{n \to \infty} \frac{\sin\left(\frac{\pi}{3 \cdot 3^n} \right)}{\frac{\pi}{3 \cdot 3^n}}\cdot \lim_{n \to \infty} \left(\frac{\sin \left(\frac{\pi}{3^n} \right)}{\frac{\pi}{3^n}}\right)^{-1} =\frac{2}{3}\lim_{n \to \infty} \frac{\sin\left(\frac{\pi}{3 \cdot 3^n} \right)}{\frac{\pi}{3 \cdot 3^n}}\cdot \left(\lim_{n \to \infty} \frac{\sin \left(\frac{\pi}{3^n} \right)}{\frac{\pi}{3^n}}\right)^{-1} \\ &= \frac{2}{3}\cdot 1\cdot 1^{-1} = \boxed{\frac{2}{3}} \end{align*} and you can conclude with the ratio test.
Same idea as Olivier express in a different way, you know that $$\sin\left(x\right)\underset{(0)}{=}x+o\left(x\right)$$ Hence
$$2^n\sin\left(\frac{\pi}{3^n}\right) \underset{(+\infty)}{\sim}\pi \left(\frac{2}{3}\right)^n$$
What can you say about $\displaystyle \sum_{n \geq 0}\left(\frac{2}{3}\right)^n$ ? | 2019-09-18T11:20:33 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2615300/does-the-series-sum-2n-sin-frac-pi3n-converge/2615302",
"openwebmath_score": 0.9997424483299255,
"openwebmath_perplexity": 442.8707185059686,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9840936064221572,
"lm_q2_score": 0.8774767826757122,
"lm_q1q2_score": 0.863519291615053
} |
https://math.stackexchange.com/questions/2831645/why-doesnt-the-quadratic-equation-contain-2a-in-the-denominator | Why doesn't the quadratic equation contain $2|a|$ in the denominator?
When deriving the quadratic equation as shown in the Wikipedia article about the quadratic equation (current revision) the main proof contains the step: $$\left(x+{\frac {b}{2a}}\right)^{2}={\frac {b^{2}-4ac}{4a^{2}}}$$ the square root is taken from both sides, so why is $$\sqrt{4a^2} = 2a$$ in the denominator and not $$\sqrt{4a^2} = 2\left |a \right |$$ Could somebody explain this to me? Thank you very much
migrated from mathoverflow.netJun 25 '18 at 17:26
This question came from our site for professional mathematicians.
One could take the square root as $2|a|$ instead, which would lead to:
$$x+\frac {b}{2a} = \pm{\frac {\sqrt{b^{2}-4ac}}{2|a|}} \quad\iff\quad x = -\frac {b}{2a} \pm {\frac {\sqrt{b^{2}-4ac}}{2|a|}} \tag{1}$$
However, given that $\,|a|\,$ is either $\,a\,$ or $\,-a\,$ it follows that $\,\pm|a|=\pm a\,$, so the formula simplifies to:
$$x = -\frac {b}{2a} \pm {\frac {\sqrt{b^{2}-4ac}}{2|a|}} = -\frac {b}{2a} \pm {\frac {\sqrt{b^{2}-4ac}}{\color{red}{2a}}} = \frac{-b \pm \sqrt{b^{2}-4ac}}{2a} \tag{2}$$
$(1)\,$ and $\,(2)\,$ are entirely equivalent, but $\,(2)\,$ is more convenient to use.
When taking the square root we put a $\pm$ on the right hand side to account for the two roots, so it is unnecessary to strip off the sign of $a$, as we will put it back anyways.
The two square roots of $a^2$ are $a$ and $-a$, sometimes written together as $\pm a$.
For real numbers $\pm a$ is equivalent to $\pm |a|$ but this is not true for complex numbers. So putting the absolute value operation in would make the proof less general.
We could write the proof as
$$\left(x+{\frac {b}{2a}}\right)^{2}={\frac {b^{2}-4ac}{4a^{2}}}$$
$$\pm\left(x+{\frac {b}{2a}}\right)={\frac {\pm\sqrt{b^{2}-4ac}}{\pm2a}}$$
$$x+{\frac {b}{2a}}={\frac {\pm\sqrt{b^{2}-4ac}}{2a}}$$
But generally it is considered sufficient to put in just a single $\pm$ from the start rather than putting in one for each square root and then removing the redundant ones.
If you put $x =\dfrac{-b\pm\sqrt{b^2-4ac}}{2a}$ into $ax^2+bx+c$, since $x^2 =\dfrac{b^2\mp2b\sqrt{b^2-4ac}+(b^2-4ac)}{4a^2} =\dfrac{2b^2-4ac\mp2b\sqrt{b^2-4ac}}{4a^2}$ you get
$\begin{array}\\ ax^2+bx+c &a\dfrac{2b^2-4ac\mp2b\sqrt{b^2-4ac}}{4a^2} +b\dfrac{-b\pm\sqrt{b^2-4ac}}{2a}+c\\ &=\dfrac{2b^2-4ac\mp2b\sqrt{b^2-4ac}}{4a} +\dfrac{-2b^2\pm 2b\sqrt{b^2-4ac}}{4a}+c\\ &=\dfrac{2b^2-4ac\mp2b\sqrt{b^2-4ac}-2b^2\pm 2b\sqrt{b^2-4ac}+4ac}{4a}\\ &=0\\ \end{array}$
If you use $|a|$, it won't work since you can't combine the terms.
• The OP is only putting the absolute value when taking the square root, not putting it on $-b/2a$. This is correct, but unnecessary, see dxiv's answer. – Fan Zheng Jun 25 '18 at 18:29
my preference for remembering and using the quadratic formula (and electrical engineers seem to do that often) is to remember the root quadratic equations as:
$$x^2 \ + \ b\,x \ + \ c \ = \ 0$$
which has solution:
$$x \ = \ \begin{cases} -\tfrac{b}{2} \pm \sqrt{\left(\tfrac{b}{2}\right)^2 - c} \qquad & \text{for }\left(\tfrac{b}{2} \right)^2 > c \\ \\ -\tfrac{b}{2} \qquad & \text{for }\left(\tfrac{b}{2} \right)^2 = c \\ \\ -\tfrac{b}{2} \pm i \sqrt{c - \left(\tfrac{b}{2}\right)^2} \qquad & \text{for }\left(\tfrac{b}{2} \right)^2 < c \\ \end{cases}$$
normalizing out the "$a$" does not make the quadratic equation less general. the only degrees of freedom are $b$ and $c$, so that means normally (except for a double root), there are two independent solutions.
Alternatively, noting $a\ne 0$: \begin{align}\left(x+{\frac {b}{2a}}\right)^{2}&={\frac {b^{2}-4ac}{4a^{2}}} \iff \\ 4a^2\left(x+{\frac {b}{2a}}\right)^{2}&=b^{2}-4ac \iff \\ \left(2ax+b\right)^{2}&=b^{2}-4ac \iff \\ 2ax+b&=\pm \sqrt{b^2-4ac} \iff \\ x&=\frac{-b\pm \sqrt{b^2-4ac}}{2a}.\end{align} | 2019-08-20T01:49:56 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2831645/why-doesnt-the-quadratic-equation-contain-2a-in-the-denominator",
"openwebmath_score": 0.9918550848960876,
"openwebmath_perplexity": 299.0361732696532,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9715639677785087,
"lm_q2_score": 0.8887588001219789,
"lm_q1q2_score": 0.8634860262445764
} |
http://math.stackexchange.com/questions/130159/what-is-the-distribution-of-this-random-series | What is the distribution of this random series?
Let $\xi_n$ be iid and uniformly distributed on the three numbers $\{-1,0,1\}$. Set $$X = \sum_{n=1}^\infty \frac{\xi_n}{2^n}.$$ It is clear that the sum converges (surely) and the limit has $-1 \le X \le 1$..
What is the distribution of $X$?
Does it have a name? Can we find an explicit formula? What else can we say about it (for instance, is it absolutely continuous)?
We can immediately see that $X$ is symmetric (i.e. $X \overset{d}{=} -X$). Also, if $\xi$ is uniformly distributed on $\{-1,0,1\}$ and independent of $X$, we have $X \overset{d}{=} \frac{1}{2}(X+\xi)$. It follows that for the cdf $F(x) = \mathbb{P}(X \le x)$, we have $$F(x) = \frac{1}{3}(F(2x+1) + F(2x) + F(2x-1)). \quad (*)$$
The cdf of $\sum_{n=1}^{12} \frac{\xi_n}{2^n}$ looks like this:
It looks something like $\frac{1}{2}(1+\sin(\frac{\pi}{2}x))$ but that doesn't quite work (it doesn't satisfy (*)).
-
I think the equation (*) together with the boundary conditions $F(x\leq -1)=0$ and $F(x\geq 1)=1$ determines the cdf $F$ uniquely. – Fabian Apr 10 '12 at 20:20
Remotely related is the Fabius random variable (see wiki). – Sasha Apr 10 '12 at 20:25
It can be shown easily that $F(0)=1/2$, $F(1/2)=5/6$, $F(-x)=1-F(x)$. – Fabian Apr 10 '12 at 20:32
$F(1/4)=2/3$, $F(1/3)=8/11$, $F(2/3)=10/11$, $F(3/4)=17/18$, ... The values of $F$ for rational arguments can be obtained recursively (but I did not yet figure out an explicit formula). – Fabian Apr 10 '12 at 20:48
For $x=-1+2^{-k}$ you can get that $F(x)=\frac{1}{2(3^k)}$. The first $k$ have to be negative, and then half of those end up on the left. Thus, for small $\epsilon$, $F(-1+\epsilon)$ is roughly $\frac{1}{2}\epsilon^{\log_2 3}$. – Thomas Andrews Apr 10 '12 at 20:59
This is more of a comment, than an answer, yet it's too big, and graphics can't be used in comments.
It is not hard to work out cumulants of $X$: $$\kappa_X(r) = \sum_{n=1}^\infty \frac{\kappa_\xi(r)}{2^{n r}} = \frac{\kappa_\xi(r)}{2^r-1} = \frac{3^r-1}{2^r-1} \cdot \frac{B_r}{r} \cdot [ r \geqslant 2]$$ Obviously, due to symmetry, odd cumulants and moments vanish. This implies the following low order moments: $$m_2 = \mathbb{E}(X^2) = \frac{2}{9}, \quad m_4 = \frac{14}{135}, \quad m_6 = \frac{106}{1701}, \quad \ldots$$
The distribution itself appears to not be absolutely continuous, based on simulations:
Following Fabian's footsteps, it is easy to code computation of CDF at rational points:
ClearAll[cdf];
cdf[x_?ExactNumberQ] /; x >= 1 := 1;
cdf[0] = 1/2;
cdf[x_?Negative] := 1 - cdf[-x];
cdf[x_Rational /; EvenQ[Denominator[x]]] /; -1 < x < 1 :=
cdf[x] = (cdf[2 x] + cdf[2 x - 1] + cdf[2 x + 1])/3;
cdf[x_Rational] := (* set up linear equations and solve them *)
Block[{f, den = Denominator[x], ru1, ru2, vals, sol, ru3},
ru1 = {f[z_] :> Divide[f[2 z] + f[2 z + 1] + f[2 z - 1], 3]};
ru2 = {f[z_ /; z <= -1] :> 0, f[z_ /; z >= 1] :> 1,
f[z_?Negative] :> 1 - f[-z]};
ru3 = f[r_Rational /; Denominator[r] < den] :> cdf[r];
vals = Table[f[k/den], {k, den - 1}] /. ru3;
sol = Solve[(((vals /. ru1) //. ru2) /. ru3) == vals,
Cases[vals, _f]];
Function[{arg, res}, Set[cdf[arg], res]] @@@
Cases[vals, f[a_] :> {a, f[a] /. First[sol]}];
cdf[x]
]
So, for example,
In[101]:= cdf[1/5]
Out[101]= 31/49
The agreement with simulations is excellent:
- | 2015-08-04T02:00:14 | {
"domain": "stackexchange.com",
"url": "http://math.stackexchange.com/questions/130159/what-is-the-distribution-of-this-random-series",
"openwebmath_score": 0.5641429424285889,
"openwebmath_perplexity": 1359.0535747279775,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9715639686018701,
"lm_q2_score": 0.8887587964389112,
"lm_q1q2_score": 0.8634860233980102
} |
https://stats.stackexchange.com/questions/436975/compact-notation-for-one-hot-indicator-vectors | # Compact notation for one-hot indicator vectors?
Many machine learning approaches use one-hot vectors to represent categorical data. This is sometimes called using indicator features, indicator vectors, regular categorical encoding, dummy coding, or one-hot encoding (among other names).
I'm searching for a compact way to denote a one-hot vector within a model.
Say we have a categorical variable with $$m$$ categories. First, apply some arbitrary sorting to the categories. A one-hot vector $$v$$ is then a binary vector of length $$m$$ where only a single entry can be one, all others must be zero. We set the $$i^\text{th}$$ entry to 1, and all others to 0, to indicate that this $$v$$ represents the categorical variable taking on the $$i^\text{th}$$ possible value.
One clunky attempt based on misguided set notation;
$$v \in \{0, 1\}^m \qquad\qquad \sum_{i=1}^m v_i = 1$$
I've also seen math-oriented people refer to a one-hot vector using the notation
$$\mathbf{e}_i$$
But I don't understand where this notation comes from or what it is called.
Can anyone help me out? Is there a paper that does a good job of this?
Thank you,
There are several ways to note dummy variables (or one-hot encoded), one of them is the indicator function :
$$\mathbb{1}_A(x) := \begin{cases} 1 &\text{if } x \in A, \\ 0 &\text{if } x \notin A. \end{cases}$$
For $$e_i$$ it is a vector of the standard base, where $$e_i$$ denotes the vector with a $$1$$ in the $$i$$ ith coordinate and $$0$$'s elsewhere. For example, in $$\mathbb{R}^5$$, $$e_3 = (0, 0, 1, 0, 0)$$
• This is a good answer! Thanks @Fisher. Mar 19 '20 at 0:17
Found some relevant threads to your question. Hope this helps.
"Dummy variable" versus "indicator variable" for nominal/categorical data
What is "one-hot" encoding called in scientific literature? | 2021-09-19T04:21:30 | {
"domain": "stackexchange.com",
"url": "https://stats.stackexchange.com/questions/436975/compact-notation-for-one-hot-indicator-vectors",
"openwebmath_score": 0.9154834151268005,
"openwebmath_perplexity": 739.7600354197723,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9715639669551474,
"lm_q2_score": 0.8887587905460026,
"lm_q1q2_score": 0.8634860162091332
} |
https://math.stackexchange.com/questions/2625347/difference-between-minus-one-and-plus-one-induction | Difference between minus one and plus one induction?
I recently started a Combinatorics class, in which my teacher (grad student) has instructed us to Prove by induction that $$1^2+2^2+\ldots+n^2 = \frac{n(n+1)(2n+1)}{6} = \frac{2n^3+3n^2+n}{6}$$ this is trivial in the fact that it has been solved many times before, however my professor has insisted I solve it by using $P(n-1)$ as opposed to $P(n+1)$, which I've done below.
Basis
$$\frac{1(1+1)(2*1+1)}{6} = 1$$
Inductive Step $(n-1)$
$$1^2+2^2+\ldots + (n-1)^2 = \frac{(n-1)(n)(2(n-1)+1)}{6}$$ Which Simplifies to $$\frac{(n-1)(n)(2n-1)}{6} \rightarrow \frac{2n^3-3n^2+n}{6}$$ Add $6\frac{n^2}{6}$ to both sides and we've proven by induction.
My question is do there exists any mathematical proofs for which solving by Induction with $n+1$ and $n-1$ are not interchangeable and should I petition my professor to be able to use them interchangeably. I am aware that solving using $n-1$ and $n+1$ is identical, at least for every scenario I've come across (we're working with positive integers so I'm not expecting any variance from that), however given the overwhelming amount of resources, I can't for the life of me figure out why I am being instructed to use a method opposite what seems to be the norm for any other reason besides my teacher's personal preference.
• Are you asking about the difference between $P(n-1)\Rightarrow P(n)$ and $P(n)\Rightarrow P(n+1)$ in the inductive step? Those are identical. I am not quite sure what you mean by induction with $n+1$ vs $n-1$. Jan 28 '18 at 18:20
• I know that they are the same as far as my example goes, I was just wondering if there was any reason why my teacher has instructed us using $n-1$ for anything other than his own personal preference, given that I couldn't find any resources online for "Solving induction step with n minus one" or similar. Such that is what I'm being taught actually a mirror of a theorem? I'll update my question for clarity.
– jfh
Jan 28 '18 at 18:24
• Perhaps you can put side-by-side your approach and your instructor's approach. Sometimes one direction is preferred over another due to simplicity or clarity. Jan 28 '18 at 18:28
• Well, to be fussy neither are either "with n+1" or "with n-1". One is "with n implying n+1" and the other is "with n-1 implying n". Which if you replace $m$ with $n-1$ become "with n implying n+1" and the other "with m implying m+1" which are obviously the same. Jan 28 '18 at 19:44
• You can do induction with n implying n-1 to prove for example if P(237) is true and P(n) implies P(n-1) for natural number then P(n) is true for all natural numbers less than or equal to 237. That's kind of ... useless. ... Unless you are proving something integers. For example we can prove $b^{n+m} = b^nb^m$ for all integers by induction by "inducing down" if we need to. Jan 28 '18 at 19:47
As Michael Burr noted in the comments, the two conventions are identical; it's just a change of name for the variable. You could equally assume $P(k+12)$ holds and prove $P(k+13)$ from that.
The advantage of using $P(n-1) \implies P(n)$ is that your target formula is already expressed in terms of $n$, so you don't have to rewrite the target in terms of $n+1$ to figure out what you're looking for; the advantage of using $P(n) \implies P(n+1)$ is that the inductive hypothesis is already expressed in terms of $n$.
One other advantage of using $P(n-1) \implies P(n)$ is that it transfers better to "strong induction," where you can assume $P(k)$ for all $k < n$ to prove $P(n)$. Here there is definitely less rewriting going on if you use $P(n)$ as opposed to $P(n+1)$ as your target.
I've seen both used widely. I personally usually prefer $P(n-1) \implies P(n)$.
• Thank you, I know my question sounds like its teetering on the border between naivety and caution, but I think your answer does well to say that noticing the distinction between the terms of the right hand side can help identify which method to use.
– jfh
Jan 28 '18 at 18:38
I would argue that, if anything, there are reasons to prefer $P(n) \Rightarrow P(n+1)$.
Natural numbers can be defined in many ways, but the usual inductive definition is the following:
1. $0$ is a natural number;
2. If $n$ is a natural number, then $s(n)$ is a natural number.
Here $s(n)$ denotes the successor of $n$.
These two rules define a set $\mathbb N$ together with an induction principle (which allows us to prove properties of all elements of $\mathbb N$ and is in fact the usual mathematical induction) and a recursion principle (which allows us to construct new objects from the elements of $\mathbb N$).
Then $\mathbb N$ can be endowed with the usual operations satisfying all the well-known properties. In particular, it is customary to write the successor $s(n)$ of $n$ as the sum $n+1$, although it is the sum between two natural numbers that is actually defined by recursion using the successor.
There are of course many inductive structures other than the set of natural numbers. For example, binary trees are defined by:
1. $v$ is a binary tree (a single vertex, which is also the root);
2. If $t_1$ and $t_2$ are binary trees, then $t_1 \bullet t_2$ is a binary tree (the graph formed by taking $t_1$ and $t_2$, adding a new vertex as a root and joining the roots of $t_1$ and $t_2$ to the new root).
How does the induction principle look like for binary trees? If you want to prove that $P(t)$ holds for any binary tree $t$, you have to prove:
1. (Basis) $P(v)$ holds;
2. (Inductive step) If $P(t_1)$ and $P(t_2)$ hold, then $P(t_1 \bullet t_2)$ holds.
In this case there is no equivalent to the predecessor of a natural number.
I think the only reason s/he did it this way is s/he wanted to have the final simplification end in the form $\frac {2n^3 + 3n^2 + n}6$
Had he done $P(n) \implies P(n+1)$ it would have involve a lot of factoring to get in the form $\frac {2(n+1)^3 + 3(n+1)^2 + (n+1)}6$.
Try it:
$1 + 2 + .... + n^2 = \frac {2n^3 + 3n^2 + n}6$
So $1 + 2 + ...... + n^2 + (n+1)^2 = \frac {2n^3 + 3n^2 + n}6 + n^2 + 2n + 1$
$= \frac {2n^3 + 9n^2 + 13n + 6}6$
... and we have to somehow get that to .... $=\frac {2(n+1)^3 + 3(n+1)^2 + (n+1)}6$
... which isn't impossible ...
$\frac {2n^3 + 9n^2 + 13n + 6}6= \frac {2n^3 + 6n^2 + 6n + 2 + 3n^2 + 7n + 4}6$
$=\frac {2(n+1)^3 + 3n^2 + 6n + 3 + n + 1}6$
$= \frac {2(n+1)^3 + 3(n+1)^2 + (n+1)}6$
... but.... why schlep? That factoring and working backwords isn't the point.
It's easier to follow it and to go to the conclusion if you you work toward simplifying.
=====
I suppose an easier compromise would be to do:
$\frac {2(n+1)^2 + 3(n+1)^2 + (n+ 1)}{6} = \frac {2n^3 + 6n^2 + 6n + 2 + 3n^2 + 6n + 3 + n+1}6 = \frac {2n^3 + 9n^3 + 13n + 6}6$
first.
Then:
$1+2 + ..... + n^2 + (n+1)^2 =$
$\frac {2n^3 + 3n^2 + n}6 + (n+1)^2 = \frac {2n^3 + 3n^2 + n}6 +n^2 + 2n + 1=$
$\frac {2n^3 + 3n^2 + n + 6n^2 + 12n + 6}6 = \frac {2n^3 + 9n^3 + 13n + 6}6$
$= \frac {2(n+1)^2 + 3(n+1)^2 + (n+ 1)}{6}$
• Whoa! I just read your professors arithmetic. Whoa. That is is clean and pretty with the $(n^3 - bn^2 + n)+2bn^2 = (n^3 + bn^2 +n)$. This use of conjugates just.... I don't know.. it's elegant. And gives a potential geometric insight as to why this works. It doesn't put one method of induction over another but for this particular proof.... it sure is pretty. Jan 28 '18 at 20:08 | 2022-01-26T21:45:30 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/2625347/difference-between-minus-one-and-plus-one-induction",
"openwebmath_score": 0.768440842628479,
"openwebmath_perplexity": 270.02048646593346,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.96036116089903,
"lm_q2_score": 0.8991213813246445,
"lm_q1q2_score": 0.863481253558075
} |
https://math.stackexchange.com/questions/3113091/a-poker-hand-contains-five-cards-find-the-probability-that-a-poker-hand-can-be | # A poker hand contains five cards. Find the probability that a poker hand can be....
a) Four of a kind (Contains four cards of equal face value)
So for this one, we want four cards that have the same face value, different suit. And the last card can be any remaining card.
There are 13 ranks, (A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K). We have $$\binom{13}{1}$$ ways to pick 1 rank out of 13. For each of these ranks, we want to pick 4 cards that are all the same rank (and it is forcefully implied that these 4 cards will differ in suits). So $$\binom{13}{1}\binom{4}{4}$$, and for each of these ways, we have $$\binom{48}{1}$$ way to pick 1 card out of the remaining deck of 48 cards, because we picked 4 cards already. Thus, $$\frac{\binom{13}{1}\binom{4}{4}\binom{48}{1}}{\binom{52}{5}}$$ is the total number of ways.
b) Full House (Three cards of equal face value, and two others of equal face value). So i.e: 3, 3, 3, 2, 2 would be a full house where the three 3's and two 2's are distinguishable (different suit).
So there are 13 ranks again, $$\binom{13}{1}$$ ways to pick 1 rank out of 13 total. For each of these ways, we want to pick three cards of the same rank. So $$\binom{13}{1}\binom{4}{3}$$. Now we want two more cards that are of equal face value that differ from the other three cards picked earlier, so there are 12 ranks left, and $$\binom{12}{1}$$ ways to pick 1 rank out of 12 remaining. For each of these ways, we have $$\binom{4}{2}$$ ways to pick 2 cards out of the 4 suits belonging to the same rank, thus $$\binom{12}{1}\binom{4}{2}$$. The total number of ways is: $$\frac{\binom{13}{1}\binom{4}{3}\binom{12}{1}\binom{4}{2}}{\binom{52}{5}}$$
c) Three of a kind. (Three cards of equal face value, and two cards with face values that differ from each other and the other three).
13 ranks, we want to pick 3 cards of the same rank. $$\binom{13}{1}\binom{4}{3}$$. Now we want two cards that have different face values from the three picked, and each other. Now here is where I'm a bit confused, the ranks MUST be different, but the suits can be the same. So proceeding, $$\binom{12}{1} \binom{4}{1}$$ to pick 1 card of a different face value, but could be same suit, and then $$\binom{11}{1}\binom{4}{1}$$ to pick another card with a different face value, but could be a different suit. Multiply these altogether and divide by the denominator, and we have our total ways.
Is my work correct?
• Very nearly. Your numerator is the number of total ways to achieve these combinations. Dividing by $52 \choose 5$ gives you the probability of achieving those hands. Feb 14 '19 at 19:36
• That's what I said.....
– Stuy
Feb 14 '19 at 19:39
• Then you'll want to clarify the last line of sections (a) and (b), which both refer to the quotient as "[t]he total number of ways" rather than the probability. Feb 14 '19 at 20:00
You correctly calculated the probabilities of four of a kind and a full house, not the total number of ways. The number of ways these hands can be obtained is given by the numerators of your probabilities.
What is the probability of three of a kind?
As you know, there are $$\binom{52}{5}$$ possible five-card hands that can be drawn from a standard deck.
However, your count of the favorable cases is not quite right. There are $$\binom{13}{1}$$ ways to choose the rank from which three cards are drawn and $$\binom{4}{3}$$ ways to select cards of that rank, as you found. The remaining two cards must come from different ranks. There are $$\binom{12}{2}$$ ways to select two ranks from which one card is drawn and $$\binom{4}{1}$$ ways to choose one card from each of the two ranks. Hence, the number of favorable cases is $$\binom{13}{1}\binom{4}{3}\binom{12}{2}\binom{4}{1}^2$$ Therefore, the probability of three of a kind is $$\frac{\dbinom{13}{1}\dbinom{4}{3}\dbinom{12}{2}\dbinom{4}{1}^2}{\dbinom{52}{5}}$$
You count each hand twice since the order in which the singletons are selected does not matter. For instance, if the hand is $$\color{red}{5\heartsuit}, \color{red}{5\diamondsuit}, 5\spadesuit, 7\clubsuit, \color{red}{10\diamondsuit}$$, you count it once when you select $$7\clubsuit$$ as the card you are drawing from the remaining $$12$$ ranks in the deck and $$\color{red}{10\diamondsuit}$$ as the card you are drawing from the remaining $$11$$ ranks in the deck and once when you select $$\color{red}{10\diamondsuit}$$ as the card you are drawing from the remaining $$12$$ ranks in the deck and $$7\clubsuit$$ as the card you are drawing from the remaining $$11$$ ranks in the deck. However, both selections result in the same hand. Therefore, you need to divide your answer by $$2$$. Notice that $$\frac{1}{2}\binom{13}{1}\binom{4}{3}\binom{12}{1}\binom{4}{1}\binom{11}{1}\binom{11}{1}\binom{4}{1} = \binom{13}{1}\binom{4}{3}\binom{12}{2}\binom{4}{1}^2$$
• What matters is which cards are selected. We need to choose the rank from which three cards are drawn, three cards of that rank, the two ranks from which a single card is drawn, and one card from each of those ranks. In your attempt, you distinguished between the first single card you draw and the second one you draw by first selecting a card from one of the remaining $12$ ranks and then selecting a card from one of the remaining $11$ ranks. However, you still get the same hand if you select the cards in the opposite order, which means you have counted every hand twice. Feb 17 '19 at 0:07 | 2021-10-27T14:21:44 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/3113091/a-poker-hand-contains-five-cards-find-the-probability-that-a-poker-hand-can-be",
"openwebmath_score": 0.6982788443565369,
"openwebmath_perplexity": 143.3931126370973,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9898303413461358,
"lm_q2_score": 0.8723473879530491,
"lm_q1q2_score": 0.8634759127899766
} |
http://mathhelpforum.com/algebra/4627-formula-1-1-2-1-2-3-1-2-3-4-a.html | 1. ## Formula for 1+(1+2)+(1+2+3)+(1+2+3+4)+...
Can someone show me the formula for calculating 1+(1+2)+(1+2+3)+(1+2+3+4)+...
2. Originally Posted by OReilly
Can someone show me the formula for calculating 1+(1+2)+(1+2+3)+(1+2+3+4)+...
Yes, I presume you have a finite sum.
---
The key in the the fact that,
$\displaystyle 1+2+...+x=\frac{x(x+1)}{2}$
---
Therefore, that entire sum is,
$\displaystyle \frac{1(2)}{2}+\frac{2(3)}{2}+...+\frac{n(n+1)}{2}$
Thus,
$\displaystyle \sum_{k=1}^{n}\frac{k(k+1)}{2}=\frac{1}{2}\sum_{k= 1}^n k^2+k$
Thus, subdivide the summation,
$\displaystyle \frac{1}{2}\sum_{k=1}^n k^2+\frac{1}{2}\sum_{k=1}^n k$
Use the fact above, and the sum of squares formula,
$\displaystyle \frac{1}{2}\cdot \frac{n(n+1)}{2}+\frac{1}{2}\cdot \frac{n(n+1)(2n+1)}{6}$
Simplify,
$\displaystyle \frac{n(n+1)}{4}+\frac{n(n+1)(2n+1)}{12}$
$\displaystyle \frac{3n(n+1)+n(n+1)(2n+1)}{12}$
Thus, (factor),
$\displaystyle \frac{n(n+1)(3+2n+1)}{12}$
Simplify again,
$\displaystyle \frac{n(n+1)(2n+4)}{12}$
Simplify again,
$\displaystyle \frac{n(n+1)(n+2)}{6}$
~~~
Just for refernce, the sum of squares formula is,
$\displaystyle \sum_{k=1}^nk^2=\frac{n(n+1)(2n+1)}{6}$
----
I think it is cool that,
$\displaystyle \left( \begin{array}{c}n+2\\3 \end{array} \right)=\frac{(n+2)(n+1)n}{3!}$
That means you can calculate the sum by taking 2 more than number of terms and finding the number of combinations of forming three.
3. Thanks!
I didn't know sum of squares formula.
4. Hello,OReilly!
TPHacker is absolutely correct . . . Nice job, T.P. !
If we are desperate, we could find the formula "from scratch".
Can someone show me the formula for calculating:
. . . $\displaystyle 1+(1+2)+(1+2+3)+(1+2+3+4)+\hdots$
Crank out a list of the first few sums:
$\displaystyle \begin{array}{ccccccccc}S_1\:=\:1 \\ S_2\:=\:1 + 3\:=\:4\\S_3\:=\:1 + 3 + 6\:=\:10\\ S_4\:=\:1 + 3+6+10 \:=\:20\\ S_5\:=\:1+3+6+10+15\:=\:35 \\S_6\:=\:1+3+6+10+15+21\:=\:56\\ S_7\:=\:1+3+6+10+15+21+28 \;=\;84\\ \vdots\end{array}$
We have a function $\displaystyle f(n)$. .For $\displaystyle n = 1,2,3,\hdots$
. . the function has consecutive values: .$\displaystyle 1\quad4\quad10\quad20\quad56\quad84\;\hdots$
Take differences of consecutive terms: . . $\displaystyle 3\quad6\quad\;10\;\quad15\quad21\;\hdots$
Take differences again: . . . . . . . . . . . . . .$\displaystyle 3\quad\;4\quad\;\;5\quad\;\;6\;\hdots$
Take differences again: . . . . . . . . . . . . . . . $\displaystyle 1\quad\;1\quad\;\:1\;\hdots$
We have a series of constants at the third differences.
. . Hence, $\displaystyle f(n)$ is a third-degree polynomial ... a cubic.
Hence, the function is of the form: .$\displaystyle f(n)\:=\:an^3 + bn^2 + cn + d$
. . and we must determine $\displaystyle a,b,c,d.$
Use the first four values from our list.
$\displaystyle S_1\,=\,1:\;\;a\cdot1^3 + b\cdot1^2 + c\cdot1 + d\:=$ $\displaystyle \:1\quad\;\;\;\Rightarrow\quad\;\; a+b+c+d\;=\;1$
$\displaystyle S_2\,=\,4:\;\;a\cdot2^3 + b\cdot2^2 + c\cdot2 + d \:= \:$ $\displaystyle 4\;\;\;\quad\Rightarrow\quad\; 8a + 4b +2c + d \;= \;4$
$\displaystyle S_3\,=\,10:\;a\cdot3^3 + b\cdot3^2 + c\cdot3 + d \:=$ $\displaystyle \:10\quad\Rightarrow\quad 27a + 9b + 3c + d \;= \;10$
$\displaystyle S_4\,=\,20:\;a\cdot4^3 + b\cdot4^2 + c\cdot4 + d\:=$ $\displaystyle \:20\quad\Rightarrow\quad 64a + 16b + 4c + d \;= \;20$
Now we must solve this system of equations . . . but it's easy!
. . $\displaystyle \begin{array}{cccc}a+b+c+d\:=\:1 \\ 8a + 4b + 2c + d \:=\:4 \\ 27a + 9b + 3c + d \:= \:10\\ 64a + 16b + 4c + d \:=\:20\end{array}\;\begin{array}{cccc}(1)\\(2)\\( 3)\\(4)\end{array}$
Subtract (1) from (2): .$\displaystyle 7a + 2b + c \:= \:3\quad\;\;\;(5)$
Subtract (2) from (3): .$\displaystyle 19a + 5b + c \:= \:6\quad\;(6)$
Subtract (3) from (4): .$\displaystyle 376a + 7b + c \:= \:10\;\;(7)$
Subtract (5) from (6): .$\displaystyle 12a + 2b\:=\:3\;\;(8)$
Subtract (6) from (7): .$\displaystyle 18a + 2b\:=\:4\;\;(9)$
Subtract (8) from (9): .$\displaystyle 6a\,=\,1\quad\Rightarrow\quad \boxed{a = \frac{1}{6}}$
Substitute into (8): .$\displaystyle 12\left(\frac{1}{6}\right) + 2b\:=\:3\quad\Rightarrow\quad \boxed{b = \frac{1}{2}}$
Substitute into (5): .$\displaystyle 7\left(\frac{1}{6}\right) + 3\left(\frac{1}{2}\right) + c\:=\:3\quad\Rightarrow\quad \boxed{c = \frac{1}{3}}$
Substitute into (1): .$\displaystyle \frac{1}{6} + \frac{1}{2} + \frac{1}{3} + d\:=\:1\quad\Rightarrow\quad \boxed{d = 0}$
Therefore: .$\displaystyle f(n)\:=\:\frac{1}{6}n^3 + \frac{1}{2}n^2 + \frac{1}{3}n\quad\Rightarrow\quad \boxed{f(n)\;=\;\frac{n(n+1)(n+2)}{6}}$
~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~
This "scratch"method can be used
. . when we suspect we have a polynomial function.
It is long and tedious, but it works.
Of course, it is more efficient to learn a few sums-of-powers formula:
. . $\displaystyle \sum_{k=1}^n k \;= \;\frac{n(n+1)}{2}$
. . $\displaystyle \sum_{k=1}^n n^2\;=\;\frac{n(n+1)(2n+1)}{6}$
. . $\displaystyle \sum_{k=1}^n k^3\;= \;\frac{n^2(n+1)^2}{4}$
Note that the third formula is the square of the first formula,
. . making it easier to memorize.
. . This means: .$\displaystyle (1 + 2 + 3 + 4 + 5)^2\:=\:1^3+2^3+3^3+4^3+5^3$
It looks like a bad joke or a terrible blunder, doesn't it?
5. Originally Posted by Soroban
We have a series of constants at the third differences.
. . Hence, $\displaystyle f(n)$ is a third-degree polynomial ... a cubic.
Tell me something, is this a famous method? This is the second time I seen it used on this forum. When I was younger I developed many theorems concerning differences of a sequence. One of them you just used. (A sequence is a polynomial of degree n if and only if it takes n steps to reach a constanct sequence).
---
I have a elegant prove with this rule that,
$\displaystyle a^{(m)}_k=\sum_{k=1}^nk^m$ is always a polynomial sequence.
Consider an infinite sequence,
$\displaystyle 0^m,1^m+0^m,2^m+1^m+0^m,...$
Its diffrence sequence is,
$\displaystyle 0^m,1^m,2^m,3^m,...$
A polynomial sequence of degree $\displaystyle m$ therefore $\displaystyle m$ subtractions are required. In total we used $\displaystyle m+1$ subtractions on our original sequence. Thus there exists a polynomial sequence of degree $\displaystyle m+1$. Furthermore, the first coefficient is $\displaystyle \frac{1}{(m+1)!}$. Based on the fact the constant sequence follows the factorial.
6. Originally Posted by ThePerfectHacker
Tell me something, is this a famous method?
Yes, I seem to recall that it is associated with Newton's name, but that
be a manifestation of false memory syndrome, but it is in Acton's
"Numerical Methods that Work", which I swear by
RonL
7. Hello, TPHacker!
Tell me something, is this a famous method?
I'm sure it is . . .
I ran across many years ago in some book. .Since then, I've seen more efficient methods,
but I like that very primitive method. .(But I don't use it unless I am forced to.)
In case anyone is interested . . .
I was shown this method in graduate school . . . quite an eye-opener.
To find, for example, $\displaystyle \sum^n_{k=1} k^4$, we are expected to know the three "preceding" formulas:
. . $\displaystyle \sum^n_{k=1} k \:=\:\frac{n(n+1)}{2}\qquad\sum^n_{k=1} k^2 \:=\:\frac{n(n+1)(2n+1)}{6}\qquad\sum^n_{k=1}$$\displaystyle k^3\:=\:\frac{n^2(n+1)^2}{4}$
Consider the next-higher power and form: .$\displaystyle k^5 - (k-1)^5$
We have: /$\displaystyle k^5 - (k-1)^5\:=\;5k^4 - 10k^3 + 10k^2 - 5k + 1$
Now let $\displaystyle k \,= \,n,\,n\!-\!1,\,n\!-\!2,\,...\,,\,3,\,2,\,1$ and "stack" the equations.
. . . . $\displaystyle n^5 - (n-1)^5\;=\quad\;\;5n^4\quad -\quad\;\; 10n^3\quad +$ . .$\displaystyle 10n^2\quad\; -\quad\; 5n\quad\; + 1$
$\displaystyle (n-1)^5-(n-2)^5 \;=$ $\displaystyle \:5(n-1)^4 - 10(n-1)^3 + 10(n-1)^2 - 5(n-1) + 1$
$\displaystyle (n-2)^5-(n-3)^5 \;=$ $\displaystyle \:5(n-2)^4 - 10(n-2)^3 + 10(n-2)^2 - 5(n-2) + 1$
. . . . . . $\displaystyle \vdots$ . . . . . . . . . . .$\displaystyle \vdots$ . . . . . . . .$\displaystyle \vdots$ . . . . . . . $\displaystyle \vdots$ . . . . . . . $\displaystyle \vdots$ . . . $\displaystyle \vdots$
. . $\displaystyle 3^5\quad -\quad 2^5 \qquad= \quad\;\;5(3^4)\;\;\; -\;\;\; 10(3^3)$ . $\displaystyle +\;\;\; 10(3^2)\quad -\quad 5(3)\quad + 1$
. . $\displaystyle 2^5\quad -\quad 1^5\qquad = \quad\;\;5(2^4)\;\;\; -\;\;\; 10(2^3)$ . $\displaystyle +\;\;\; 10(2^2)\quad -\quad 5(2)\quad + 1$
. . $\displaystyle 1^5\quad -\quad 0^5 \qquad = \quad\;\;5(1^4)\;\;\; -\;\;\; 10(1^3)$ . $\displaystyle + \;\;\;10(1^2)\quad -\quad 5(1)\quad + 1$
Add the stack (most of the left side cancels out):
. . $\displaystyle n^5\;=\;5\left(\sum k^4\right) - 10\left(\sum k^3\right) +$ $\displaystyle 10\left(\sum k^2\right) - 5\left(\sum k\right) + \left(\sum 1\right)$
We have: .$\displaystyle n^5 \;= \;5\left(\sum k^4\right)-10\cdot\frac{n^2(n+1)^2}{4} +$ $\displaystyle 10\cdot\frac{n(n+1)(2n+1)}{6} - 5\cdot\frac{n(n+1)}{2} + n$
Then, after an enormous amount of algebra, we get:
. . . . $\displaystyle \boxed{\sum^n_{k=1} k^4\;=\;\frac{n(n+1)(2n+1)(3n^2 + 3n - 1)}{30}}$ | 2018-04-26T11:49:50 | {
"domain": "mathhelpforum.com",
"url": "http://mathhelpforum.com/algebra/4627-formula-1-1-2-1-2-3-1-2-3-4-a.html",
"openwebmath_score": 0.9577927589416504,
"openwebmath_perplexity": 2342.3804025705745,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.985936372130286,
"lm_q2_score": 0.8757870029950159,
"lm_q1q2_score": 0.8634702604917618
} |
https://math.stackexchange.com/questions/709483/pointwise-converging-subsequence-on-countable-set | # Pointwise converging subsequence on countable set
Let $A \subseteq \mathbb R$ be countable and let $f_n: A\to \mathbb R$ be a sequence of functions such that there exists $M \ge 0$ with $\,\lvert\,f_n(x)\rvert\le M$ for all $n$. I am trying to show that there exists a subsequence $f_{n_k}$ of $f_n$ that converges pointwise.
Here is what I have so far: If $A = \{a_1, a_2, \dots \}$ then $f_n(a_1)$ is a bounded sequence hence by Bolzano Weierstrass theorem contains a convergent subsequence $f_{n_{k_1}}$. By the same argument $f_{n_{k_1}}(a_2)$ contains a convergent subsequence $f_{n_{k_2}}$.
Next I want to define $$f_{n_k} (x) = \lim_{j \to \infty} f_{n_{k_j}}(x),$$ the pointwise limit. Then $f_{n_k}(a_j)$ converges for every $a_j \in A$ (it's clear by how it was defined).
Am I done now or am I missing something? Is there anything left to show?
Let $A=\{a_n:n\in\mathbb N\}$. Using Bolzano-Weierstrass for the bounded sequence $\{f_n(a_1)\}_{n\in\mathbb N}$ we can find a convergent subsequence which we denote as $\{f_{1,n}(a_1)\}_{n\in\mathbb N}$. Next, as $\{f_{1,n}(a_2)\}_{n\in\mathbb N}$ is bounded, it also contains a convergent subsequence which we denote as $\{f_{2,n}(a_2)\}_{n\in\mathbb N}$.
In this way we construct recursively the following convergent sequences: \begin{align} f_{1,1}(a_1),&f_{1,2}(a_1),\ldots f_{1,n}(a_1),\ldots,\\ f_{2,1}(a_2),&f_{2,2}(a_2),\ldots f_{2,n}(a_2,\ldots,\\ \vdots&\\ f_{n,1}(a_n),&f_{n,2}(a_n),\ldots f_{n,n}(a_n),\ldots,\\ \vdots& \end{align} with $\{f_{k,n}\}_{n\in\mathbb N}$ a subsequence of all the sequences $\{f_{j,n}\}_{n\in\mathbb N}$, for $j<k$, and say that $\lim_{n\to\infty}f_{j,n}(a_j)=f(a_j)$.
The sequence $\{f_{n,n}\}_{n\in\mathbb N}$ is finally a subsequence of all the above, and hence $\{f_{n,n}(a_j)\}_{n\in\mathbb N}$ converges for all $j\in\mathbb N$, and in particularly $$\lim_{n\to\infty}f_{n,n}(a_j)=f(a_j),$$ for all $j\in\mathbb N$.
• Nice answer. But I don't understand why $f_{k,n}$ is subsequence of $f_{j,n}$ please can you illustrate? – MathLover Nov 17 '18 at 11:46 | 2019-09-15T15:58:36 | {
"domain": "stackexchange.com",
"url": "https://math.stackexchange.com/questions/709483/pointwise-converging-subsequence-on-countable-set",
"openwebmath_score": 0.9963683485984802,
"openwebmath_perplexity": 88.43574137365928,
"lm_name": "Qwen/Qwen-72B",
"lm_label": "1. YES\n2. YES",
"lm_q1_score": 0.9859363713038174,
"lm_q2_score": 0.8757869981319862,
"lm_q1q2_score": 0.8634702549733136
} |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.