... something that arrived in an email ( 1 cent)

DesignCAD 2019 and DesignCAD 3D Max 2019 now available for sale!

https://www.turbocad.com/designcad/ OR

https://www.imsidesign.com/products/designcad

https://www.turbocad.com/designcad/ OR

https://www.imsidesign.com/products/designcad

... something that arrived in an email ( 1 cent)

« *Last Edit: June 02, 2015, 05:13:28 AM by samdavo* »

Logged

Great for young people, fails after you reach 101, so as someone was saying recently on the forum here, many designcad users may not get it!!!

Logged

User since Pro-design

Lol - good one, Call it the Y1C problem (rather than the Y2K).

Gotta feeling that those two numbers multiply to 10101.

Presumably there are some factors that multiply to 1001001 - for those forum members to which you refer

PS On checking I find that the only factors of 1001001 are 3 and 333667 , both of which appear to be prime numbers.

https://www.mathsisfun.com/numbers/prime-number-lists.htm

i.e. the senior members to whom you refer should multiply out the following :-

3 x (your age) x 333667 (2 cents)

Gotta feeling that those two numbers multiply to 10101.

Presumably there are some factors that multiply to 1001001 - for those forum members to which you refer

PS On checking I find that the only factors of 1001001 are 3 and 333667 , both of which appear to be prime numbers.

https://www.mathsisfun.com/numbers/prime-number-lists.htm

i.e. the senior members to whom you refer should multiply out the following :-

3 x (your age) x 333667 (2 cents)

« *Last Edit: June 02, 2015, 03:59:22 PM by samdavo* »

Logged

http://www.maths.cam.ac.uk/friends/newsletters/May2007.pdf

Then there's something really simple - like proving Goldbach's Conjecture

Then there's something really simple - like proving Goldbach's Conjecture

Quote

As soon as one tries to combine the primes and the other

fundamental operation of arithmetic, namely addition, one

swiftly comes up with questions that have proved

impossible to answer.

Most famous amongst these is Goldbach’s Conjecture,

which hypothesises that every even number is the sum of

two primes. Given a smallish even number it is easy to

check that it is the sum of two primes, for example 104 = 31

+ 73. To a mathematician, of course, checking that every

even number less than 100,000,000 is a sum of two primes

is not good enough, and we demand a proof that

Goldbach’s Conjecture holds for all numbers.

Such a proof

is currently lacking and most experts do not expect

definitive progress on the problem in the near future.

There is a weaker version of Goldbach’s Conjecture,

which has been proven. Namely, it is known that every

sufficiently large odd number is the sum of three prime

numbers. Cambridge mathematicians G. H. Hardy and J. E.

Littlewood were the first to plot a path to a proof of this

result. It is known that “sufficiently large” in this context

can be taken to mean greater than 10^43001.

This is a number

so large that it is of mathematical, rather than merely

computational, interest to show that every odd number is

the sum of three primes.

Logged