Show SXPW9zu24Xc "Skip Counting" is counting by a number that is not 1
Example: We Skip Count by 2 like this:2, 4, 6, 8, 10, 12, 14, 16, 18, 20, ...
Skip Counting by 10sSkip Counting by 10s is the easiest. It is like normal counting (1, 2, 3,...) except there is an extra "0": 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, ...
Skip Count by 2Learning to skip count by 2 means you can count things faster! Try this example, who will be the winner? images/skip-count-2.js Drag the marbles: images/skip-count.js Now you can practice by "Filling Out the Missing Numbers":
Skip Counting by 5sSkip Counting by 5s has a nice pattern: 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, ... That pattern should make it easy for you! OK, let us get some practice: Skip Counting by 3s and 4sSkip Counting by 3s is: 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, ...
Skip Counting by 4s is: 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, ...
Skip Count Backwards!Yes, skip counting also works backwards: Skip Count by Bigger Numbers!Try these for a challenge:
Skip Count on the Number LineAlso try skip counting on the number line Copyright © 2021 MathsIsFun.com
Multiplication is essentially repeated addition a given number m {\displaystyle \scriptstyle m\,} is repeatedly added a number of times n {\displaystyle \scriptstyle n\,} ; this can be notated m × n {\displaystyle \scriptstyle m\times n\,} or m ⋅ n {\displaystyle \scriptstyle m\cdot n\,} (or even m n {\displaystyle \scriptstyle mn\,} ) and read " m {\displaystyle \scriptstyle m\,} times n {\displaystyle \scriptstyle n\,} ." For example, 7 × 4 = 7 + 7 + 7 + 7 = 28 {\displaystyle \scriptstyle 7\times 4\,=\,7+7+7+7\,=\,28\,} . In most computer programming languages, and in TeX source, the asterisk character * is used as the multiplication operator: m*n. Like addition, multiplication is commutative[1]. Thus, 4 × 7 = 4 + 4 + 4 + 4 + 4 + 4 + 4 = 28 {\displaystyle \scriptstyle 4\times 7\,=\,4+4+4+4+4+4+4\,=\,28\,} . Iterated multiplication can be abbreviated by the use of the product operator (denoted with the capital letter pi of the Greek alphabet), i.e. ∏ i = 1 n a i ≡ a 1 ⋅ a 2 ⋅ a 3 ⋅ … ⋅ a n . {\displaystyle \prod _{i=1}^{n}a_{i}\equiv a_{1}\cdot a_{2}\cdot a_{3}\cdot \ldots \cdot a_{n}.\,}The multiplicative identity is 1: any number multiplied by 1 remains the same. For example, –43 × 1 = –43, 0 × 1 = 0, 3.7 × 1 = 3.7, etc. The multiplicative inverse (denoted / n {\displaystyle \scriptstyle /n\,} ) of n {\displaystyle \scriptstyle n\,} is defined by ( / n ) ⋅ n = ( 1 / n ) ⋅ n = 1 {\displaystyle (/n)\cdot n=(1/n)\cdot n=1\,}Division is multiplication with multiplicative inverse of second term (the divisor) which by definition makes it non-commutative. The generating function of sequences of multiples is M m ( n ) ≡ m n , n ≥ 0 {\displaystyle M_{m}(n)\equiv mn,\ n\geq 0\,}is given by G { M m ( n ) } ( x ) = G { m n } ( x ) = m G { n } ( x ) = m x A 1 ( x ) ( 1 − x ) 2 = m x ( 1 − x ) 2 , {\displaystyle G_{\{M_{m}(n)\}}(x)=G_{\{mn\}}(x)=m\ G_{\{n\}}(x)={\frac {mxA_{1}(x)}{(1-x)^{2}}}={\frac {mx}{(1-x)^{2}}},\,}where A 1 ( x ) = 1 {\displaystyle \scriptstyle A_{1}(x)\,=\,1\,} is an Eulerian polynomial. Table of sequences of nonnegative multiples of nonnegative integersA sequence of integers { m × i } i = 0 ∞ {\displaystyle \scriptstyle \{m\times i\}_{i=0}^{\infty }} is called "the multiples of m {\displaystyle \scriptstyle m\,} ." Some sequences of multiples in the OEIS are:
See alsoNotes
|