I am implementing scrollable text in a custom control. Each line of text has its own Visual. In the simple case of horizontal scrolling, I replace the Transform of each Visual to produce the desired effect. The scroll bar moves, but the text does not. Am I missing a step that causes the new Transform objects to be reflected (presumably as parameter changes) in the Composition Tree? Ron Martin

Chris, I contacted my ISP and discussed the situation. The technician explained that when messages are blocked, an email is returned to the sender with specific information about why the message has been blocked and what can be done to get it unblocked. In order to anything from this end, I would need the IP address of the server that sends out the newsletters and possibly the email address of the sender. Getting my ISP to check its logs requires substantial evidence. Presumably, you have my email address and therefore know who my ISP is. You should be able to find evidence in your logs if the newletter emails are being rejected. Beyond that, you should be able to send a test message from the server and watch the specific response in isolation. I could use one of my other email addresses (same ISP) or use gmail to see if those options help.

Chris, I've at least read the FAQ specifically associated with newsletter problems. This was working just fine until sometime in the last few weeks. I did receive email notification of your response to my question. Do you have email logs that would indicate any possible email delivery failures? I logged into my webmail portal and found no spam in the spam folder. Thanks for your help. Ron

Over the past few weeks I've stopped receiving all newsletters from The Code Project. I don't know if you've stopped sending them, if my ISP has hijacked them or if my mail reader (Thunderbird) has started to censor my email. My settings haven't changed. Any suggestions? .

I wrote the article off line, but I did all of the editing on line. Since it was my first time creating a significant document in HTML, I spent about 6 hours doing the editing. I'll see if I can recreate the formatting in Visual Studio so that I can resubmit the article. I tried using an off-line editor from the CodeProject site, but it is quite old and wouldn't allow me to open an existing HTML file. Thanks for your quick response. By the way, the partial article was not visible at the time of my original posting, but I can see it now.

I posted my first article today using the article submission wizard. Unfortunately, I got a fatal error when I pressed the "submit" button. I got a cute screen that said, "Something bad happened ... ." There was a reference to "invalid view state". I can't get back to my article. I hope that you haven't lost it. I'd like to see it online and have a chance to make any edits that I missed while composing. I appreciate any help I can get.

Lots of effort has been spent on this problem by many people over a very long time. Look for it on Wikipedia to get an idea of how difficult a problem it is and how much computer time has been devoted to checking the conjecture over a very large range of numbers.

I used a spreadsheet constructed as follows: A1 = 2 A2 = 1 B1 = =IF(B1=1,A1+1,A1) B2 = =IF(B1=1,A2-1,B1-1) Then I dragged B1 and B2 downward to create a list of all the combinations of all the base sizes I wanted to examine. In my case, I chose to stop at line 2016 with column A at 64 and column B at 1. C1 = =A1*(A1+1)*(A1+3)/6 I dragged C1 to D1. E1 = =C1+D1 I dragged C1, D1 and E1 to line 2016. I looked at the line that started with 64 and 63 to determine the maximum sum I could generate from the data I was using. Then I extended the table as follows: A2017 = 1 E2017 = =A2017*(A2017+1)*(A2017+3)/6 I dragged A2017 through E2017 down until the entry in column E was as large as possible but still less than or equal to the largest sum in the upper part of the table. I added column F with 1's in the upper portion of the table and 0's in the lower portion of the table to distinguish the two types of entries. I copied just the values from the table to a new sheet. I sorted the new table using column E as the primary key and column F as the secondary key. I added conditional formatting to column E from row 2 down to change the background color of each cell to red if its value was the same as that of the cell above it. When I realized that my red cells included both cases where there were two sets of two different-sized tetrahedra that contained the same number of cannonballs and the desired cases where the cannonballs from two different-sized tetrahedra can be combined to make a larger tetrahedron, I added another column that contained 1 on the same condition that colored the red cells and 0 when those cells would be while. I then conditionally colored this column from row 2 down so that it was green if the row above contained a zero in column F. I did it this way because I couldn't create a more complex condition with the existing conditional coloring mechanism. The answers that others have posted have already covered the three solutions that I found this way. The question answered by the red cells is interesting in and of itself. It leads to other questions such as: "Are there any numbers of cannonballs that can be stacked into two tetrahedra more than two ways?" and "Are there any cannonball tetrahedra that can be decompsed into two tetrahedra two or more ways?" Questions of this type remind me of Goldbach's Conjecture that every even number greater than 2 can be expressed as the sum of two odd primes. That was the subject of one of the first programs I wrote in 1961. The conjectu

Not only is this answer not the smallest possible value, but if you start with tetrahedra of order 35 and 56, you won't have anywhere near enough cannon balls to build a tetrahedon of order 84.