flat assembler
Message board for the users of flat assembler.

 Index > Heap > is there a simple mathematical problem but hard to solve? Goto page 1, 2  Next
Author
sleepsleep

Joined: 05 Oct 2006
Posts: 8885
Location: ˛　　　　　　　　　　　　　　　　　　　　　　　　　　　　　⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣Posts: 334455
sleepsleep
i think i need one of such problem and spend the whole life cracking it, please recommend me one,

a simple but unsolved by human.
28 Jun 2015, 16:32
revolution
When all else fails, read the source

Joined: 24 Aug 2004
Posts: 17270
revolution
Find the factors of RSA-2048.
28 Jun 2015, 16:36
MHajduk

Joined: 30 Mar 2006
Posts: 6034
Location: Poland
MHajduk
sleepsleep wrote:
i think i need one of such problem and spend the whole life cracking it, please recommend me one,

a simple but unsolved by human.
There are plenty of such problems (simple at first glance but horribly difficult in fact) in Number Theory.

One of them was for example Fermat's Last Theorem finally "cracked" by Andrew Wiles in 1994.
28 Jun 2015, 16:37
revolution
When all else fails, read the source

Joined: 24 Aug 2004
Posts: 17270
revolution
Beal's conjecture.
28 Jun 2015, 16:39
MHajduk

Joined: 30 Mar 2006
Posts: 6034
Location: Poland
MHajduk
Twin prime conjecture.
28 Jun 2015, 16:42
revolution
When all else fails, read the source

Joined: 24 Aug 2004
Posts: 17270
revolution
OPN
28 Jun 2015, 16:44
MHajduk

Joined: 30 Mar 2006
Posts: 6034
Location: Poland
MHajduk
Riemann hypothesis.
28 Jun 2015, 16:48
revolution
When all else fails, read the source

Joined: 24 Aug 2004
Posts: 17270
revolution
P = NP?
28 Jun 2015, 16:51
sleepsleep

Joined: 05 Oct 2006
Posts: 8885
Location: ˛　　　　　　　　　　　　　　　　　　　　　　　　　　　　　⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣Posts: 334455
sleepsleep
are you guys spending life to crack some of these?
28 Jun 2015, 16:54
revolution
When all else fails, read the source

Joined: 24 Aug 2004
Posts: 17270
revolution
Who says we are all guys?
28 Jun 2015, 16:55
MHajduk

Joined: 30 Mar 2006
Posts: 6034
Location: Poland
MHajduk
I remember how one of my professors said that everyone can (easily) construct an integral problem that would be utterly hard to solve even for skilled mathematicians. So, it's easy to formulate a problem and quite difficult to solve it. The most difficult questions have been asked by people that are loosely related to maths.
28 Jun 2015, 16:55
revolution
When all else fails, read the source

Joined: 24 Aug 2004
Posts: 17270
revolution
I am quite prepared to spend your life to crack these!
28 Jun 2015, 16:55
sleepsleep

Joined: 05 Oct 2006
Posts: 8885
Location: ˛　　　　　　　　　　　　　　　　　　　　　　　　　　　　　⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣Posts: 334455
sleepsleep
revolution wrote:
Who says we are all guys?

yah, just reminded,
it is still one of the fasm board unsolved question.
28 Jun 2015, 16:58
MHajduk

Joined: 30 Mar 2006
Posts: 6034
Location: Poland
MHajduk
revolution wrote:
I am quite prepared to spend your life to crack these!
The most interesting is that physics can give us a quite new approach in solving math problems. For example, Grigori Perelman, most probably one of the most talented mathematicians of our time (if not the best one), used some analogue of the heat equation to prove Poincare conjecture.
28 Jun 2015, 17:03
revolution
When all else fails, read the source

Joined: 24 Aug 2004
Posts: 17270
revolution
MHajduk wrote:
The most difficult questions have been asked by people that are loosely related to maths.
Sometimes we need to eyes of a child to tell us the plain and simple truths.
28 Jun 2015, 17:04
sleepsleep

Joined: 05 Oct 2006
Posts: 8885
Location: ˛　　　　　　　　　　　　　　　　　　　　　　　　　　　　　⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣Posts: 334455
sleepsleep
i pick one problem and try understand it,
i think i like the factoring,

does this mean answer to what resulted the RSA numbers are kept somewhere on earth?
28 Jun 2015, 17:09
MHajduk

Joined: 30 Mar 2006
Posts: 6034
Location: Poland
MHajduk
revolution wrote:
MHajduk wrote:
The most difficult questions have been asked by people that are loosely related to maths.
Sometimes we need to eyes of a child to tell us the plain and simple truths.
Yes, and sometimes it's intriguing to see how people from a different cultural circle can solve a given problem.

I don't want to be misunderstood here but something must be in the fact that for example Polish mathematicians preferred algebraic and topological problems whereas Russian ones were specialized in analysis. An absolutely unique approach is represented by Indian scientists where we can observe a great imagination and huge role of intuition whereas the classical German math school was rather based on pedantry and meticulousness.
28 Jun 2015, 17:13
MHajduk

Joined: 30 Mar 2006
Posts: 6034
Location: Poland
MHajduk
sleepsleep wrote:
does this mean answer to what resulted the RSA numbers are kept somewhere on earth?
This kind of cryptographic problems has been meant to be (extremely) hard to solve because it guarantees safety of cryptographic protocols used in data transmission.

However, from the other hand, it would have been strange if USA had promoted things for which they have not got an "antidote". So, it's not impossible (but rather unlikely) that someone has found a way to crack RSA already but keeps silent.
28 Jun 2015, 17:47
revolution
When all else fails, read the source

Joined: 24 Aug 2004
Posts: 17270
revolution
sleepsleep wrote:
does this mean answer to what resulted the RSA numbers are kept somewhere on earth?
Not according to the history as was recorded. But perhaps you can find the answer. I suggest you read up about how those numbers were generated if you are interested.
29 Jun 2015, 04:42
YONG

Joined: 16 Mar 2005
Posts: 8000
Location: 22° 15' N | 114° 10' E
YONG
sleepsleep wrote:
i think i need one of such problem and spend the whole life cracking it, please recommend me one, a simple but unsolved by human.
You should try to crack the Collatz conjecture.

The conjecture is very simple:
- Take any positive integer n.
- If n is even, divide it by 2. Otherwise, multiply it by 3 and add 1 to the result.
- Repeat this process indefinitely.
- You will ALWAYS reach 1, regardless of the initial value of n.

Now, prove or disprove this conjecture.

29 Jun 2015, 05:55
 Display posts from previous: All Posts1 Day7 Days2 Weeks1 Month3 Months6 Months1 Year Oldest FirstNewest First

 Jump to: Select a forum Official----------------AssemblyPeripheria General----------------MainDOSWindowsLinuxUnixMenuetOS Specific----------------MacroinstructionsCompiler InternalsIDE DevelopmentOS ConstructionNon-x86 architecturesHigh Level LanguagesProgramming Language DesignProjects and IdeasExamples and Tutorials Other----------------FeedbackHeapTest Area
Goto page 1, 2  Next

Forum Rules:
 You cannot post new topics in this forumYou cannot reply to topics in this forumYou cannot edit your posts in this forumYou cannot delete your posts in this forumYou cannot vote in polls in this forumYou can attach files in this forumYou can download files in this forum