Mathematical Theories

-
Number of Perfect Squares in Range
Every natural number has a unique square.
So the number of perfect squares between 1 and x would be equal to the biggest positive integer k whose square would be less than/equal to x.
k = floor of square root of x.
Eulerian Path

An Eulerian path on a graph is a traversal of the graph that passes through each edge exactly once. It is an Eulerian circuit if it starts and ends at the same vertex.

 Theory for being Eulerian Path:

 If a graph admits an Eulerian path, then there are either  or  vertices with odd degree. If a graph admits an Eulerian circuit, then there are  vertices with odd degree.

Hamiltonian Path

A Hamiltonian path is a traversal of a (finite) graph that touches each vertex exactly once. If the start and end of the path are neighbors (i.e. share a common edge), the path can be extended to a cycle called a Hamiltonian cycle.

 Theory for Hamiltonian Cycle
Dirac: A simple graph (one without multiple edges between any pair of vertices, and with no edges that begin and end with the same vertex) on  vertices has a Hamiltonian cycle if every vertex has degree at least .
Ore: A graph on  vertices with the property that any two non-adjacent vertices have degrees summing to  has a Hamiltonian cycle.
Bondy-Chvatal: A graph has a Hamiltonian cycle if and only if its closure has a Hamiltonian cycle.

Note: A simple graph is a graph such that any two distinct vertices have at most one edge between them, and there are no loops (edges that start and end at the same vertex).


Stars and Bars Theorem

The number of ways to place  indistinguishable balls into  labelled urns is


Note: We represent the  balls by  adjacent stars and consider inserting  bars in between stars to separate the bars into  groups


Pascal's triangle

Pascal's triangle is a triangular array constructed by summing adjacent elements in preceding rows. Pascal's triangle contains the values of the binomial coefficient. 


each  row in Pascal's triangle contains  elements.

Let  be the  element in the  row of Pascal's triangle, with . Then, 
The  row of Pascal's triangle contains the coefficients of the expanded polynomial .
The sum of the elements in the n-th row of Pascal's triangle is equal to .
This is a way to express the identity


Geometry

Triangle:

right triangle properties:

sides of triangle -> angles 

3x,4x,5x
x,x√3,2x -> 30,60,90
x,x,2x -> 45,45,90

 The area of a n equilateral triangle = s² x (√3/4)

 The area  of a square = d² x (1/2)  or s²

 Identify Similar Triangles

 SSS (side-side-side), 
SAS (side-angle-side), and 
AAA (angle-angle-angle), to prove that two triangles are similar

Division of Line Segment
Now, by construction, the triangles PQS and PRT are similar; hence, 

PS/PT = QS/RT = PQ/PR 
http://www.math-only-math.com/division-of-line-segment.html
This is for personal study. Details explanation are available in brilliant.org with examples and practice problems.

Comments

Post a Comment

Popular posts from this blog

Thread & Locks

-
Image
Threads Threads are subunits of processes, which can be scheduled independently by the operating system scheduler. Multiple threads can be executed at the same time on a single CPU core. The operating system assigns small slices of computing time to each thread, so that it seems to the user as if multiple tasks are executed at the same time. If multiple CPU cores are available, then multiple threads can be executed truly in parallel. We can either use the POSIX thread API, or the Objective-C wrapper around this API, NSThread. NSThread is a simple Objective-C wrapper around pthreads. Grand Central Dispatch With GCD you don’t interact with threads directly anymore. Instead you add blocks of code to queues, and GCD manages a thread pool behind the scenes. GCD decides on which particular thread your code blocks are going to be executed on, and it manages these threads according to the available system resources. This alleviates the problem of too many threads being cre
Read more

Opengl-es Buffer

-
Image
Framebuffer A  Framebuffer  is a collection of buffers that can be used as the destination for rendering. OpenGL has two kinds of framebuffers: the  Default Framebuffer , which is provided by the  OpenGL Context ; and user-created framebuffers called  Framebuffer Objects  (FBOs). The buffers for default framebuffers are part of the context and usually represent a window or display device. The buffers for FBOs reference images from either  Textures  or  Renderbuffers ; they are never directly visible. Default Framebuffer The Default Framebuffer is the Framebuffer that OpenGL is created with. It is created along with the OpenGL Context. Like Framebuffer Objects , the default framebuffer is a series of images. Unlike FBOs, one of these images usually represents what you actually see on some part of your screen. Framebuffer Object FBO contains a collection of rendering destinations; color, depth and stencil buffer. These logical buffers in a FBO are called framebuffer-attachab
Read more

Opengl Stages of Vertex Transformation

-
Image
Stages of Vertex Transformation Required to render the desired scene of a 3d world in a 2d screen Object Coordinates : local coordinate system of object before any transformation is applied. Eye coordinates : the result of multiplication of GL_MODELVIEW matrix and object coordinates. Objects are transformed from object space to eye space. M(ModelView) = M(view). M(model) where M(model) = object space to world space and M(view) = world space to eye space. Clip coordinates : the result of multiplication of GL_PROJECTION matrix and eye coordinates. GL_PROJECTION matrix used to define the frustum. It determined hot the 3D scene is projected onto the screen. NDC : Perspective division which is yielded by dividing the clip coordinates by w. Window coordinates : NDC are scaled and translated in order to fit into the rendering screen. Analogy With a Camera Transformations : Viewing Transformation : Setting up tripod and pointing the camera at the scene.
Read more