The following are the first forty terms of a sequence: 0, 2, 4, 6, 8, 10, 11, 12, 14, 16, 18, 22, 33, 44, 55, 66, 77, 88, 99, 101, 110, 121, 132, 141, 143, 154, 161, 165, 176, 181, 187, 198, 201, 202, 221, 222, 241, 242, 261, 262, 281, . . . Same idea as the other sequences. Describe the pattern of the sequence. If you use a search engine, please don't submit it in the comments. If it hasn't been solved by Thursday, I'll give a hint. Also, if you ask a polar question (i.e., a yes/no question), I will probably answer it if it relates to this sequence. I'll post the solution on next week's sequence. Update: Hint: This is a list, so the sequence is not dependent on the index. Now, for positive integer i there exist nonnegative integers ci and di (ci greater than or equal to di) such that a(i)=ci+di. Obviously, there are ½a(i)+1 choices for the pair (ci, di) if a(i) is even, and ½(a(i)+1) choices for the pair (ci, di) if a(i) is odd, but to be more specific, for a certain pair dependent on a(i) (and for full disclosure, even this pair might not be unique), there is an almost one-to-one relationship between ci and di, that is to say, if you choose the correct ci you get di, and most of the time if you have the correct di Update: I've added twenty more terms to the sequence. This is not to denote difficulty. Something worth noting happens at a(33) so I decided to list to the nearest multiple of ten that was greater than 33. (A similar thing happened at a(11).) Last week's sequence (5, 13, 17, 25, 29, 37, 41, 53, 61, 65, . . .) was the set of hypotenuses of primitive Pythagorean Triples. Suppose you have integers a, b and c. They form a primitive Pythagorean Triple if 1. a2+b2=c2, and 2. a and b are coprime (i.e., they share no prime factors, i.e., their greatest common denominator is 1). For the triple a, b and c that satisfies the previous equation, we say that c is the hypotenuse because it is the longest side, and it is opposite the right angle. E.g., 5 is in the sequence because 52=32+42, and 3 and 4 share no prime factors. E.g., 372=122+352, and 12 and 35 share no prime factors. Alternatively, last week's sequence is the list of terms from the sequence two weeks ago (0, 1, 2, 4, 5, 8, 9, 10, 13, 16, . . .) with some excluded. Suppose we have a term from two weeks ago, say a(i) for some i=1, 2, 3, . . ., where a(i)= c2+d2 for some integers c and d. Then a(i) is excluded from last week's sequence if and only if c and d share a prime factor or c and d are both odd or one of c and d is 0. I mentioned in the hint last week that Euclid's formula generates these terms. Suppose you have odd integer c and even integer d who share no prime factor. These generate the primitive Pythagorean Triple 2cd, |c2-d2| and c2+d2. E.g., 0=02+02, c=d=0. But 0 and 0 share an infinite number of prime factors, so 0 was not in last week's sequence. Practically speaking, the exclusion statements in the previous paragraph exclude three categories of terms in the sequence from two weeks ago (this is not an exhaustive list): So, e.g., exclude 0, 1, 4, 9, 16, 25, 36, 49, 64, 81, the rest of the squares, as they fit in the first category. E.g, exclude 8, 18, 32, 50, the rest of the double squares, as they fit in the second category. E.g., exclude 10, 20, 26, 34 the rest of the non-primitive Pythagorean Triples, as they fit in the third category. Real examples: E.g., 2=12+12. Obviously 1 and 1 are both odd, so 2 is excluded. E.g., 5=12+22. Considering 1 and 2, they share no prime factors, 2 is even so they're not both odd, and neither number is 0, so there's no reason to exclude 5. Thus, 5 is the first candidate to go into last week's sequence. E.g., 13=22+32. Considering 2 and 3, they share no prime factors, 2 is even so they're not both odd, and neither number is 0, so there's no reason to exclude 13. It is the second candidate to go into last week's sequence. It was not solved.
you get ci. An instance where knowing di will not give you ci is for a(19); if you have ci you get di
but if you have di
there are an infinite number of choices for ci. To give some substance to this hint, think mirror for the relationship between the two elements of the pair. (This is a very strong hint, provided you don't over extend the properties of a mirror relationship.)
Monday, July 6, 2009
Subscribe to:
Post Comments (Atom)
0 comments:
Post a Comment