Recent content by diana.hole

well according to my method, if the original string had 29 digits, then the derived string would at most have 12 digits.

Homework Statement The Bunalong Tennis Club is running a mixed doubles tournament for families from the district. Families enter one female and one male into the tournament. When the tournament is arranged, the payers discover the twist; they never partner or play against their own family...

im not quite sure what you mean by "starting a string with 29 digits" and i also have another question to do with derived strings. find all the strings that have 1000110001 as their derived string. my approach to this was since it has 10 digits, that means that every digit represents...

well, so far my explanation is as follows; lets take the largest possible number under 1000, which is 999, for the amount of digits in the original string. the derived string is divided into 10 "segments"(zeros, ones, twos, threes etc.) if all the digits in the original string containing 999...

Homework Statement Consider this string of digits: A=03161011511417191111 It has two 0s, twelve 1s, zero 2s, and so on. We construct another string of digits, called B, as follows: write the number of zeros in A, followed by the number of 1s, followed by the number of 2s, and so on...

Thanks for that, I now know how to explain my answer.

I need to find 2 pythagorean triples which the sum of all sides must be equal to one another. I found 2 pythagorean triples (26, 24, 10) & (25, 20, 15), but I couldn't generate those triples from the pythagorean triples formula I used. I'm quite terrible at explaining things so I apologise

Homework Statement I've encountered a problem in which i need help with to explain my answer: problem: Steve puts matches of equal length end-to-end to create three sides of a triangle. He possesses an unlimited supply of matches and cannot split anyone of the matches in half, thirds etc...