Working left to right, we compute . Then by modular
exponentiation, , ,
, then (modulo )
Nov 02
Find the number of connected components of the Lie Group
This is the general linear group of degree 2, defined with multiplication on
This group has 2 components. One for the positive determinants and one for the
negative determinants. This is because the determinant on this set is continuous
so the inverse of an open set is open. The 2 components correspond to the
inverse images of and .
Nov 03
How many times do and intersect?
For this, we solve . From here, we can see the only real solutions
are so these graphs intersect 3 times.
Nov 04
Nov 05
What is the largest odd number that cannot be represented as the sum of three
primes?
We can show 5 is not the sum of 3 primes since the smallest such sum is
. Goldbach's weak conjecture states that every odd number greater than
5 is the sum of some 3 primes. This was proven by Harald Helfgott in 2013.
Nov 06
This very not to scale graph is a linear equation. Using the 2 points
, we can find the slope is . This can be
extended 1 more step to the right from to find y-intercept .
Alternatively, we can use point-slope form to find the line equation
which shows the y-intercept is .
Nov 07
Find the period of
The 12 does not change the period, only the amplitude. The period of
is . Multiplying the argument by something divides the period by
that amount. In this case, we would divide the period by and
find the period is .
Nov 08
Find the number of irreducible such that
and .
More generally, this is counting the number of pairs with
, , and . Suppose
. Then so this is equivalent to
counting pairs with . There are such pairs
which is always even for . Half of these pairs satisfy as
required so the solution is . For this problem, has
distinct prime factors so the solution is
Nov 09
This is a simple pythagorean theorem problem with
so .
Nov 10
Find the Frobenius number of the numerical semigroup generated by 4, 7, and 9.
These integers under addition generate the elements
. The Frobenius number is the largest
value such that has no solution. We can check numbers
individually to find that has no solution. Then
and any larger number number is 4 plus a
smaller number that has a solution.
Nov 11
Nov 12
How many rectangles can be formed from 1400 identical squares?
This is how many ways we can factor 1400 into integers. We can factor it into
and see that it has divisors.
Since 1400 is not a perfect square, each divisor below
corresponds to a divisor above so half of the number of divisors
is how many rectangles we can make. The solution is 12.
Nov 13
How many numbers can be formed using the digits 1, 2, and 3 such that two digits
are 1 or 2 and two wdigits are 2 or 3?
This can be solved with a few cases. If there are no 2's, then there must be
2 1's and 2 3's so there are 6 permutations of 1133. If there is one 2, there
must also be a 1 and 3 so there are 6 permutations of 123. If there are two 2's,
then no other digits are included so we count the single number 22. The solution
is .
Nov 14
An urn has 21 black balls and white balls with . The chance
that two balls chosen (with replacement) are the same mcolor is .
There are balls in total. The probability of 2 black is
. The probability of 2 white is .
The equation to solve is
Multiplying stuff gets . This can be combined and
common factors removed to get which factors to
. Therefore, the only integer solution is .
Nov 15
Find the sum of the x-intercept and the y-intercept of
The x-intercept is found by . The y-intercept is the 6.
The solution is .
Nov 16
This problem can be solved by using the geometric summation
By integration,
Clearly since the left is 0 when . So we have found
Then going back to the givens,
which matches our equation with . So we get
Then using the original instead of our from the derivation,
Nov 17
How many ways can be written as the sum of at least two consecutive
numbers.
Let be the first number in a sum of numbers. Then the sum is
Then we need this sum to be equal to for some starting integer
and integer .
Since is an integer, it is a divisor of . Then has
opposite parity of and we can solve for . So we must factor
into an odd and even number. This will always be the case since there is only a
single , it will onlyn be part of 1 factor. So since there are
divisors of , we can find a and in different
ways. We only have to exclude since it must be at least 2 consecutive
numbers. Therefore, the answer is 17. Each possible way corresponds to
numbers where and . The starting number is
Nov 18
A sphere of radius is inscribed in the tetrahedron with vertices
, , , and .
3 of the faces are on the main axis planes for the first octant
(). Since the sphere is tangent to each of these, its center must
be with radius . From this center point, we can make a line of
length to the point of tangency with the last plane, which will be normal
to that plane.
The non-axis plane is described by the 3 points other than the origin. The plane
can be described by for some . We can use those 3 points
to form the equations which gives us the plane equation:
From , we add a length vector in the direction of the plane's
normal vector to find a point on the plane. This gives us the point:
Next we put these 3 points into the equation for the plane and solve for
Nov 19
3 kg of 24 carat gold and 5 kg of 16 carat gold are melted to form a bar of
carat gold.
This is a weighted average
Nov 20
Multiplying the 2nd equation by , we have . So by the
first equation . Then substitute for and we solve the quadratic
So the only positive solution as required is .
Nov 21
How many seven digit binary numbers are there such that no two consecutive
digits are 0?
Seven digit binary numbers start with a 1 and are followed by a binary string
of length 6. So the answer is the number of binary strings of length 6 with no
consecutive 0. Let be the number of length binary strings with no
consecutive 0s. Then (for length 0 it is the empty string).
Then is computed recursively. If the first bit is 0, the 2nd bit must
be 1 and there are possible ways for the next bits. If the first bit
is 1, then there are possible ways for the next bits. This is exactly
the fibonacci sequence and we can find is the solution.
Nov 22
Find the average queue size (rounded) of an M/M/1 queue with arrival rate 22 and
service rate 23.
There is a lot of theory behind these queue models so this will probably not be
a very complete answer.
The M/M/1 queue is a stochastic model with a state space describing the number
of jobs in the queue. Arrivals are poisson distributed with mean
and service times are exponentially distributed with parameter so
they have mean . This says that every time unit, we expect about
22 processes to arrive and 23 to be completed.
Based on the Wikipedia
article, the value describes the queue utilization. The
model is stable when , when jobs are completed on average faster than
they arrive. The probability of the system being in state is .
This is a geometric distribution which has well-known results, but for the
purpose of adding more math to this solution, we can compute the average state
index with the following summation
Now visualize a grid of the values summed in the summmation
The summation sums by rows so instead we can write a summation by columns
So now substitute to find the average queue size
Nov 23
Find the number of weeks in 231840 minutes.
By factoring, we find . We divide out
for minutes in a day and for days in a
week. What remains in the factor
Nov 24
The 3 equations have a nice factorization if 1 is added to each side. We get
From the first 2 of these, divides both and so it
divides their GCD which is . Similarly, divides . Since
, the 3 cases are . If , then which
does not divide so it can't be that. If , then so we
find is a factor of but it is not a factor of so this case
does not work either. Finally, if , then . So
by multiplying the variables , we can confirm .
Therefore the solution is .
Nov 25
Alec lost of his money. He then gained of what he had
remaining, just breaking even.
By losing , Alec has where is the amount he started with.
From here, we solve the equation to find what he has
to gain to get back to .
Nov 26
Find the smallest positive integer such that the sum of and the next
consecutive numbers is a square number.
The sum is
The factors are so must have these same factors to make
this quantity a square. Therefore, .
Nov 27
It turns out there is actually no point in 3D space that simultaneously
satisfies all 3 of these equations. We can find a solution for which may
correspond to imaginary solutions. Start with the 2nd equation, multiply ,
then substitute the 3rd
Now square both sides of the 2nd equation and use some substitutions
Now if we substitute this into the equations, we get a new system in 2 variables
But by using the first 2 equations
Then we can use this to show that there are 2 solutions in complex 3D space that
satisfy all 3 equations simultaneously
Nov 28
66°114°152°x°
The 3 given angles are supplementary to angles
of measures respectively. These 3 angles are
interior to a convex quadrilateral so the remaining angle (which is
supplementary to ) is
. From here we find
Nov 29
A set of 5 positive integers has a median of 17 and mean of 13. Find the largest
possible value in the set.
For clarification, the word used is "set" is used but equal elements are
allowed. Describe the set by the 5 integers
where . From the mean, we know
Subtract so we have
Next subtract 2 since which shows
And finally since , we find the largest element is
So the largest possible value is 29. The solution set is 1,1,17,17,29.
Nov 30
x°
Consider the circumscribed circle around this regular hexagon. The angle
subtends an arc of since it is of the circle.
Therefore, , half of the arc measure.