!8: Catalog Factorial Calculator: 2011

Tuesday, December 27, 2011

Quantitative ability : trick - 101 factorial part 1

!±8± Quantitative ability : trick - 101 factorial part 1

This video contains tips and tricks in solving quantitative aptitude question involving factorial, divison theorem and finding remainder

Quantitative ability : trick - 101 factorial part 1

Babyshower Invites Save Vinturi Essential Decide Now

Saturday, December 24, 2011

Secret Game on Casio Calculators

!±8± Secret Game on Casio Calculators

This is a recently discovered hack/secret code you can enter in most Casio Scientific calculators to unlock a wicked hidden game! Check it out! Song is by The Square Waves. EP available on iTunes: itunes.apple.com

Secret Game on Casio Calculators

Korg Ea1 Purchase Catalog Brita Water Containers

Monday, November 14, 2011

The Monster Bot of the 21st Century

!±8± The Monster Bot of the 21st Century

We were cruising down a local highway, at about 80mph, in our super charged 0,000 sports car, with the top down.

Our white scarves were flapping in the breeze. The highway was four lanes on each side, and clear of all traffic. It was a newly constructed super highway. I had to do it. I put the "pedal to the metal", and pegged the speedometer at 150mph. What a rush that was. As we approached the top of a steep incline, the wheels on my sports car lifted off, and settled smoothly on the downside.

It felt as though we were flying for a moment, until, a large Steven Spielberg look-a-like monster, lumbering down the highway, loomed in front of us. I had to slow down very quickly to 75mph.

It was a strange looking monster. Its head slowly swayed back and forth, the long mechanical legs strutted like a chicken, sometimes limping first on the left then on the right.

Its head swayed left to right, and I could see a broad mechanical smile occasionally. The arms swayed as they would if it were on a power walk. We noticed a license plate hanging on its waddling tail. The plate read MONSTERBOT.

We were furious. This dumb looking monster was in our way. We wanted to pass it. We wanted be first on the highway.

I literally stood on the gas petal. The surge was very powerful as the speedometer was again pegged just past 150mph, the tachometer pointed like a magnet to 7000rpm. We were able to pull up along side, but we could not pass it. It just looked down at me and smiled a broad monster smile. What is this thing, I thought. Is it some mysterious, new, government experimental project?

My sports car was built to pass anything. It was the fastest most powerful sports car built to date. I backed off to 75mph and just watched the license plate sway. As long as this dumb looking monster
is in front of me, I will never enjoy the experience of being number one on this super highway again.

This silly story is fictional of course. It is my 21st century version of the old Tortoise and Hare tale.

The monster is Googlebot. As we all know, Googlebot is a machine that scans, (spiders), the Internet. This amazing invention searches endlessly for new information, i.e. new Websites, new web pages, new keywords/phrases, and new content. Since Googlebot is a machine, it can only "see" certain items. Those items are HTML code. It does not see the color white, or macro media.

Gurus of the 20th century have studied Googlebot for years to formulate their theories about how Googlebot's Algorithm* works.

*Algorithm, From Wikipedia, the free encyclopedia:

In mathematics, computing, linguistics, and related disciplines, an algorithm is a procedure (a finite set of well-defined instructions) for accomplishing some task which, given an initial state, will terminate in a defined end-state. The computational complexity and efficient implementation of the algorithm are important in computing, and this depends on suitable data structures.

From wikipedia.org:

Informally, the concept of an algorithm is often illustrated by the example of a recipe, although many algorithms are much more complex. Basically, an algorithm is a method, like a recipe, in that by following the steps of an algorithm you are guaranteed to find the solution or the answer, if there is one. Algorithms often have steps that repeat (iterate) or require decisions (such as logic or comparison). Algorithms can be composed to create more complex algorithms.

The concept of an algorithm originated as a means of recording procedures for solving mathematical problems such as finding the common divisor of two numbers or multiplying two numbers. The concept was formalized in 1936 through Alan Turing's Turing machines and Alonzo Church's lambda calculus, which in turn formed the foundation of computer science.

Most algorithms can be directly implemented by computer programs; any other algorithms can at least in theory be simulated by computer programs. In many programming languages, algorithms are implemented as functions or procedures. Algorithms can be expressed in many kinds of notation . . . For example, Boolos-Burgess-Jeffrey (2002) (p. 26) give examples of Turing machine programs written as "machine tables" (see more at Turing machine, finite state machine, state transition table), as "flow charts" (see more at state diagram), or as a form of rudimentary machine code or assembly code called "sets of quadruples" (see more at Turing machine). They give a more detailed outline of their "multiplication machine" . . . portions of which are labeled with short natural-language descriptions.

Side Note:

This is getting very deep. But, I like abstract, creative thought. I did get straight A's in calculus at the University of Arizona. The other courses I took were boring so I quit the University of Arizona and joined the Navy.

My SEO theory for the 21st Century is based on Alan Turing's Turing machines and Alonzo Church's lambda calculus.

Choice of machine model: ( Again from Wikipedia )

This problem has not been resolved by the mathematics community. There is no "best", or "preferred" model. The Turing machine, while considered the sine qua non* --the indispensable, the ultimate fall-back -- is notoriously opaque when confronted face-to-face. And different problems seem to require different models to study them. Many researchers have observed these problems, for example:

*Latin legal term for "without which it could not be"

The principal purpose of this paper is to offer a theory which is closely related to Turing's but is more economical in the basic operations" (Wang (1954) p. 63)

Enough ground work. Here is my theory based on the turing machine model.

I maintain that Googlebot's Algorithm is a mathematical formula based on the permutation calculation, where a x b x c x d . . . X n = total possibilities.

Those possibilities are based on best practices SEO, and not in any particular order of importance. ALL these considerations are IMPORTANT:

(1) The monster's head motion (website content)

(2) The long mechanical legs (alt tags)

(3) The monster's limping sometimes left then right (quality relevant external incoming and outgoing links and internal links)

(4) Its head swaying left to right. (Site's opening paragraph flowing smoothly and laden with keywords/phrases)

(5) Its broad mechanical smile (changing content)

(6) Its arms swaying (site map, verification, and robot text File)

Here is my assumption. Using these requirements at a minimum, (there may be more), excellent position in all search engines can be achieved for highly competitive, critical keyword/phrases.

Applying this theory to our site, we have successfully achieved top position for our own critical keywords, and for our clients. The issue is that TRUE SEO is an ART, not only a science, based
on a mathematical formula.

Therefore, to permanently optimize a website for top position, a personalized approach is needed. I have a really important and bold statement I am about to make.Some SOFTWARE used for SEO will succeed sometimes, not all the time.

Why?

Because it is chasing a machine's algorithm that changes frequently.

The frequency of that change is, assuming a permutation* calculation of 6 X 5 X 4 X 3 X 2 X 1 = 720 / 5 X 4 X 3 X 2 X 1 = 6

From:

http://mathforum.org/dr.math/

*For four-letter permutations, there are 10 possibilities for the first letter, 9 for the second, 8 for the third, and 7 for the last letter. We can find the total number of different four-letter permutations by multiplying 10 x 9 x 8 x 7 = 5040. This is part of a factorial.

To arrive at 10 x 9 x 8 x 7, we need to divide 10 factorial (10 because there are ten objects) by (10-4) factorial (subtracting from the total number of objects from which we're
choosing the number of objects in each permutation). You can see below that we can divide the numerator by 6 x 5 x 4 x 3 x 2 x 1:

10! 10! 10 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1

10_P_4 = ------- = ---- = --------------------------------------

(10 - 4)! 6! 6 x 5 x 4 x 3 x 2 x 1

= 10 x 9 x 8 x 7 = 5040

From this we can see that the more general formula for finding the number of permutations of size k taken from n objects is:

n_P_k = --------

(n - k)!

If items 1 through 6 above were the only considerations, Google's algorithm could change several times in a specified period. If that time period were 30 days, those changes could occur about 6 times per MONTH. You will NEVER pass the hypothetical monster permanently. You will never be number one permanently, unless you use best practices SEO consistently like we do. Otherwise, you will always be chasing the monster and never passing it.

The gurus of the twentieth century are always discussing the Google algorithm. All of them are trying to second-guess were the next emphasis will be. Is it content, is it linking? is it . . ?

Don't chase the machine, cruise behind it like we do. Use best practices SEO all the time. No matter what Googlebot is smiling at you for, you will always be prepared to smile back and . . .

Enjoy the ride.

The Monster Bot of the 21st Century

Elliptical Trainer Workout Programs On Sale Promotions Roadtrek Ss Shop Cool Mist Humidifier Vicks

Wednesday, August 17, 2011

TI-83 Basic tutorial

!±8± TI-83 Basic tutorial

This video provides a brief overview of the functionality of the TI-83 graphing calculator. The TI-84 works almost exactly the same thing. Please note: In the video, I say "the" identity matrix, but matrix "a" unit can be a better choice of words would be.

TI-83 Basic tutorial

Garden Hose Connect Get It Now! Low Price Polycarbonate Sheeting

Tuesday, August 9, 2011

Statistical Software with Six Sigma

!±8± Statistical Software with Six Sigma

Six Sigma is about numbers. Six Sigma produces a stream of data about the processes that are critical to your success. If you do not measure and understand what is measured, you can not manage. Six Sigma is the clear strength is a data-driven analysis and decision making - not someone's opinion or instinct.

The value of statistical analysis can not be underestimated. By analyzing all these data, one begins to understand the process and the developmentTo identify and implement ways to improve the best solutions for the process. Statistical analysis of data shows the main areas that can have a negative effect on product quality, if not controlled. After identifying these key areas, you can focus your efforts on process improvement

Given the importance of intelligent management of all these data, it is necessary to find an efficient and powerful crunching the numbers. Obviously you want to avoid the hassle of manualCalculations and save a lot of time using statistical software application. One might be tempted to Excel or another spreadsheet program as a calculator and a database in order to use the statistical process control data storage. However, you will soon discover that a basic spreadsheet too cumbersome for the volume and complexity of data management and analysis you need to run a Six Sigma project is managed.

The advanced statistical software such as Minitab(Http: / / www.minitab.com/) or Statgraphics (http://statgraphics.com), are very useful, although not necessarily collected for the collection, categorization, assessment and data analysis during a Six Sigma project. Both Minitab and Statgraphics are powerful and independent complete statistical process control application software for performing statistical analysis. Both can be highly recommended for Six Sigma, as tools that allow you to use one of the biggest advantages of six sigma are: the ability toto make better decisions, based on data. You will work with the DMAIC Define-Measure-Analysis-Improve-Control and Lean Six Sigma.

Both Minitab and Statgraphics philosophy Six Sigma offers a range of tools to support the graphical analysis, collecting powerful statistics, quality research with the potential for a number of customized applications.

Statistical process control charts

Analysis of variance and regression

DesignExperiments

Matrix and factorial plots

The relationships between the variables

Life Data Analysis and Reliability

Process Capability

Hypothesis testing

Correlation and regression

Time Series Analysis and Forecasting

Measurement Systems Analysis

Regression analysis

Multi-variation analysis

ANOVA tools and techniques

Evaluation of the Six Sigma quality

Both applications offer near real-time statistical data,so you can react quickly to prevent further damage. The statistical analysis has identified key areas for process improvement are at the center, which may adversely affect product quality, if not controlled.

But while it's easy to purchase a statistical software, it is difficult to use effectively. And 'the intelligent analysis of data that create real change. Too often gather for Six Sigma / DMAIC teams and loading data into Minitab or Statgraphics onlyfind themselves overwhelmed by the prospect, where to start and how to use their new tool to analyze their data successfully, which is not only answers, but answers meaningful and useful. As a result, Six Sigma / DMAIC are often far below the expectations of productivity associated with statistical software.

Training in the use of Minitab is often associated with Six Sigma training is integrated offering. Minitab training will focus on solving practical problems with Minitab. Thisincludes learning the practical aspects of the main statistical tools such as control charts, capability, regression and ANOVA. There is a strong emphasis on learning how to get the data into Minitab learn to manipulate the data once in Minitab, and to learn the main results from the data graphically. Proper training can learn to drive like a professional and therefore more Minitab statistical power for your Six Sigma projects.

Statistical Software with Six Sigma

Leaf Blower Gas This Instant

Saturday, August 6, 2011

A card game refutes evolution

!±8± A card game refutes evolution

You are responsible for a walk and happened to find a card game from the side of the road. Browse the boards and I noticed that they are all in numerical order by color.

In other words, the diamonds are of the order of 2 to 10 and Jack Ass and the same goes for the other three seeds. Who have placed in your hands a card game at full scale in all four colors.

You say to yourself: "What a coincidence for some dazzling array a deck and the cards were allplanner in perfect order. "In fact, you are so amazed that when you get home you try to calculate the odds of a 52-card directly through the mixing of a color card game over and over again.

What are the odds that the first card in a shuffled deck is off again, the two diamonds? It 's simple, is 1 in 52

And if you get the card to come first, what is the probability that the second card is the 3 of diamonds? Although this is simple, there is a possibility in 51 of the newlythe first two cards in the correct order would be 1 in 52 x 51, 1 in 2652 would be the same.

This reveals that the number of possible combinations of 52 cards what your math teacher, "52 factorial", which is called 52, is the expression x 51 x 50 x 49 x 48 x 47 x 46 ... x 3 x 2 x 1 You will receive your computer and find that the sum is equal to a factor of more than 52 8.07 x 10-67 Power!

Think about how big this number is. Scientists estimate that the number of atoms inThe Milky Way is only 1 x Power 10-65. The number of possible combinations of cards in a standard 52 card is almost a thousand times greater than the number of atoms in the Milky Way!

Now we get to see if we have a mix of 52-card decks to random Straight Flush can. If we put all six and a half billion people on earth to work decks of cards shuffling and shuffle the cards in packs of one million per second and bridges, we used15000000000 years have they had for less than a tenth of a percent chance of 52 cards with a straight flush in a deck at the end of this 15 billion years!

They therefore concluded that the deck of cards royal flush, you have come as no accident, but from a human or other intelligent designer deliberately arranged the cards were arranged in this order.

What does the little card game example has to do with evolution? We can use itillustrate the probability of occurrence of a small step in evolution.

The putative mechanism of evolution is a genetic mutation. Mutations are mistakes in DNA copying. The DNA molecule is composed of millions of pairs of nucleotide bases in a precise sequence are arranged neatly. You can think of DNA as a card game and the base pairs, such as individual cards in the deck.

A mutation maps or some mix of base pairs. If the mutation mutilated or disorganized mixdesign information in the DNA, the offspring will be deformed or even die.

Evolutionists claim that random mutations of the pairs of nucleotide bases in the DNA of living organisms to cause favorable changes in body structure. Evolutionists claim that the accumulation of these changes has created new ways and also form new orders and new strains of living organisms.

However, even evolutionists acknowledge that the vast majority of mutations are harmful orNeutral.

Take the opportunity to examine the probability of evolution is not driven to produce a humble ordinary woodpecker. The woodpecker is different from other birds to have a heavier beak, a very thick skull, the cartilage thickness behind the bill as a shock, a tongue longer and to act incredible ... a flap of skin around the top of the head as a storage bag for the long tongue action!

The evolutionist says that those who have developed unique characteristics woodpeckera common bird through the accumulation of random rearrangements of base pairs of DNA. (I should point out, that the number of base pairs need to be refurbished would probably have been much greater than 52 years, if you get my drift!)

In addition, he had a list of unique features woodpecker (long tongue, housing, beak heavy, thick skulls, etc.) to develop in tandem. In other words, if a mutation has a common bird there is a stretch, but not custody, in whichsave the language, which would not be an advantage! Die of this bird and its mutation would, from the gene pool.

The ordinary bird on his way, he should develop into a woodpecker in favor of a mutation to offer incredibly large number of woodpeckers have all at once.

Human DNA contains more than one billion base pairs. If we assume that a bird is only half as many, or 500 million base pairs, as many of these base pairs would be transformed into accurate parent mustSequence of the skull, beak, tongue, redesign and add a language, a storage bag in the proximity of operating woodpeckers do?

I would like to care that would have about 52,000 base pairs are arranged exactly new.

We saw in our presentation of the card game incredibly high number of possible sequences of just 52 cards. How can we even begin to the number of possible sequences of 52,000 base pairs of calculation? Moreover, that genetic mutations are rare, and a mutationeven a single base pair out of place is not only harmful but deadly.

Any objective analysis will probably show that an unguided random mixing requirements of 52,000 base pairs, a redesign of the skull of a bird would be a low probability of success, it would be absurd. Evolutionists usually try a similar statement, saying that such a change would not happen to refute with a large mutation.

They claim that requires a lot of small mutations in a single stepStep incrementally with relatively few base pairs at each step.

An evolutionist would probably say that a mutation that would be only 52 base pairs mixed a small mutation. Evolutionists would say that a set of 1,000 mutations are sufficient for about 52 base pairs each of which would be to make a bird skull again.

I would counter that, although each new mutations accumulate only 52 base pairs in each of the 1,000 small mutation steps exactly on a total of 52,000new base pairs, would be an absurdly low probability of random mutations, a sparrow to transform into a woodpecker. Our card game figure above shows the number of possible sequences shockingly high of only 52 base pairs. Imagine the possibilities of the new 52 base pairs arranged in each of 1,000 different mutations!

This shows that there was a woodpecker or complex life forms to develop random processes in a trillion years! This is just one of many obvious shortcomings inthe theory of evolution.

Evolution is the creation myth of atheistic materialism. And 'taught in our taxpayer-funded schools. Evolution is taught as a process "unguided" atheistic. This promotes atheism and undermines the confidence of students. And 'now that the children not only the errors of evolution, but also the need of the Creator be taught .*

* Some of the material in the article above is from a blog by "Jim in Vermont," l '"evolution vs. intelligentDesign "debate yahoogroups.com group.