The document discusses sequences and summation notation. It defines a sequence as an ordered list of numbers that may have a pattern. Common examples provided are the sequences of odd numbers, even numbers, and square numbers. A formula is given for calculating the nth term of each sequence. Summation notation is introduced as using the Greek letter sigma to represent summing a list of numbers. An example shows how to write the sum of 100 terms in a sequence using sigma notation with limits and an index variable.
"Harmonic and Other Sequences" presentation includes a brief historical background, problems and solutions to the simplest problems which you may face in your Mathematics.
Factor Theorem and Remainder Theorem. Mathematics10 Project under Mrs. Marissa De Ocampo. Prepared by Danielle Diva, Ronalie Mejos, Rafael Vallejos and Mark Lenon Dacir of 10- Einstein. CNSTHS.
"Harmonic and Other Sequences" presentation includes a brief historical background, problems and solutions to the simplest problems which you may face in your Mathematics.
Factor Theorem and Remainder Theorem. Mathematics10 Project under Mrs. Marissa De Ocampo. Prepared by Danielle Diva, Ronalie Mejos, Rafael Vallejos and Mark Lenon Dacir of 10- Einstein. CNSTHS.
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
2. Sequences
Here is a typical spread sheet that
records an ordered list of numbers
under the column F.
3. Sequences
Here is a typical spread sheet that
records an ordered list of numbers
under the column F.
We may view the entries 2, 4, 6…
as guests in rooms F1, F2, F3 …
respectively, in a hotel.
4. Sequences
Here is a typical spread sheet that
records an ordered list of numbers
under the column F.
We may view the entries 2, 4, 6…
as guests in rooms F1, F2, F3 …
respectively, in a hotel.
By ordered list we mean that
if the entries were 4, 2, 6, 8,10, …
we would treat it as a different list.
5. Sequences
Here is a typical spread sheet that
records an ordered list of numbers
under the column F.
We may view the entries 2, 4, 6…
as guests in rooms F1, F2, F3 …
respectively, in a hotel.
By ordered list we mean that
if the entries were 4, 2, 6, 8,10, …
we would treat it as a different list.
The entries 2, 4, 6.. is the list of even numbers.
Hence we may infer that F10 = 20.
In fact, there is a formula for calculating the entry FN
based on the “room number” N that FN = 2N.
6. A sequence is an ordered list of infinitely many
numbers that may or may not have a pattern.
Sequences
7. A sequence is an ordered list of infinitely many
numbers that may or may not have a pattern.
Sequences
Example A.
1, 3, 5, 7, 9,… is the sequence of odd numbers.
8. A sequence is an ordered list of infinitely many
numbers that may or may not have a pattern.
Sequences
Example A.
1, 3, 5, 7, 9,… is the sequence of odd numbers.
1, 4, 9, 16, 25,… is the sequence of square numbers.
9. A sequence is an ordered list of infinitely many
numbers that may or may not have a pattern.
Sequences
Example A.
1, 3, 5, 7, 9,… is the sequence of odd numbers.
1, 4, 9, 16, 25,… is the sequence of square numbers.
5, –2, , e2, –110, … is a sequence without an
obvious pattern.
10. A sequence is an ordered list of infinitely many
numbers that may or may not have a pattern.
Definition: A sequence is the list of outputs f(n) of a
function f where n = 1, 2, 3, 4, … We write f(n) as fn.
Sequences
Example A.
1, 3, 5, 7, 9,… is the sequence of odd numbers.
1, 4, 9, 16, 25,… is the sequence of square numbers.
5, –2, , e2, –110, … is a sequence without an
obvious pattern.
11. A sequence is an ordered list of infinitely many
numbers that may or may not have a pattern.
Definition: A sequence is the list of outputs f(n) of a
function f where n = 1, 2, 3, 4, … We write f(n) as fn.
Sequences
Example A.
1, 3, 5, 7, 9,… is the sequence of odd numbers.
1, 4, 9, 16, 25,… is the sequence of square numbers.
5, –2, , e2, –110, … is a sequence without an
obvious pattern.
A sequence may be listed as f1, f2, f3, …
12. A sequence is an ordered list of infinitely many
numbers that may or may not have a pattern.
Definition: A sequence is the list of outputs f(n) of a
function f where n = 1, 2, 3, 4, … We write f(n) as fn.
Sequences
Example A.
1, 3, 5, 7, 9,… is the sequence of odd numbers.
1, 4, 9, 16, 25,… is the sequence of square numbers.
5, –2, , e2, –110, … is a sequence without an
obvious pattern.
A sequence may be listed as f1, f2, f3, … so that
f100 = 100th number on the list,
13. A sequence is an ordered list of infinitely many
numbers that may or may not have a pattern.
Definition: A sequence is the list of outputs f(n) of a
function f where n = 1, 2, 3, 4, … We write f(n) as fn.
Sequences
Example A.
1, 3, 5, 7, 9,… is the sequence of odd numbers.
1, 4, 9, 16, 25,… is the sequence of square numbers.
5, –2, , e2, –110, … is a sequence without an
obvious pattern.
A sequence may be listed as f1, f2, f3, … so that
f100 = 100th number on the list,
fn = the n’th number on the list,
14. A sequence is an ordered list of infinitely many
numbers that may or may not have a pattern.
Definition: A sequence is the list of outputs f(n) of a
function f where n = 1, 2, 3, 4, … We write f(n) as fn.
Sequences
Example A.
1, 3, 5, 7, 9,… is the sequence of odd numbers.
1, 4, 9, 16, 25,… is the sequence of square numbers.
5, –2, , e2, –110, … is a sequence without an
obvious pattern.
A sequence may be listed as f1, f2, f3, … so that
f100 = 100th number on the list,
fn = the n’th number on the list,
fn–1 = the (n – 1)’th number on the list or the number
right before fn.
15. Example B.
a. For the sequence of square numbers 1, 4, 9, 16, …
we have that f3 = 9, f4= 16, f5 = 25,
Sequences
16. Example B.
a. For the sequence of square numbers 1, 4, 9, 16, …
we have that f3 = 9, f4= 16, f5 = 25,
and a formula for fn is fn = n2.
Sequences
17. Example B.
a. For the sequence of square numbers 1, 4, 9, 16, …
we have that f3 = 9, f4= 16, f5 = 25,
and a formula for fn is fn = n2.
b. For the sequence of even numbers 2, 4, 6, 8, …
we have that f3= 6, f4 = 8, f5 = 10,
Sequences
18. Example B.
a. For the sequence of square numbers 1, 4, 9, 16, …
we have that f3 = 9, f4= 16, f5 = 25,
and a formula for fn is fn = n2.
b. For the sequence of even numbers 2, 4, 6, 8, …
we have that f3= 6, f4 = 8, f5 = 10,
and a formula for fn is fn = 2n
Sequences
19. Example B.
a. For the sequence of square numbers 1, 4, 9, 16, …
we have that f3 = 9, f4= 16, f5 = 25,
and a formula for fn is fn = n2.
b. For the sequence of even numbers 2, 4, 6, 8, …
we have that f3= 6, f4 = 8, f5 = 10,
and a formula for fn is fn = 2n
Sequences
c. A formula for the sequence of odd numbers
1, 3, 5,.. is fn = 2n – 1.
20. Example B.
a. For the sequence of square numbers 1, 4, 9, 16, …
we have that f3 = 9, f4= 16, f5 = 25,
and a formula for fn is fn = n2.
b. For the sequence of even numbers 2, 4, 6, 8, …
we have that f3= 6, f4 = 8, f5 = 10,
and a formula for fn is fn = 2n
Sequences
c. A formula for the sequence of odd numbers
1, 3, 5,.. is fn = 2n – 1.
d. Multiplying (–1)n or n ±1 creates a sequence with
alternating signs,
21. Example B.
a. For the sequence of square numbers 1, 4, 9, 16, …
we have that f3 = 9, f4= 16, f5 = 25,
and a formula for fn is fn = n2.
b. For the sequence of even numbers 2, 4, 6, 8, …
we have that f3= 6, f4 = 8, f5 = 10,
and a formula for fn is fn = 2n
Sequences
c. A formula for the sequence of odd numbers
1, 3, 5,.. is fn = 2n – 1.
d. Multiplying (–1)n or n ±1 creates a sequence with
alternating signs, e.g. fn = (–1)n(2n – 1)
gives –1, 3, –5, 7,.., the odd numbers with
alternating ± signs.
22. Example B.
a. For the sequence of square numbers 1, 4, 9, 16, …
we have that f3 = 9, f4= 16, f5 = 25,
and a formula for fn is fn = n2.
b. For the sequence of even numbers 2, 4, 6, 8, …
we have that f3= 6, f4 = 8, f5 = 10,
and a formula for fn is fn = 2n
Sequences
c. A formula for the sequence of odd numbers
1, 3, 5,.. is fn = 2n – 1.
d. Multiplying (–1)n or n ±1 creates a sequence with
alternating signs, e.g. fn = (–1)n(2n – 1)
gives –1, 3, –5, 7,.., the odd numbers with
alternating ± signs. Such a sequence whose
signs alternate is called an alternating sequence.
24. In mathematics, the Greek letter “” (sigma) means
“to sum”.
Summation Notation
25. In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
Summation Notation
26. In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
“(x*y)” means to add the x*y’s.
Summation Notation
27. In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
“(x*y)” means to add the x*y’s. (Of course the x's
and xy's have to be given in the context.)
Summation Notation
28. Summation Notation
Given a list, let's say, of 100 numbers, f1, f2, f3,.., f100,
In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
“(x*y)” means to add the x*y’s. (Of course the x's
and xy's have to be given in the context.)
29. Summation Notation
Given a list, let's say, of 100 numbers, f1, f2, f3,.., f100,
their sum f1 + f2 + f3 ... + f99 + f100 may be written in
the – notation as:
fkk = 1
100
In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
“(x*y)” means to add the x*y’s. (Of course the x's
and xy's have to be given in the context.)
30. Summation Notation
Given a list, let's say, of 100 numbers, f1, f2, f3,.., f100,
their sum f1 + f2 + f3 ... + f99 + f100 may be written in
the – notation as:
fkk = 1
100
A variable which is called the
“index” variable, in this case k.
In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
“(x*y)” means to add the x*y’s. (Of course the x's
and xy's have to be given in the context.)
31. Summation Notation
Given a list, let's say, of 100 numbers, f1, f2, f3,.., f100,
their sum f1 + f2 + f3 ... + f99 + f100 may be written in
the – notation as:
fkk = 1
100
A variable which is called the
“index” variable, in this case k.
k begins with the bottom number
and counts up (runs) to the top number.
In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
“(x*y)” means to add the x*y’s. (Of course the x's
and xy's have to be given in the context.)
32. Summation Notation
Given a list, let's say, of 100 numbers, f1, f2, f3,.., f100,
their sum f1 + f2 + f3 ... + f99 + f100 may be written in
the – notation as:
fkk = 1
100
A variable which is called the
“index” variable, in this case k.
k begins with the bottom number
and counts up (runs) to the top number.
The beginning number
In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
“(x*y)” means to add the x*y’s. (Of course the x's
and xy's have to be given in the context.)
33. Summation Notation
Given a list, let's say, of 100 numbers, f1, f2, f3,.., f100,
their sum f1 + f2 + f3 ... + f99 + f100 may be written in
the – notation as:
fkk = 1
100
A variable which is called the
“index” variable, in this case k.
k begins with the bottom number
and counts up (runs) to the top number.
The beginning number
The ending number
In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
“(x*y)” means to add the x*y’s. (Of course the x's
and xy's have to be given in the context.)
34. Summation Notation
Given a list, let's say, of 100 numbers, f1, f2, f3,.., f100,
their sum f1 + f2 + f3 ... + f99 + f100 may be written in
the – notation as:
fk = f1 f2 f3 … f99 f100k = 1
100
A variable which is called the
“index” variable, in this case k.
k begins with the bottom number
and counts up (runs) to the top number.
The beginning number
The ending number
In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
“(x*y)” means to add the x*y’s. (Of course the x's
and xy's have to be given in the context.)
35. Summation Notation
Given a list, let's say, of 100 numbers, f1, f2, f3,.., f100,
their sum f1 + f2 + f3 ... + f99 + f100 may be written in
the – notation as:
fk = f1+ f2+ f3+ … + f99+ f100k = 1
100
A variable which is called the
“index” variable, in this case k.
k begins with the bottom number
and counts up (runs) to the top number.
The beginning number
The ending number
In mathematics, the Greek letter “” (sigma) means
“to sum”. Hence, “x” means to add the x’s,
“(x*y)” means to add the x*y’s. (Of course the x's
and xy's have to be given in the context.)
36. Example C.
fk =k=4
8
ai =
i=2
5
xjyj =
j=6
9
aj =
j=n
n+3
Summation Notation
37. Example C.
fk = f4+ f5+ f6+ f7+ f8k=4
8
ai =
i=2
5
xjyj =
j=6
9
aj =
j=n
n+3
Summation Notation
38. Example C.
fk = f4+ f5+ f6+ f7+ f8k=4
8
ai = a2+ a3+ a4+ a5i=2
5
xjyj =
j=6
9
aj =
j=n
n+3
Summation Notation
39. Example C.
fk = f4+ f5+ f6+ f7+ f8k=4
8
ai = a2+ a3+ a4+ a5i=2
5
xjyj = x6y6+ x7y7+ x8y8+ x9y9j=6
9
aj = an+ an+1+ an+2+ an+3j=n
n+3
Summation Notation
40. Example C.
fk = f4+ f5+ f6+ f7+ f8k=4
8
ai = a2+ a3+ a4+ a5i=2
5
xjyj = x6y6+ x7y7+ x8y8+ x9y9j=6
9
aj = an+ an+1+ an+2+ an+3j=n
n+3
Summation Notation
Summation notation is used to express formulas.
41. Example C.
fk = f4+ f5+ f6+ f7+ f8k=4
8
ai = a2+ a3+ a4+ a5i=2
5
xjyj = x6y6+ x7y7+ x8y8+ x9y9j=6
9
aj = an+ an+1+ an+2+ an+3j=n
n+3
Summation Notation
Summation notation is used to express formulas.
An example is the formula for the mean (average).
42. Example C.
fk = f4+ f5+ f6+ f7+ f8k=4
8
ai = a2+ a3+ a4+ a5i=2
5
xjyj = x6y6+ x7y7+ x8y8+ x9y9j=6
9
aj = an+ an+1+ an+2+ an+3j=n
n+3
Summation Notation
Summation notation is used to express formulas.
An example is the formula for the mean (average).
Given n numbers, f1, f2, f3,.., fn, their mean or average,
written as f
43. Example C.
fk = f4+ f5+ f6+ f7+ f8k=4
8
ai = a2+ a3+ a4+ a5i=2
5
xjyj = x6y6+ x7y7+ x8y8+ x9y9j=6
9
aj = an+ an+1+ an+2+ an+3j=n
n+3
Summation Notation
Summation notation is used to express formulas.
An example is the formula for the mean (average).
Given n numbers, f1, f2, f3,.., fn, their mean or average,
written as f = (f1 + f2 + f3 ... + fn–1 + fn)/n.
44. Example C.
fk = f4+ f5+ f6+ f7+ f8k=4
8
ai = a2+ a3+ a4+ a5i=2
5
xjyj = x6y6+ x7y7+ x8y8+ x9y9j=6
9
aj = an+ an+1+ an+2+ an+3j=n
n+3
Summation Notation
Summation notation is used to express formulas.
An example is the formula for the mean (average).
Given n numbers, f1, f2, f3,.., fn, their mean or average,
written as f = (f1 + f2 + f3 ... + fn–1 + fn)/n.
f =
k=1
n
fk
nIn notation, .
45. The index variable is also used as the variable that
generates the numbers to be summed.
Summation Notation
46. Example D.
a. (k2 – 1)
k=5
8
The index variable is also used as the variable that
generates the numbers to be summed.
Summation Notation
47. Example D.
a. (k2 – 1) =
k=5
8
The index variable is also used as the variable that
generates the numbers to be summed.
k=5 k=6 k=7 k=8
Summation Notation
48. Example D.
a. (k2 – 1) = (52–1) + (62–1) + (72–1) + (82–1)
k=5
8
The index variable is also used as the variable that
generates the numbers to be summed.
k=5 k=6 k=7 k=8
Summation Notation
49. Example D.
a. (k2 – 1) = (52–1) + (62–1) + (72–1) + (82–1)
= 24 + 35 + 48 + 63
k=5
8
The index variable is also used as the variable that
generates the numbers to be summed.
k=5 k=6 k=7 k=8
Summation Notation
50. a. (k2 – 1) = (52–1) + (62–1) + (72–1) + (82–1)
= 24 + 35 + 48 + 63
= 170
k=5
8
The index variable is also used as the variable that
generates the numbers to be summed.
k=5 k=6 k=7 k=8
Summation Notation
Example D.
51. a. (k2 – 1) = (52–1) + (62–1) + (72–1) + (82–1)
= 24 + 35 + 48 + 63
= 170
k=5
8
The index variable is also used as the variable that
generates the numbers to be summed.
k=5 k=6 k=7 k=8
Summation Notation
b. (–1)k(3k + 2)
k=3
5
Example D.
52. a. (k2 – 1) = (52–1) + (62–1) + (72–1) + (82–1)
= 24 + 35 + 48 + 63
= 170
k=5
8
The index variable is also used as the variable that
generates the numbers to be summed.
k=5 k=6 k=7 k=8
Summation Notation
b. (–1)k(3k + 2)
=(–1)3(3*3+2)+(–1)4(3*4+2)+(–1)5(3*5+2)
k=3
5
Example D.
53. a. (k2 – 1) = (52–1) + (62–1) + (72–1) + (82–1)
= 24 + 35 + 48 + 63
= 170
k=5
8
The index variable is also used as the variable that
generates the numbers to be summed.
k=5 k=6 k=7 k=8
Summation Notation
b. (–1)k(3k + 2)
=(–1)3(3*3+2)+(–1)4(3*4+2)+(–1)5(3*5+2)
= –11 + 14 – 17
k=3
5
Example D.
54. a. (k2 – 1) = (52–1) + (62–1) + (72–1) + (82–1)
= 24 + 35 + 48 + 63
= 170
k=5
8
The index variable is also used as the variable that
generates the numbers to be summed.
k=5 k=6 k=7 k=8
Summation Notation
b. (–1)k(3k + 2)
=(–1)3(3*3+2)+(–1)4(3*4+2)+(–1)5(3*5+2)
= –11 + 14 – 17
= –14
k=3
5
Example D.
55. a. (k2 – 1) = (52–1) + (62–1) + (72–1) + (82–1)
= 24 + 35 + 48 + 63
= 170
k=5
8
The index variable is also used as the variable that
generates the numbers to be summed.
k=5 k=6 k=7 k=8
Summation Notation
b. (–1)k(3k + 2)
=(–1)3(3*3+2)+(–1)4(3*4+2)+(–1)5(3*5+2)
= –11 + 14 – 17
= –14
k=3
5
In part b, the multiple (–1)k change the sums to an
alternating sum, that is, a sum where the terms
alternate between positive and negative numbers.
Example D.
57. Properties Summation Notation
a. (ak + bk) = ak + bk
–Notation Properties
The –notation distributes over sums and differences.
b. (ak – bk) = ak – bk
58. Properties Summation Notation
a. (ak + bk) = ak + bk
c. cak = c(ak) where c is a constant.
–Notation Properties
The –notation distributes over sums and differences.
Constant multiples may be pulled out.
b. (ak – bk) = ak – bk
59. Properties Summation Notation
a. (ak + bk) = ak + bk
c. cak = c(ak) where c is a constant.
d. If c is a constant, then c = c + c + .. + c = nc.
k=1
n times
n
–Notation Properties
The –notation distributes over sums and differences.
Constant multiples may be pulled out.
b. (ak – bk) = ak – bk
60. Properties Summation Notation
a. (ak + bk) = ak + bk
c. cak = c(ak) where c is a constant.
d. If c is a constant, then c = c + c + .. + c = nc.
k=1
n times
n
–Notation Properties
The –notation distributes over sums and differences.
Constant multiples may be pulled out.
b. (ak – bk) = ak – bk
for example, 3k=1
5
61. Properties Summation Notation
a. (ak + bk) = ak + bk
c. cak = c(ak) where c is a constant.
d. If c is a constant, then c = c + c + .. + c = nc.
k=1
n times
n
–Notation Properties
The –notation distributes over sums and differences.
Constant multiples may be pulled out.
b. (ak – bk) = ak – bk
for example, 3 = 3 + 3 + 3 + 3 + 3 = 15.k=1
5
62. Properties Summation Notation
a. (ak + bk) = ak + bk
c. cak = c(ak) where c is a constant.
d. If c is a constant, then c = c + c + .. + c = nc.
k=1
n times
n
–Notation Properties
The –notation distributes over sums and differences.
Constant multiples may be pulled out.
b. (ak – bk) = ak – bk
for example, 3 = 3 + 3 + 3 + 3 + 3 = 15.k=1
5
To verify these rules write down the sums, e.g.
(ak + bk)k
n
63. Properties Summation Notation
a. (ak + bk) = ak + bk
c. cak = c(ak) where c is a constant.
d. If c is a constant, then c = c + c + .. + c = nc.
k=1
n times
n
(ak + bk)
= (a1 + b1) + (a2 + b2) + .. + (an + bn)
k
n
–Notation Properties
The –notation distributes over sums and differences.
Constant multiples may be pulled out.
b. (ak – bk) = ak – bk
for example, 3 = 3 + 3 + 3 + 3 + 3 = 15.k=1
5
To verify these rules write down the sums, e.g.
64. Properties Summation Notation
a. (ak + bk) = ak + bk
c. cak = c(ak) where c is a constant.
d. If c is a constant, then c = c + c + .. + c = nc.
k=1
n times
n
(ak + bk)
= (a1 + b1) + (a2 + b2) + .. + (an + bn)
= (a1 + a2 + .. + an) + (b1 + b2 + .. + bn)
k
n
–Notation Properties
The –notation distributes over sums and differences.
Constant multiples may be pulled out.
b. (ak – bk) = ak – bk
for example, 3 = 3 + 3 + 3 + 3 + 3 = 15.k=1
5
To verify these rules write down the sums, e.g.
65. Properties Summation Notation
a. (ak + bk) = ak + bk
c. cak = c(ak) where c is a constant.
d. If c is a constant, then c = c + c + .. + c = nc.
k=1
n times
n
(ak + bk)
= (a1 + b1) + (a2 + b2) + .. + (an + bn)
= (a1 + a2 + .. + an) + (b1 + b2 + .. + bn) =
k
ak +k
bk.k
n
–Notation Properties
The –notation distributes over sums and differences.
Constant multiples may be pulled out.
b. (ak – bk) = ak – bk
for example, 3 = 3 + 3 + 3 + 3 + 3 = 15.k=1
5
To verify these rules write down the sums, e.g.
66. Properties Summation Notation
The formula for the sum of the first n numbers
1 + 2 + .. + (n – 1) + n = Sn may be found by summing
two copies in the following manner:
67. Properties Summation Notation
The formula for the sum of the first n numbers
1 + 2 + .. + (n – 1) + n = Sn may be found by summing
two copies in the following manner:
Sn = 1 + 2 + ……+ (n – 1) + n
Sn = n + (n – 1) + ……+ 2 + 1+
68. Properties Summation Notation
The formula for the sum of the first n numbers
1 + 2 + .. + (n – 1) + n = Sn may be found by summing
two copies in the following manner:
Sn = 1 + 2 + ……+ (n – 1) + n
Sn = n + (n – 1) + ……+ 2 + 1
2Sn=(n+1)+(n+1)+……+(n+1)+(n+1)
n times
+
69. Properties Summation Notation
The formula for the sum of the first n numbers
1 + 2 + .. + (n – 1) + n = Sn may be found by summing
two copies in the following manner:
Sn = 1 + 2 + ……+ (n – 1) + n
Sn = n + (n – 1) + ……+ 2 + 1
2Sn=(n+1)+(n+1)+……+(n+1)+(n+1)
n times
Hence 2Sn = n(n + 1) or Sn =
n(n + 1)
2
+
70. Properties Summation Notation
The formula for the sum of the first n numbers
1 + 2 + .. + (n – 1) + n = Sn may be found by summing
two copies in the following manner:
Sn = 1 + 2 + ……+ (n – 1) + n
Sn = n + (n – 1) + ……+ 2 + 1
2Sn=(n+1)+(n+1)+……+(n+1)+(n+1)
n times
Hence 2Sn = n(n + 1) or Sn =
n(n + 1)
2
k =
Formula for the Sum of Natural Numbers
k=1
n
n(n + 1)
2
+
71. Properties Summation Notation
The formula for the sum of the first n numbers
1 + 2 + .. + (n – 1) + n = Sn may be found by summing
two copies in the following manner:
Sn = 1 + 2 + ……+ (n – 1) + n
Sn = n + (n – 1) + ……+ 2 + 1
2Sn=(n+1)+(n+1)+……+(n+1)+(n+1)
n times
Hence 2Sn = n(n + 1) or Sn =
n(n + 1)
2
For example 1+2+3..+100 = kk=1
100
k =
Formula for the Sum of Natural Numbers
k=1
n
n(n + 1)
2
+
72. Properties Summation Notation
The formula for the sum of the first n numbers
1 + 2 + .. + (n – 1) + n = Sn may be found by summing
two copies in the following manner:
Sn = 1 + 2 + ……+ (n – 1) + n
Sn = n + (n – 1) + ……+ 2 + 1
2Sn=(n+1)+(n+1)+……+(n+1)+(n+1)
n times
Hence 2Sn = n(n + 1) or Sn =
n(n + 1)
2
For example 1+2+3..+100 = k =k=1
100
100(100 + 1)
2
= 5050
k =
Formula for the Sum of Natural Numbers
k=1
n
n(n + 1)
2
+
73. Properties Summation Notation
We may use the above properties and the sum
formula to sum all linear sums of the form (ak + b).k
74. Properties Summation Notation
Example E. Find (2k – 5)
k=1
45
We may use the above properties and the sum
formula to sum all linear sums of the form (ak + b).k
75. Properties Summation Notation
k=1
45
(2k – 5) = Σ2k – Σ5 by property a
k=1
45
k
Example E. Find (2k – 5)
k
We may use the above properties and the sum
formula to sum all linear sums of the form (ak + b).k
76. Properties Summation Notation
k=1
45
(2k – 5) = Σ2k – Σ5 by property a
= 2Σk – Σ5 by property c
k=1
45
kk
k=1 k=1
45 45
Example E. Find (2k – 5)
We may use the above properties and the sum
formula to sum all linear sums of the form (ak + b).k
77. Properties Summation Notation
k=1
45
(2k – 5) = Σ2k – Σ5 by property a
= 2Σk – Σ5 by property c
k=1
45
k
k=1
45
= 2 45(45 + 1)
2
by the sum formula
Example E. Find (2k – 5)
k
45
k=1
We may use the above properties and the sum
formula to sum all linear sums of the form (ak + b).k
78. Properties Summation Notation
k=1
45
(2k – 5) = Σ2k – Σ5 by property a
= 2Σk – Σ5 by property c
k=1
45
k
k=1
45
= 2 – 5*4545(45 + 1)
2
by the sum formula by property d
Example E. Find (2k – 5)
k
45
k=1
We may use the above properties and the sum
formula to sum all linear sums of the form (ak + b).k
79. Properties Summation Notation
k=1
45
(2k – 5) = Σ2k – Σ5 by property a
= 2Σk – Σ5 by property c
k=1
45
k
k=1
45
= 2 – 5*4545(45 + 1)
2
by the sum formula by property d
= 2070 – 225
= 1845
Example E. Find (2k – 5)
k
45
k=1
We may use the above properties and the sum
formula to sum all linear sums of the form (ak + b).k
80. Properties Summation Notation
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
81. Properties Summation Notation
k=10
53
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
Example F. Find (4k – 33)
82. Properties Summation Notation
k=10
53
Select a new index, say m, to start at 1.
Example F. Find (4k – 33)
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
83. Properties Summation Notation
k=10
53
Select a new index, say m, to start at 1.
The lower numbers are k = 10 and m = 1
Example F. Find (4k – 33)
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
84. Properties Summation Notation
k=10
53
Select a new index, say m, to start at 1.
The lower numbers are k = 10 and m = 1 k = m + 9.
Example F. Find (4k – 33)
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
85. Properties Summation Notation
k=10
53
Select a new index, say m, to start at 1.
The lower numbers are k = 10 and m = 1 k = m + 9.
The upper number is k = 53
Example F. Find (4k – 33)
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
86. Properties Summation Notation
k=10
53
Select a new index, say m, to start at 1.
The lower numbers are k = 10 and m = 1 k = m + 9.
The upper number is k = 53 53 = m + 9 or m = 44.
Example F. Find (4k – 33)
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
87. Properties Summation Notation
k=10
53
(4k – 33) =
k=10
53
Select a new index, say m, to start at 1.
The lower numbers are k = 10 and m = 1 k = m + 9.
The upper number is k = 53 53 = m + 9 or m = 44.
Rewriting the sum in terms of m:
Example F. Find (4k – 33)
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
88. Properties Summation Notation
k=10
53
(4k – 33) = Σ[4(m + 9) – 33]
k=10
53
Select a new index, say m, to start at 1.
The lower numbers are k = 10 and m = 1 k = m + 9.
The upper number is k = 53 53 = m + 9 or m = 44.
Example F. Find (4k – 33)
Rewriting the sum in terms of m:
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
89. Properties Summation Notation
k=10
53
(4k – 33) = Σ[4(m + 9) – 33]
k=10
53
m=1
Select a new index, say m, to start at 1.
The lower numbers are k = 10 and m = 1 k = m + 9.
The upper number is k = 53 53 = m + 9 or m = 44.
Rewriting the sum in terms of m:
44
Example F. Find (4k – 33)
Adjust the range.
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
90. Properties Summation Notation
k=10
53
(4k – 33) = Σ[4(m + 9) – 33] = Σ(4m – 3)
k=10
53
m=1
Select a new index, say m, to start at 1.
The lower numbers are k = 10 and m = 1 k = m + 9.
The upper number is k = 53 53 = m + 9 or m = 44.
Rewriting the sum in terms of m:
44
m=1
44
Example F. Find (4k – 33)
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
91. Properties Summation Notation
k=10
53
(4k – 33) = Σ[4(m + 9) – 33] = Σ(4m – 3)
= 4Σm – Σ3
k=10
53
m=1
Select a new index, say m, to start at 1.
The lower numbers are k = 10 and m = 1 k = m + 9.
The upper number is k = 53 53 = m + 9 or m = 44.
Rewriting the sum in terms of m:
44
m=1
44
m=1
44
m=1
44
Example F. Find (4k – 33)
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
92. Properties Summation Notation
k=10
53
(4k – 33) = Σ[4(m + 9) – 33] = Σ(4m – 3)
= 4Σm – Σ3
k=10
53
m=1
= 4 – 3*4444(44 + 1)
2
= 3828
Select a new index, say m, to start at 1.
The lower numbers are k = 10 and m = 1 k = m + 9.
The upper number is k = 53 53 = m + 9 or m = 44.
Rewriting the sum in terms of m:
44
m=1
44
m=1
44
m=1
44
Example F. Find (4k – 33)
If the linear sum does not start at k = 1 as required,
use substitution to shift the index-variable to start at 1,
then utilize the sum formula.
93. Recurrent Sequences
Another method for describing sequences is
to give the recurrent-formulas for an based on
the previous terms an–1, an–2, ...etc.
We've 1 pair of baby turtles
at time 0.
It takes 1 year for them to mature.
After the 1st year, they will
produce another baby pair just
like them every year.
Let an = the number of pairs of
turtles at the end of the n’th year.
This is the Fibonacci sequence
which is 1, 1, 2, 3, 5, 8, 13,… etc
It’s defined as a0 = 1, , and that an = an-1 + an-2 .
a0 = 1
a1 = 1
1 yr
baby
new
new
mature
new
new
1 yr
1 yr
1 yr
new
new
94. Recurrent Sequences
Another method for describing sequences is
to give the recurrent-formulas for an based on
the previous terms an–1, an–2, ...etc.
We've 1 pair of baby turtles
at time 0.
It takes 1 year for them to mature.
After the 1st year, they will
produce another baby pair just
like them every year.
Let an = the number of pairs of
turtles at the end of the n’th year.
This is the Fibonacci sequence
which is 1, 1, 2, 3, 5, 8, 13,… etc
It’s defined as a0 = 1, , and that an = an-1 + an-2 .
a0 = 1
a1 = 1
1 yr
baby
new
new
mature
new
new
1 yr
1 yr
1 yr
new
new
95. Exercise A. List the first four terms of each of the
following sequences given by fn where n = 1,2, 3, ..
Sequences
2.
4. 5. 6.
7. 8.
9. 10.
1. 3.fn = –5 + n fn = 5 – n fn = 3n
fn = –5 + 2n fn = 5 – n2fn = –4n + 1
fn = (–1)n5 / n
fn = (3n + 2)/(–1 – n)
fn = 2n2 – n
fn = n2 / (2n + 1)
B. Find formulas fn for the following sequences.
2.
4.
5. 6.
7. 8.
9.
10.
1.
3.
2, 3, 4, 5.. –3, –2, –1, 0, 1..
10, 20, 30, 40,.. 5, 10, 15, 20,..
–40, –30, –20, –10, 0,.. –5, –10, –15, –20,..
1/2, 1/3, 1/4, 1/5.. 1/2, –2/3, 3/4, –4/5..
–1, 1/4, –1/9, 1/16, –1/25,..
1, 0.1, 0.001, 0.0001,..
97. Sequences
It’s possible to add infinitely many numbers and obtain a
finite sum. For example, the sum ½ + ¼ + 1/8 + 1/16...
represents the accumulated amount of
“taking half of the 1 or ½,
take half of what’s left, or ¼,
then take of half of what’s left or 1/8,
and repeat the process without stopping..”
We see that ½ + ¼ + 1/8 + 1/16 + 1/32... = 1.
..
= 1
7. What is 1/3 + 1/9 + 1/27 + 1/81... = ?
½
¼
1/8
1/16
1/32
(Hint: Let the sum 1/3 + 1/9 + 1/27 + 1/81... = x,
factoring out 1/3 from the left, we’ve
1/3(1 + 1/3 + 1/9 + 1/27 + 1/81...) = x, or
1/3(1 + x) = x, then solve for x.)
8. What is 1/4 + 1/16 + 1/64 + 1/81... = ? (Hint: factor out ¼)
9. What is 1/5 + 1/25 + 1/125 + 1/625... = ? (Hint: factor out 1/5)