Math Calendar 2024 November

November
MoTuWeThFrSaSu
01 02 03
04 05 06 07 08 09 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30
 

Nov 01

12345678910mod11

Working left to right, we compute 1234567895mod11. Then by modular exponentiation, 523mod11, 542mod11, 584mod11, then (modulo 11) 12345678910510525834121

Nov 02

Find the number of connected components of the Lie Group GL(2,R)

This is the general linear group of degree 2, defined with multiplication on {A=(abcd):(A)=adbc0} 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 (0,) and (,0).

Nov 03

How many times do y=x and y=x11 intersect?

For this, we solve x=x11x11x=0x(x101)=0x(x5+1)(x51)=0. From here, we can see the only real solutions are x=0,1,1 so these graphs intersect 3 times.

Nov 04

((i+1)(i1))2=(i21)2=(11)2=(2)2=4

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 2+2+2. 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

(-1,3) -2 What is the y-intercept?

This very not to scale graph is a linear equation. Using the 2 points (2,0),(1,3), we can find the slope is 301(2)=3. This can be extended 1 more step to the right from (1,3) to find y-intercept 6. Alternatively, we can use point-slope form to find the line equation y3=3(x(1))y=3x+6 which shows the y-intercept is 6.

Nov 07

Find the period of 12sin(2πx7)

The 12 does not change the period, only the amplitude. The period of sin(x) is 2π. Multiplying the argument x by something divides the period by that amount. In this case, we would divide the period by 2π7 and find the period is 7.

Nov 08

Find the number of irreducible ab<1 such that a,bN and a+b=40.

More generally, this is counting the number of pairs (a,b) with 0<a<b, gcd(a,b)=1, and a+b=N. Suppose gcd(a,b)=gcd(a,Na)=1. Then gcd(a,N)=1 so this is equivalent to counting (a,b) pairs with gcd(a,N)=1. There are ϕ(N) such pairs which is always even for N>2. Half of these pairs satisfy a<b as required so the solution is ϕ(N)/2. For this problem, N=40 has distinct prime factors 2,5 so the solution is 12401245=8

Nov 09

x 41 40

This is a simple pythagorean theorem problem with x2=412402=16811600=81 so x=81=9.

Nov 10

Find the Frobenius number of the numerical semigroup generated by 4, 7, and 9.

These integers under addition generate the elements {4a+7b+9ca,b,cN}. The Frobenius number is the largest value n such that 4a+7b+9c=n has no solution. We can check numbers individually to find that n=10 has no solution. Then 11=4+7,12=4+4+4,13=4+9,14=7+7 and any larger number number is 4 plus a smaller number that has a solution.

Nov 11

01(21x2+4)dx=[7x3+4x]01=7+4=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 1400=23527 and see that it has 432=24 divisors. Since 1400 is not a perfect square, each divisor below 1400 corresponds to a divisor above 1400 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 6+6+1=13.

Nov 14

An urn has 21 black balls and x white balls with x<21. The chance that two balls chosen (with replacement) are the same mcolor is 52%.

There are 21+x balls in total. The probability of 2 black is 212(21+x)2. The probability of 2 white is x2(21+x)2. The equation to solve is 212+x2(21+x)2=52100=1325 Multiplying stuff gets 11025+25x2=13x2+546x+5733. This can be combined and common factors removed to get 2x291x+882=0 which factors to (2x63)(x14)=0. Therefore, the only integer solution is x=14.

Nov 15

Find the sum of the x-intercept and the y-intercept of y=23x+6

The x-intercept is found by y=0x=9. The y-intercept is the 6. The solution is 9+6=15.

Nov 16

t=n=11n2n2,x=et

This problem can be solved by using the geometric summation f(x)=1+x+x2+=11x By integration, (1+x+x2+)=dx1x x+x22+x33+=ln|1x|+C Clearly C=0 since the left is 0 when x=0. So we have found n=1xnn=ln|1x| Then going back to the givens, t4=n=11n(12)n which matches our equation with x=12. So we get t=4ln|112|=4ln(12)=4ln(2) Then using the original x instead of our x from the derivation, x=et=e4ln(2)=24=16

Nov 17

How many ways can 1225 be written as the sum of at least two consecutive numbers.

Let x be the first number in a sum of k numbers. Then the sum is x+(x+1)+(x+2)++(x+k1)=kx+(k1)k2 Then we need this sum to be equal to 1225 for some starting integer x and integer k2. 1225=kx+(k1)k22450=2kx+(k1)kk(2x+k1)=25272 Since k is an integer, it is a divisor of 2450. Then 2x+k1 has opposite parity of k and we can solve for x. So we must factor 2450 into an odd and even number. This will always be the case since there is only a single 2, it will onlyn be part of 1 factor. So since there are 18 divisors of 2450, we can find a k and 2x+k1 in 18 different ways. We only have to exclude k=1 since it must be at least 2 consecutive numbers. Therefore, the answer is 17. Each possible way corresponds to k numbers where k>1 and k2450. The starting number is x=12(2450k+1k)

Nov 18

A sphere of radius x is inscribed in the tetrahedron with vertices (162,0,0), (0,108,0), (0,0,54), and (0,0,0).

3 of the faces are on the main axis planes for the first octant (x,y,z0). Since the sphere is tangent to each of these, its center must be (r,r,r) with radius r. From this center point, we can make a line of length r 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 ax+by+cz=1 for some a,b,c. We can use those 3 points to form the equations 162a=1,108b=1,54c=1 which gives us the plane equation: 1162x+1108y+154z=12x+3y+6z=324 From (r,r,r), we add a length r vector in the direction of the plane's normal vector (2,3,6) to find a point on the plane. This gives us the point: (r,r,r)+r(2,3,6)(2,3,6)=(r,r,r)+r(27,37,67)=r(97,107,137) Next we put these 3 points into the equation for the plane and solve for r 297r+3107r+6137r=32418+30+787r=3241267r=32418r=324r=18

Nov 19

3 kg of 24 carat gold and 5 kg of 16 carat gold are melted to form a bar of x carat gold.

This is a weighted average 3824+5816=9+10=19

Nov 20

xy=10,1y1x=120,x>0

Multiplying the 2nd equation by xy, we have xy=xy20. So by the first equation xy=200. Then substitute for y and we solve the quadratic x(x10)=200x210x200=0(x+10)(x20)=0 So the only positive solution as required is x=20,y=10.

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 C(n) be the number of length n binary strings with no consecutive 0s. Then C(0)=1,C(1)=2 (for length 0 it is the empty string). Then C(n) is computed recursively. If the first bit is 0, the 2nd bit must be 1 and there are C(n2) possible ways for the next bits. If the first bit is 1, then there are C(n1) possible ways for the next bits. This is exactly the fibonacci sequence and we can find C(6)=21 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 λ=22 and service times are exponentially distributed with parameter μ=23 so they have mean 1/μ=1/23. 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 p=λ/μ=22/23 describes the queue utilization. The model is stable when p<1, when jobs are completed on average faster than they arrive. The probability of the system being in state i is (1p)pi. 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 i=0i(1p)pi=(1p)i=1ipi Now visualize a grid of the values summed in the summmation pp2p2p3p3p3 The summation sums by rows so instead we can write a summation by columns (1p)i=1pi(1+p+p2+)=(1p)i=1pi11p=i=1pi=p1p So now substitute p to find the average queue size p1p=22/23122/23=22/231/23=22

Nov 23

Find the number of weeks in 231840 minutes.

By factoring, we find 25325723. We divide out 6024=25325 for minutes in a day and 7 for days in a week. What remains in the factor 23

Nov 24

x,y,z,wZ+xyzw=8!xy+x+y=524yz+y+z=146zw+z+w=104

The 3 equations have a nice factorization if 1 is added to each side. We get (x+1)(y+1)=525=3557(y+1)(z+1)=147=377(z+1)(w+1)=105=357 From the first 2 of these, y+1 divides both 525 and 147 so it divides their GCD which is 21. Similarly, z+1 divides 21. Since y>0, the 3 cases are y+1=3,7,21. If y+1=3, then z+1=49 which does not divide 21 so it can't be that. If y+1=7, then x+1=75 so we find 37 is a factor of x but it is not a factor of 8! so this case does not work either. Finally, if y+1=21, then z+1=7,x+1=25,w+1=15. So by multiplying the variables x=24,y=20,z=6,w=14, we can confirm xyzw=8!. Therefore the solution is x=24.

Nov 25

Alec lost 20% of his money. He then gained x% of what he had remaining, just breaking even.

By losing 20%, Alec has 0.8M where M is the amount he started with. From here, we solve the equation 0.8M(1+x/100)=M to find what % he has to gain to get back to M. 0.8M(1+x/100)=M1+x/100=1.25x=25

Nov 26

Find the smallest positive integer x such that the sum of x and the next 50 consecutive numbers is a square number.

The sum is x+(x+1)+(x+2)++(x+50)=51x+50512=51(x+25) The factors are 51=317 so x+25 must have these same factors to make this quantity a square. Therefore, x+25=51x=26.

Nov 27

x2+y2+z2=1296x+y+z=72x2=yz

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 x which may correspond to imaginary solutions. Start with the 2nd equation, multiply x, then substitute the 3rd x2+xy+xz=72xyz+xy+xz=72x Now square both sides of the 2nd equation and use some substitutions x2+y2+z2+2xy+2xz+2yz=7221296+2(xy+xz+yz)=722362+2(72x)=722144x=3362x=27 Now if we substitute this into the equations, we get a new system in 2 variables y2+z2=567y+z=45yz=729 But by using the first 2 equations y2+(45y)2=567y245y+729=0y=45±9112 Then we can use this to show that there are 2 solutions in complex 3D space that satisfy all 3 equations simultaneously x=24,y=45+9112,z=459112x=24,y=459112,z=45+9112

Nov 28

66° 114° 152°

The 3 given angles 66,114,152 are supplementary to angles of measures 114,66,28 respectively. These 3 angles are interior to a convex quadrilateral so the remaining angle (which is supplementary to x) is 3601146628=152. From here we find x=180152=28

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 0<abcde where c=17. From the mean, we know a+b+c+d+e=135=65 Subtract c=17 so we have a+b+d+e=48 Next subtract 2 since a,b1 which shows d+e46 And finally since dc=17, we find the largest element is e4617=29 So the largest possible value is 29. The solution set is 1,1,17,17,29.

Nov 30

Consider the circumscribed circle around this regular hexagon. The angle x subtends an arc of 60 since it is 1/6 of the circle. Therefore, x=30, half of the arc measure.