Search found 546 matches

by jaap
Fri Jun 26, 2015 12:13 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 056
Replies: 12
Views: 4582

Re: Problem 056

Do natural numbers include number zero as well? I googled the definition of natural numbers and this is what I found: noun the positive integers (whole numbers) 1, 2, 3, etc., and sometimes zero as well. Do you think including or excluding zero will make a difference to the answer of the problem?
by jaap
Fri Jun 26, 2015 9:51 am
Forum: Number
Topic: Help with Expected Value.
Replies: 1
Views: 8692

Re: Help with Expected Value.

Let's take a simpler example. When using a pair of ordinary six-sided dice, what is the expected number of times you need to roll them to get a double six? Let E be that expected number of rolls. The probability of rolling sixes immediately on the first throw is 1/36. If you don't get sixes, then yo...
by jaap
Sat May 02, 2015 8:51 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 513
Replies: 4
Views: 2914

Problem 513

In Problem 513 (View Problem), the side lengths are not precisely defined. It seems to use the assumption (or convention really) that a=|BC|, b=|CA| and most importantly c=|AB|. I think that should probably be made more explicit in the problem statement somehow.
by jaap
Sat Apr 18, 2015 6:12 pm
Forum: Number
Topic: The Relations of Barlow and Fermat Last Theorem
Replies: 8
Views: 11253

Re: The Relations of Barlow and Fermat Last Theorem

Thats not the problem, because what I am doing is admitting that these roots exists in natural numbers It is a problem. It doesn't matter if these number exist or not, or are assumed for a contradiction or not. One equation does not follow from the next regardless of where those numbers come from. ...
by jaap
Sat Apr 18, 2015 9:08 am
Forum: Number
Topic: The Relations of Barlow and Fermat Last Theorem
Replies: 8
Views: 11253

Re: The Relations of Barlow and Fermat Last Theorem

Ok. The problem is actually the steps just before that. Replacing x0 = (z-y)^(1/n) and y0 = (z-x)^(1/n) [(z-y)^(n-1)]^(1/n)+....+[(z-x)^(n-1)](1/n) "=" 0 mod(p) Replacing y "=" x mod (p) The n-th root is not uniquely defined. x0 and y0 are particular n-th roots of z-y and z-x, but in the above you a...
by jaap
Sat Apr 18, 2015 6:01 am
Forum: Number
Topic: The Relations of Barlow and Fermat Last Theorem
Replies: 8
Views: 11253

Re: The Relations of Barlow and Fermat Last Theorem

FelipeRJ wrote: ny0^(n-1)"=" 0 mod(p)

p = 1 or p divides y0^(n-1) or p=n
That does not follow.
p could merely divide into n.
Or p could be composite, with one factor dividing y0^(n-1) and the other dividing n.
by jaap
Fri Apr 10, 2015 2:55 pm
Forum: News, Suggestions, and FAQ
Topic: New Awards (10 April 2015)
Replies: 9
Views: 4624

Re: New Awards (10 April 2015)

The C for Commitment, CC for Continued Commitment, and D for Dedication are for solving the first 100/200/500 problems. This is what is shown in their mouse-over tooltip text.
Is the Flawless Fifty for solving the first 50 problems, or for any 50 consecutive problems?
by jaap
Thu Mar 19, 2015 4:54 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 293
Replies: 8
Views: 4239

Re: Problem 293

Consider the numbers, 2, 4, 8 and 16. The PFN for each number is 3. So does the sum make 1, because I have only one distinct PFN, or 3, because that one PFN has the value 3? It doesn't say to count the distinct PFNs, but to sum them, i.e. add them together. Therefore from the results for 2,4,8,16 y...
by jaap
Wed Mar 18, 2015 9:01 am
Forum: Recreational
Topic: Showing how many problems you've solved.
Replies: 12
Views: 7520

Re: Showing how many problems you've solved.

The image url is:
http://projecteuler.net/profile/<username>.png
So just put in the right username, and wrap that in [ img ] bbcode tags.

Edit: Like this:
Image
Click quote to see the code.
by jaap
Wed Mar 04, 2015 1:02 pm
Forum: News, Suggestions, and FAQ
Topic: Errors/Warnings/Bugs
Replies: 579
Views: 180217

Re: Errors/Warnings/Bugs

It may be that your browser is using a cached out of date version of the jsmath library. Try pressing Ctrl-F5, as in most browsers this forces a reload of the page and all its associated files. No good. I still see them in Pimspelier's post. I've recently updated to IE 11, though I first noticed th...
by jaap
Wed Mar 04, 2015 8:14 am
Forum: News, Suggestions, and FAQ
Topic: Errors/Warnings/Bugs
Replies: 579
Views: 180217

Re: Errors/Warnings/Bugs

I'm still seeing math processing error all over this forum. For example, the quoted text of the last post reads for me as follows: Let: [Math Processing Error] You are given: [Math Processing Error] Find [Math Processing Error] . It may be that your browser is using a cached out of date version of ...
by jaap
Thu Feb 26, 2015 12:08 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 008
Replies: 102
Views: 34451

Re: Problem 008

AndriiLastivka wrote:Hey. I am confused on what is meant by 'adjacent' in this problem? Does it mean adjacent horizontally, vertically and diagoally?

Thanks
It is one long 1000 digit number, so there is no vertically or diagonally adjacent. It is only split over several lines so that it fits on the screen.
by jaap
Mon Feb 23, 2015 3:00 pm
Forum: Geometry
Topic: Flipping objects in a bounded region
Replies: 1
Views: 9660

Re: Flipping objects in a bounded region

I don't doubt that it can be done, but it will be very difficult. You will have to reduce it to a combinatorial problem. That means that the n degrees of freedom, which are the mirror angles for the n pieces, each have to be restricted to a finite set of values in such a way that a solution is prese...
by jaap
Sun Feb 15, 2015 10:58 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 091
Replies: 31
Views: 11582

Re: Problem 091

jaap wrote:... and their mirror images ...
With that you should get all 19.
by jaap
Sun Feb 15, 2015 10:07 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 091
Replies: 31
Views: 11582

Re: Problem 091

leghorn wrote:[update]

I've arrived at 12:
0-0 / 1-2 / 3-0
0-0 / 2-2 / 3-1
Apart from the two you just added (I assume the first was meant to be 0,0/1,2/3,1) and their mirror images, you are also missing all those with the right angle at the 0,0 corner.
by jaap
Tue Feb 10, 2015 3:17 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 276
Replies: 31
Views: 11816

Re: Problem 276

I'm having a little problem with this and how I've got to make up the description. Let's take -10- for the maximum perimeter. In case I treat gcd(a,b,c) like proposed in the description I get these -26- results: gcd(a,b,c) = gcd(a, gcd(b,c)) 3 = 1 - 1 - 1 4 = 1 - 1 - 2 5 = 1 - 1 - 3 What would a tr...
by jaap
Tue Feb 10, 2015 3:09 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 502
Replies: 17
Views: 8909

Re: Problem 502

Can I ask for clarification as well? Rule 5 says the maximum height is h. Does the castle need to reach that height? For example, given w=4 and h=4, is this a valid castle: ==== ==== i.e. the castle is only two stories high. Rule 5 says The maximum achieved height of the entire castle is exactly h....
by jaap
Sat Feb 07, 2015 11:10 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 502
Replies: 17
Views: 8909

Re: Problem 502

Madiyar wrote:I mean, every pieces of block should be above another pieces of block ?
Rule 1 clearly implies this - every part must have support underneath it.
by jaap
Wed Feb 04, 2015 8:59 am
Forum: News, Suggestions, and FAQ
Topic: Errors/Warnings/Bugs
Replies: 579
Views: 180217

Re: Errors/Warnings/Bugs

BTW, it is very odd. At work asgerix's post rendered fine for me, but now at home its formula does not render at all, even though I am using the same browser (Firefox 35.0.1). The only difference is that at work it's 64-bit, at home 32-bit. To follow up on this: At work today it asgerix's first pos...
by jaap
Tue Feb 03, 2015 7:04 pm
Forum: News, Suggestions, and FAQ
Topic: Errors/Warnings/Bugs
Replies: 579
Views: 180217

Re: Errors/Warnings/Bugs

The formula in asgerix's post is intended to be rendered as a summation with two lines underneath it, one with i=1, and below it a line with i<=n. That example is a little silly, but you do occasionally see sums with things like "p<N" and "p prime", one below the other rather than side by side. BTW,...