<span>There are several ways to do this problem. One of them is to realize that there's only 14 possible calendars for any year (a year may start on any of 7 days, and a year may be either a leap year, or a non-leap year. So 7*2 = 14 possible calendars for any year). And since there's only 14 different possibilities, it's quite easy to perform an exhaustive search to prove that any year has between 1 and 3 Friday the 13ths.
Let's first deal with non-leap years. Initially, I'll determine what day of the week the 13th falls for each month for a year that starts on Sunday.
Jan - Friday
Feb - Monday
Mar - Monday
Apr - Thursday
May - Saturday
Jun - Tuesday
Jul - Thursday
Aug - Sunday
Sep - Wednesday
Oct - Friday
Nov - Monday
Dec - Wednesday
Now let's count how many times for each weekday, the 13th falls there.
Sunday - 1
Monday - 3
Tuesday - 1
Wednesday - 2
Thursday - 2
Friday - 2
Saturday - 1
The key thing to notice is that there is that the number of times the 13th falls upon a weekday is always in the range of 1 to 3 days. And if the non-leap year were to start on any other day of the week, the numbers would simply rotate to the next days. The above list is generated for a year where January 1st falls on a Sunday. If instead it were to fall on a Monday, then the value above for Sunday would be the value for Monday. The value above for Monday would be the value for Tuesday, etc.
So we've handled all possible non-leap years. Let's do that again for a leap year starting on a Sunday. We get:
Jan - Friday
Feb - Monday
Mar - Tuesday
Apr - Friday
May - Sunday
Jun - Wednesday
Jul - Friday
Aug - Monday
Sep - Thursday
Oct - Saturday
Nov - Tuesday
Dec - Thursday
And the weekday totals are:
Sunday - 1
Monday - 2
Tuesday - 2
Wednesday - 1
Thursday - 2
Friday - 3
Saturday - 1
And once again, for every weekday, the total is between 1 and 3. And the same argument applies for every leap year.
And since we've covered both leap and non-leap years. Then we've demonstrated that for every possible year, Friday the 13th will happen at least once, and no more than 3 times.</span>
Answer:
Step-by-step explanation:
let me know if this is right please :(
Answer:
the answer is 10
Step-by-step explanation:
(8+4+14+16+8)/5
Answer:
f[g(1)] = 3
General Formulas and Concepts:
<u>Pre-Algebra</u>
Order of Operations: BPEMDAS
- Brackets
- Parenthesis
- Exponents
- Multiplication
- Division
- Addition
- Subtraction
<u>Algebra I</u>
Step-by-step explanation:
<u>Step 1: Define</u>
f(x) = 2x + 1
g(x) = 3x - 2
<u>Step 2: Find g(1)</u>
- Substitute in <em>x</em>: g(1) = 3(1) - 2
- Multiply: g(1) = 3 - 2
- Subtract: g(1) = 1
<u>Step 3: Find f[g(1)]</u>
- Substitute in g(1): f[g(1)] = 2(1) + 1
- Multiply: f[g(1)] = 2 + 1
- Add: f[g(1)] = 3
Answer:b
Step-by-step explanation:
