This is a simple problem based on combinatorics which can be easily tackled by using inclusion-exclusion principle.
We are asked to find number of positive integers less than 1,000,000 that are not divisible by 6 or 4.
let n be the number of positive integers.
∴ 1≤n≤999,999
Let c₁ be the set of numbers divisible by 6 and c₂ be the set of numbers divisible by 4.
Let N(c₁) be the number of elements in set c₁ and N(c₂) be the number of elements in set c₂.
∴N(c₁) =

N(c₂) =

∴N(c₁c₂) =

∴ Number of positive integers that are not divisible by 4 or 6,
N(c₁`c₂`) = 999,999 - (166666+250000) + 41667 = 625000
Therefore, 625000 integers are not divisible by 6 or 4
Answer:
The Pythagorean identity states that

Using that we can rewrite the left denominator as:

Which can be factored as

The numerator we can expand as:

On the right hand side, let's multply numerator and denominator with (1 - sin t):
The total formula then becomes:

There you go... left and right are equal.
Counting by Tens with numbers
10, 20, 30, 40, 50, 60, 70, 80, 90
Counting by Tens with words
ten, twenty, thirty, forty, fifty, sixty, seventy, eighty, ninety, one hundred
Number Patterns when counting by Tens
When you count by tens the numbers create a pattern. All the numbers end with a zero. The first digits are just like the numbers when you count (1, 2, 3, 4, 5, etc.). This pattern gives the numbers 10, 20, 30, 40, 50, etc.
found from: http://www.aaamath.com/k4c_cox1.htm
Answer:

Step-by-step explanation:
Let x be equal to the number.
We can use what the question gives us to directly form a mathematical statement. When you multiply it by 3 (3x) and then subtract 10 (3x-10) you will get a number less than 5 (<5). Using this, our mathematical statement would look like this:

To find the range of possible values, we must solve the inequality and isolate x.

Add 10 to both sides

Divide both sides by 3

I hope this helps!