January 21, 200917 yr What is Project Euler? Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve. Although mathematics will help you arrive at elegant and efficient methods, the use of a computer and programming skills will be required to solve most problems. The motivation for starting Project Euler, and its continuation, is to provide a platform for the inquiring mind to delve into unfamiliar areas and learn new concepts in a fun and recreational context. http://www.projecteuler.net/ The math/computer problems there interested me a lot, so I thought any math/computer people here might be too. :D
January 21, 200917 yr Author That would be amusing. Some of the problems are rather difficult, I've only managed to solve about 80 of the 230. :\
January 21, 200917 yr At school we have a Euler applied Mathemtaics and problem sloving "thingo". Thats what its called, 3 divisions, Gauss, Euler and Polya. Quite difficult.
January 21, 200917 yr Author I wish I had something like that at the school to which I used to go, it might have kept me less bored since I wasn't allowed to skip any math classes.
January 22, 200917 yr Can someone better explain it to me? I thought it was just math problems, but then there were big numbers... and the background of the logo is binary...
January 22, 200917 yr Can someone better explain it to me? I thought it was just math problems, but then there were big numbers... and the background of the logo is binary... well, you could just check wikipedia it's a site where many math problems are given, and aimed towards mathematicians and programmers of varying skill levels. sounds great
January 22, 200917 yr I've got a little booklet. Here are some pure maths questions. Find the sum of all integers between 1 and 9999 that are divisible by 5 but not by 6 or 7 Heres another one. A machine for making donuts produces plain donuts. It then puts chocolate coating on top of every 24th donut, fills every 30th with strawberry jam and covers every 45th donut with sprinkles. Since the machine has started working it has produced 25000 donuts. a) How many choclate coated donuts with jam and sprinkles has the machine produced ? B) How many donuts with jam that are either chocolate coated with sprinkles or with sprinkles but without choclate coating, has the machine produced?
January 22, 200917 yr Author Find the sum of all integers between 1 and 9999 that are divisible by 5 but not by 6 or 7 The answer to this question is [hide=Answer Here!]7137125[/hide] A machine for making donuts produces plain donuts. It then puts chocolate coating on top of every 24th donut, fills every 30th with strawberry jam and covers every 45th donut with sprinkles. Since the machine has started working it has produced 25000 donuts. a) How many choclate coated donuts with jam and sprinkles has the machine produced ? This answer is [hide=Answer Here!]69[/hide] B) How many donuts with jam that are either chocolate coated with sprinkles or with sprinkles but without choclate coating, has the machine produced? And this answer is, I think, [hide=Answer Here!]277[/hide]
January 22, 200917 yr Don't know if those are right. Look about right :-k I did this in year 8/9, 5 -6 years ago Should I post somemore ?
January 22, 200917 yr Author If you desire to post more, by all means do so. I'm sure someone will at least attempt to solve them.
January 22, 200917 yr This one I made up. You may not be able to solve it. Explain why all odd prime are in the form (4n + 1) or (4n + 3) Show for all natural numbers b b^2 -=- 0 (mod 4) or b^2 -=- 1 (mod 4) Definition: If a and b are integers and if their difference, a - b is divisible by m, a is said to be congruent to b. Modulo m. This is written a - b -=- (mod 4) Now you know what mod means. Show that n -=- 0 (mod 11) is equivalent to a^0 - a^1 + a^2 - a^3 + a^4 - a^5 +...+(-1)n^ a \/ n -=- (mod 11) No special notation tools here. Sorry. :(
January 22, 200917 yr Author This one I made up. You may not be able to solve it. Explain why all odd prime are in the form (4n + 1) or (4n + 3) The only thing I can think of for that just seems rather trivial. All primes are odd numbers, and odd numbers can only be congruent to 4 mod 3 or 4 mod 1, which makes all primes of the form 4n+1 or 4n+3. That seems too simple to be a "proof" to me, but I can't think of anything else. Show that n -=- 0 (mod 11) is equivalent to a^0 - a^1 + a^2 - a^3 + a^4 - a^5 +...+(-1)n^ a \/ n -=- (mod 11) I don't really understand what that is saying.
January 22, 200917 yr Basically pronumeral (a in this case), raised to n ( any positive integer), this is 1, 2, 3 so on so forth. alternating, minus and plusing. EDIT: Explained liguisticly it would be ( a raised to the power of 0) (minus) ( a raised to the power of 1) (plus) ( a raised to the power of 2), so on so forth.
January 22, 200917 yr i cant seem to find any reasonable problems on there at all! can someone please direct me to somewhere where i can find the easier problems you start with EDIT: nvm, i started with # 1 and looked up some help on the net about how to go about it (I didn't cheat, it says you can in the about page. i looked up HELP not the ANSWER!)
January 22, 200917 yr Author i cant seem to find any reasonable problems on there at all! can someone please direct me to somewhere where i can find the easier problems you start with EDIT: nvm, i started with # 1 and looked up some help on the net about how to go about it (I didn't cheat, it says you can in the about page. i looked up HELP not the ANSWER!) Are you aware that you are supposed to create a short program on your computer to help with the problems? They definitely help A LOT. Some of the first few problems don't really require a program, but almost all of them are calculation-intensive to the point that it would take days or weeks to work out the answer by hand. Basically pronumeral (a in this case), raised to n ( any positive integer), this is 1, 2, 3 so on so forth. alternating, minus and plusing. EDIT: Explained liguisticly it would be ( a raised to the power of 0) (minus) ( a raised to the power of 1) (plus) ( a raised to the power of 2), so on so forth. I guess what I don't understand is where this 'a' comes from?
January 23, 200917 yr No special notation tools here. Sorry. :( Honestly, I don't understand a lot of the language you're using (programming related problems?), but for nice notation: http://www.latex-project.org/ It's a steep learning curve (I was just introduced to it a few days ago), but it is very helpful. Beer
January 23, 200917 yr Author It would surprise me if tif supported latex :\ Whenever I need to symbolically show math, I just use OpenOffice.Org's Math program, it's rather simple and can be turned easily into an image.
January 23, 200917 yr This looks very interesting, and I'd like to give some of them a go. But what kind of programming skills do you need? I have pretty much none, what could I learn that'd get me started with that? "Da mihi castitatem et continentam, sed noli modo"
January 23, 200917 yr This looks very interesting, and I'd like to give some of them a go. But what kind of programming skills do you need? I have pretty much none, what could I learn that'd get me started with that? pretty much any programming language would do i would say. the tips i read were in pearl, but i did mine in ActionScript (the scripting language flash uses) simply because its the only language i know really well. it would be possible though to do them in fairly much anything else, probably even well written batch files.
January 23, 200917 yr I use an IRC program called mIRC that has its own scripting language. I used that for most of them, but some of the questions just crashed mIRC.
January 23, 200917 yr I use an IRC program called mIRC that has its own scripting language. I used that for most of them, but some of the questions just crashed mIRC. lol i had a similar problem, untill i relised it was just a bug in my code that created an almost never ending loop. as soon as i fixed it it executed in about 1 second.
Create an account or sign in to comment