# Search Results (6)

View
Selected filters:
• Divisibility
Conditions of Use:
Remix and Share
Rating

This course is an elementary introduction to number theory with no algebraic ...

This course is an elementary introduction to number theory with no algebraic prerequisites. Topics covered include primes, congruences, quadratic reciprocity, diophantine equations, irrational numbers, continued fractions, and partitions.&nbsp; &nbsp;

Subject:
Mathematics
Material Type:
Full Course
Textbook
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Abhinav Kumar
Conditions of Use:
Remix and Share
Rating

This pre-algebra lesson works several examples of common divisibility.

Subject:
Algebra
Material Type:
Lecture
Provider:
Khan Academy
Provider Set:
Khan Academy
Author:
Khan, Salman
Conditions of Use:
Remix and Share
Rating

This video looks at example of Sal working on KA Divisibility Module: ...

This video looks at example of Sal working on KA Divisibility Module: http://www.khanacademy.org/math/arithmetic/factors-multiples/e/divisibility_intuition

Subject:
Algebra
Material Type:
Lecture
Provider:
Khan Academy
Provider Set:
Khan Academy
Author:
Sal Khan
Conditions of Use:
Remix and Share
Rating

This lessons presents approaches for determining whether a number is divisible by ...

This lessons presents approaches for determining whether a number is divisible by another number.

Subject:
Algebra
Material Type:
Lecture
Provider:
Khan Academy
Provider Set:
Khan Academy
Author:
Khan, Salman
Conditions of Use:
Remix and Share
Rating

This lessons presents approaches for determining whether a number is divisible by ...

This lessons presents approaches for determining whether a number is divisible by another number. [Developmental Math playlist: Lesson 50 of 196]

Subject:
Numbers and Operations
Material Type:
Lecture
Provider:
Khan Academy
Provider Set:
Khan Academy
Author:
Khan, Salman
Conditions of Use:
Read the Fine Print
Rating

This course describes discrete mathematics, which involves processes that consist of sequences ...

This course describes discrete mathematics, which involves processes that consist of sequences of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. Upon successful completion of this course, the student will be able to: Create compound statements, expressed in mathematical symbols or in English, to determine the truth or falseness of compound statements and to use the rules of inference to prove a conclusion statement from hypothesis statements by applying the rules of propositional and predicate calculus logic; Prove mathematical statements involving numbers by applying various proof methods, which are based on the rules of inference from logic; Prove the validity of sequences and series and the correctness or repeated processes by applying mathematical induction; Define and identify the terms, rules, and properties of set theory and use these as tools to support problem solving and reasoning in applications of logic, functions, number theory, sequences, counting, probability, trees and graphs, and automata; Calculate probabilities and apply counting rules; Solve recursive problems by applying knowledge of recursive sequences; Create graphs and trees to represent and help prove or disprove statements, make decisions or select from alternative choices to calculate probabilities, to document derivation steps, or to solve problems; Construct and analyze finite state automata, formal languages, and regular expressions. (Computer Science 202)

Subject:
Computer Science
Material Type:
Full Course
Provider:
The Saylor Foundation