Do you want BuboFlash to help you learning these things? Click here to log in or create user.

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

alAnkiDroid manual Official Support Anki & AnkiMobileAnkiDroid Resources Add-onsDecksCard Styles Filter by flair Hide QuestionsShow Questions Only 7 Posted by u/Gear5th 2 years ago Archived <span>[Guide] How to Anki Maths the right way. 1. 20 rules of formulating knowledge Go through these carefully. These are guidelines and not rules, that is, it is good to stick to them, but you should know when a certain rule is getting in the way of your learning (practicality beats purity) 2. You shouldn't cram Maths. From the 20 Rules above, ignore the rules #4,7,9,10,12 (keep it precise and rigorous) Maths follows logically, and long proofs can be derived from first principles as long as you understand the basic flow and structure of them. It is OK to have lengthy proofs in your cards. 3. Grade the cards ruthlessly! If you forget some step in the proof, and are unable to figure some way out, you gotta mark the whole card as Again. No excuses! Attention to the tiniest details is what makes someone good at Maths. For example, here's a card of mine: Question: State Vieta's Formulas. Answer: http://i.imgur.com/B6MnBLp.png (Big image, view it in full size) In this card, if I forget the line about Fundamental Theorem of Algebra, I mark it as Again. If I make the slightest mistake in the formula, I mark it Again. If I cannot recollect the values for the cubic and quadratic polynomials from memory without effort, I mark it again. Only if I can recollect every bit of the card perfectly do I mark it as Good or Easy. It is OK to do this. If you feel that doing this will increase your workload a lot, add less cards. Learn the correct thing, even if it means you end up learning slightly less. 4. Add the smallest points that are worth remembering to Anki. Question: f(x) = x2 / x, g(x) = x. Is f(x) = g(x)? Answer: No. For two functions to be equal, their domains must also be same. f(x) is not defined at x=0 Simple, but important! You can add cool things to Anki too. Maths has a lot of cool things (like the graph of sin(1/x) ) 5. Use images, colors (to emphasize points) a lot! Question: http://i.imgur.com/treeyi2.png Answer: http://i.imgur.com/pWGS9c9.png . Question: When we integrate, what is the true meaning of the added constant C? Answer: http://i.imgur.com/ETFVnVM.png . Question: sin(arctan(x)) = ? (And how to remember/derive?) Answer: http://i.imgur.com/YUw7VyV.png Use colors in math equations to make them easier to read: Question: Derive the Inverse Rule of Differentiation. Answer: http://i.imgur.com/cJp0Jzn.png 6. Invest time in making your cards. If you want to do Anki the correct way, there is no shortcut to making cards. You will remember what you put into Anki for years to come. You don't wanna remember poorly formatted or boring/uninformative cards. Making cards will be the majority of your Anki time (several times more than reviewing time!), but it is essential that you invest the time! Also, if you're only gonna use LaTeX for math equations, consider switching to Mathjax. Anki supports javascript, and it is easy to make Mathjax work with Anki. Let me know if you need any help with the integration. Pros (of Mathjax): Scalable equations. You can zoom in and out to your heart's content. Pixel perfect vertical alignment. Inline alignment of rendered images from LaTeX is a nightmare. Mathjax does it automatically for you! Faster workflow. Mathjax is responsive and equations are rendered almost instantly. (unlike compiling LaTeX tp pdf, cropping the pdf, finding out the baseline for alignment, rendering to image, padding the image for alignment and then copying the image to collection.media) Ability to render on mobile devices. Mathjax is just javascript :) Cons: Only math mode and the basic packages (like amsmath) are supported out of the box. Also, consider using a better font. I am using Open Sans (for text) and Source Code Pro (for code) at the moment, which are infinitely better than then Arial font Anki uses by default. 7 comments share save hide 83% Upvoted This thread is archived New comments cannot be posted and votes cannot be cast Sort by best best top new controversial old q&a level 1 wheres_

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

are often similar. For example, in a linear algebra book, many results begin by «Let U,V be two vector space and T a morphism from u to V». It is helpful not to have to retype it in each cards. <span>Definition In a definition card, there is usually three deletions. The first is the name of the defined object. The second is the notation of this object. The third one is the definition. If an object admits many equivalent definitions, all definitions appears on the same card. Each definition being a different cloze deletion. Indeed, if your card is «A square is ... » and you answer «A diamond with a 90° angle», you don't want to be wrong because it is written «A rectangle with two adjacent side of same length». Therefore, the card is: «{{c1::A square}} is: equivalently -{{c2::A diamond with a 90° angle}} or -{{c3::A rectangle with two adjacent side of same length}}» Beware, sometime it is better if the name and the notation belong to the same deletion. For example, if X is a subset of a vector space, it is easy to guess that «Aff(X)» is «the Affine

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

Definition In a definition card, there is usually three deletions. The first is the name of the defined object. The second is the notation of this object. The third one is the definition. If an object admits many equivalent definitions, all definitions appears on the same card. Each definition b

are often similar. For example, in a linear algebra book, many results begin by «Let U,V be two vector space and T a morphism from u to V». It is helpful not to have to retype it in each cards. <span>Definition In a definition card, there is usually three deletions. The first is the name of the defined object. The second is the notation of this object. The third one is the definition. If an object admits many equivalent definitions, all definitions appears on the same card. Each definition being a different cloze deletion. Indeed, if your card is «A square is ... » and you answer «A diamond with a 90° angle», you don't want to be wrong because it is written «A rectangle with two adjacent side of same length». Therefore, the card is: «{{c1::A square}} is: equivalently -{{c2::A diamond with a 90° angle}} or -{{c3::A rectangle with two adjacent side of same length}}» Beware, sometime it is better if the name and the notation belong to the same deletion. For example, if X is a subset of a vector space, it is easy to guess that «Aff(X)» is «the Affine

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

Definition In a definition card, there is usually three deletions. The first is the name of the defined object. The second is the notation of this object. The third one is the definition. If an object admits many equivalent definitions, all definitions appears on the same card. Each definition being a different cloze deletion. Indeed, if

are often similar. For example, in a linear algebra book, many results begin by «Let U,V be two vector space and T a morphism from u to V». It is helpful not to have to retype it in each cards. <span>Definition In a definition card, there is usually three deletions. The first is the name of the defined object. The second is the notation of this object. The third one is the definition. If an object admits many equivalent definitions, all definitions appears on the same card. Each definition being a different cloze deletion. Indeed, if your card is «A square is ... » and you answer «A diamond with a 90° angle», you don't want to be wrong because it is written «A rectangle with two adjacent side of same length». Therefore, the card is: «{{c1::A square}} is: equivalently -{{c2::A diamond with a 90° angle}} or -{{c3::A rectangle with two adjacent side of same length}}» Beware, sometime it is better if the name and the notation belong to the same deletion. For example, if X is a subset of a vector space, it is easy to guess that «Aff(X)» is «the Affine

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

Definition In a definition card, there is usually three deletions. The first is the name of the defined object. The second is the notation of this object. The third one is the definition. If an object admits many equivalent definitions, all definitions appears on the same card. Each definition being a different cloze deletion. Indeed, if your card is «A square is ... »

are often similar. For example, in a linear algebra book, many results begin by «Let U,V be two vector space and T a morphism from u to V». It is helpful not to have to retype it in each cards. <span>Definition In a definition card, there is usually three deletions. The first is the name of the defined object. The second is the notation of this object. The third one is the definition. If an object admits many equivalent definitions, all definitions appears on the same card. Each definition being a different cloze deletion. Indeed, if your card is «A square is ... » and you answer «A diamond with a 90° angle», you don't want to be wrong because it is written «A rectangle with two adjacent side of same length». Therefore, the card is: «{{c1::A square}} is: equivalently -{{c2::A diamond with a 90° angle}} or -{{c3::A rectangle with two adjacent side of same length}}» Beware, sometime it is better if the name and the notation belong to the same deletion. For example, if X is a subset of a vector space, it is easy to guess that «Aff(X)» is «the Affine

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

sually three deletions. The first is the name of the defined object. The second is the notation of this object. The third one is the definition. If an object admits many equivalent definitions, <span>all definitions appears on the same card. Each definition being a different cloze deletion. Indeed, if your card is «A square is ... » and you answer «A diamond with a 90° angle», you don't want to be wrong because it is written «A rectangle with two adjacent side of same len

are often similar. For example, in a linear algebra book, many results begin by «Let U,V be two vector space and T a morphism from u to V». It is helpful not to have to retype it in each cards. <span>Definition In a definition card, there is usually three deletions. The first is the name of the defined object. The second is the notation of this object. The third one is the definition. If an object admits many equivalent definitions, all definitions appears on the same card. Each definition being a different cloze deletion. Indeed, if your card is «A square is ... » and you answer «A diamond with a 90° angle», you don't want to be wrong because it is written «A rectangle with two adjacent side of same length». Therefore, the card is: «{{c1::A square}} is: equivalently -{{c2::A diamond with a 90° angle}} or -{{c3::A rectangle with two adjacent side of same length}}» Beware, sometime it is better if the name and the notation belong to the same deletion. For example, if X is a subset of a vector space, it is easy to guess that «Aff(X)» is «the Affine

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

ted «Aff(X)». What you really want is to recall that «the set of vectors of the form Sum of x_ir_i, with x_i\in X and r_i in the field, where the sum of the r_i is 1» is «the affine hull of X». <span>Theorem A theorem usually admits two deletions. Hypothesis and conclusion. It sometime admits a third deletion if the theorem has a classical name. For example you may want to remember that the theorem stating «In a right triangle, the square of the hypotenuse (the side opposite the right angle) is equal to the sum of the squares of the other two sides. » is called «the Pythagorean theorem». Beware, no hypothesis in a deletion should introduce an object. «If, ... , then the center of P is not trivial» is hard to understand, whereus «Let P be a group. If ..., then the center of P is non trivial» is more clear. Hypothesis A first important thing is to always write all hypothesis. Sometime, some hypothesis are given in the beginning of a chapter and are assumed to be true in the whole chapter.

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

Theorem A theorem usually admits two deletions. Hypothesis and conclusion. It sometime admits a third deletion if the theorem has a classical name. For example you may want to remember that the theorem stating «In a right

ted «Aff(X)». What you really want is to recall that «the set of vectors of the form Sum of x_ir_i, with x_i\in X and r_i in the field, where the sum of the r_i is 1» is «the affine hull of X». <span>Theorem A theorem usually admits two deletions. Hypothesis and conclusion. It sometime admits a third deletion if the theorem has a classical name. For example you may want to remember that the theorem stating «In a right triangle, the square of the hypotenuse (the side opposite the right angle) is equal to the sum of the squares of the other two sides. » is called «the Pythagorean theorem». Beware, no hypothesis in a deletion should introduce an object. «If, ... , then the center of P is not trivial» is hard to understand, whereus «Let P be a group. If ..., then the center of P is non trivial» is more clear. Hypothesis A first important thing is to always write all hypothesis. Sometime, some hypothesis are given in the beginning of a chapter and are assumed to be true in the whole chapter.

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

Theorem A theorem usually admits two deletions. Hypothesis and conclusion. It sometime admits a third deletion if the theorem has a classical name. For example you may want to remember that the theorem stating «In a right triangle, the square of the hypotenus

ted «Aff(X)». What you really want is to recall that «the set of vectors of the form Sum of x_ir_i, with x_i\in X and r_i in the field, where the sum of the r_i is 1» is «the affine hull of X». <span>Theorem A theorem usually admits two deletions. Hypothesis and conclusion. It sometime admits a third deletion if the theorem has a classical name. For example you may want to remember that the theorem stating «In a right triangle, the square of the hypotenuse (the side opposite the right angle) is equal to the sum of the squares of the other two sides. » is called «the Pythagorean theorem». Beware, no hypothesis in a deletion should introduce an object. «If, ... , then the center of P is not trivial» is hard to understand, whereus «Let P be a group. If ..., then the center of P is non trivial» is more clear. Hypothesis A first important thing is to always write all hypothesis. Sometime, some hypothesis are given in the beginning of a chapter and are assumed to be true in the whole chapter.

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

Theorem A theorem usually admits two deletions. Hypothesis and conclusion. It sometime admits a third deletion if the theorem has a classical name. For example you may want to remember that the theorem stating «In a right triangle, the square of the hypotenuse (the side opposite the right angle) is equal to the sum of the squares

ted «Aff(X)». What you really want is to recall that «the set of vectors of the form Sum of x_ir_i, with x_i\in X and r_i in the field, where the sum of the r_i is 1» is «the affine hull of X». <span>Theorem A theorem usually admits two deletions. Hypothesis and conclusion. It sometime admits a third deletion if the theorem has a classical name. For example you may want to remember that the theorem stating «In a right triangle, the square of the hypotenuse (the side opposite the right angle) is equal to the sum of the squares of the other two sides. » is called «the Pythagorean theorem». Beware, no hypothesis in a deletion should introduce an object. «If, ... , then the center of P is not trivial» is hard to understand, whereus «Let P be a group. If ..., then the center of P is non trivial» is more clear. Hypothesis A first important thing is to always write all hypothesis. Sometime, some hypothesis are given in the beginning of a chapter and are assumed to be true in the whole chapter.

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

) Tweet (102) Share (30) Save Capture of Google.com from The Internet Archive's Wayback machine on the evening of January 30th, 2018 during Donald Trump's SOTU address. The Internet Archive Afte<span>r earlier tweeting, deleting and re-posting unsupported claims that Google is "suppressing voices of Conservatives," this afternoon the President's personal Twitter account posted a new attack video. It claimed that the company failed to promote his State of the Union address with a link on its homepage after doing so for President Barack Obama, but several things about it don't hold up. In a statement to the media, Google explained that isn't quite true, since a President's first addres

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not read | reprioritisations | ||
---|---|---|---|---|

last reprioritisation on | reading queue position [%] | |||

started reading on | finished reading on |

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

DOM JS HTML Input JS HTML Objects JS HTML Events JS Browser JS Quiz JS Certificate JS References JavaScript Objects HTML DOM Objects JavaScript Where To ❮ Previous Next ❯ The <script> Tag <span>In HTML, JavaScript code must be inserted between <script> and </script> tags. Example <script> document.getElementById("demo").innerHTML = "My First JavaScript"; </script> Try it Yourself » Old JavaScript examples may use a type attribute: <script