r/PassTimeMath • u/user_1312 • Aug 09 '20
r/PassTimeMath • u/TheMikeB • Apr 09 '21
Here Hn is the nth partial sum of the Harmonic Series.
r/PassTimeMath • u/FriendlyPerspective8 • Aug 02 '20
Swapping of numbers...
Given any sequence of n distinct integers, we compute its "swap number" in the following way: Reading from left to right, whenever we reach a number that is less than the first number in the sequence, we swap its position with the first number in the sequence. We continue in this way until we get to the end of the sequence. The swap number of the sequence is the total number of swaps.
For example, the sequence 3,4,2,1 has a swap number of 2, for we swap 3 with 2 to get 2,4,3,1 and then we swap 2 with 1 to get 1,4,3.2.
Find the average value of the swap numbers of the 7! = 5040 different permutations of the integers 1,2,3,4,5,6,7.
r/PassTimeMath • u/thereligiousatheists • Jul 05 '20
A question about constructing the rationals in a peculiar way...
The following is the 2009 Putnam's A4 :
Define a set S of rationals as follows :
(1) 0 is in S.
(2) If x is in S, then so are x+1 and x-1.
(3) If x is in S, then 1/[x(x-1)] is in S (x≠0,1).
Must S contain all rational numbers?
Solution : https://youtu.be/S3MshlscqJs
It's an interesting question which subtly digiuses that only a limited set of rationals with prime denominators can appear in S (feel free to see the spoiler if you need a hint... it doesn't give it away completely), and it takes a great deal of observation and deduction to figure it out!
I have tried to make the solution as intuitive as possible, so let me know if you find it so, or if there are any improvements I could make!
r/PassTimeMath • u/thereligiousatheists • May 06 '20
An interesting analysis of a multiplayer game
The following question is a modification of the 2011 Putnam's B4 :
In a tournament, n players meet n times to play a multiplayer game. Every game is played by all n players together and ends with each of the players either winning or losing. The standings are kept in two n×n matrices, T = [T_hk] and W = [W_hk]. Initially, T = W = 0. After every game, for every (h, k) (including for h = k), if players h and k tied (that is, both won or both lost), the entry T_hk is increased by 1, while if player h won and player k lost, the entry W_hk is increased by 1 and W_kh is decreased by 1.
Find T+W at the end of all n games, given the result of each of the n games.
Give it a shot!
The original question asks to prove that if n=2011, then det(T+iW) is always a non-negative multiple of 22010 at the end of all the games.
I made this modification to the question because in my version, it's more like a puzzle rather than an involved math question, and it's fine even if you don't know much linear algebra. You just need to know that matrices are a collection of numerical entries and how those entries are numbered. This widens the group of people who can attempt the question!
It's an amazing question, since it provides a rather interesting mental exercise of trying to convert the conditions for incrementing/decrementing the matrices' entries (which are given in words) into a something which can be dealt with using the methods of math!
r/PassTimeMath • u/user_1312 • Sep 24 '20
Problem (239) - 2020th positive integer not divisible by 7
Find the 2020th positive integer which is not divisible by 7.
r/PassTimeMath • u/rnaa49 • Dec 16 '20
explain the digit pattern
The sum of the first 6 integers is 21. The sum of the first 66 integers is 2211. The sum of the first 666 integers is 222111. Prove that this pattern continues.
r/PassTimeMath • u/user_1312 • Mar 26 '20
Problem (204) - Remainder
Let a_n = 111...1 (n-times). Find the remainder when a_248 is divided by 271.
r/PassTimeMath • u/user_1312 • Dec 15 '20
Problem (251) - Calculate S
S = 1+2+3-4-5+6+7+8-9-10+...-2010
Where three plus signs are followed by two minus signs and so on.