![]() |
|
|
#23 | |
|
Jan 2016
2·3·5 Posts |
Quote:
A better understanding of the form, should allow us to sieve out candidates. Great, but that's assuming they exist in some form, other than hypothetical. Assume one or more exists. Assume we find one. Now, how does that form co-exist with Fermat's last theorem? A counter-example comes in the form of a WSS. It becomes very difficult to say there exists a WSS prime, yet it somehow doesn't violate Wiles's proof. Just because their paper didn't explicitly say that it was a "bi-conditional logical connective", doesn't mean that it isn't. Actually, one does not need to look at Fermat's last, to see the implications. For example, since in the case of a WSS, The form looks similar to our problem, We have removed the nasty restriction of the problem, ie the "entry point" of prime powers cannot be solved with the lcm property, that is the heart of the problem. We have added terms that are pleasant and accountable, for which the lcm does solve the problem without much difficulty. The only thing missing, that the community needs to connect this, is a bi-conditional dependency such that Otherwise, a skeptic would say that Proving all this, is easier than it sounds. The fundamental form of Fibonacci numbers, "literally" proves the solution. For those of you who doubt that a solution exists to this problem, based purely on a social predicate, or social credibility, need to reconsider your methodology. The math speaks for itself, don't use social biases as an excuse to ignore mathematical arguments. |
|
|
|
|
|
|
#24 | |||
|
Aug 2006
3·1,993 Posts |
Quote:
Quote:
Quote:
To put it another way: long before the above was known it was proved (essentially by Fermat) that a counterexample to Fermat's last theorem must have a prime exponent.* But the truth of Fermat's last theorem does not mean that there are no primes! * It's easy to prove that a least counterexample must have an exponent which is prime or 4. Fermat proved that it can't be 4. |
|||
|
|
|
|
|
#25 | ||
|
Jan 2016
2·3·5 Posts |
Quote:
We can sieve all the candidates out we want, but that doesn't ensure a solution. Then, searching for something that doesn't exist is pointless when provable otherwise. In the best case, the new knowledge would be applied, and they would also have to exist to find. Worse case, they don't exist, and the whole thing is a bust. I think that is clear enough. We just differ in opinion about the existence. Quote:
The point is, that we should not use this lack of an explicit statement, to mean a strong statement in the opposite respect, or towards it for that matter. You'd have to read their paper several times to understand the implication, and also their follow up papers through the years. As I said, we need not look at the implications of Fermat's to see the contradiction. However, one needs to look before they can see though. If one has the equivalent of "mathematical blinders", one will never see the bigger picture "zoomed out". Prime powers are difficult, if not impossible to solve while zoomed in. Charles, are you actually open(without blinders) to discussing the subject? I mean mathematically, argument for argument, lemma by lemma, slowly so that it can be digested. The submission to the Journal, is now in the 25th week of review, so apparently the editor in chief and the reviewers are hooked onto something. Not to mention the initial proof-reading was done by M. Renault, and subsequently the editor in chief of this particular Journal. A new discovery(uncovered) allows one to effectively sieve out "all" possible candidates by form. The solution needed to come from a human, because otherwise the code executing will effectively have "blinders" on. It will be looking for a solution that doesn't exist close up, ie natural integers m||n. |
||
|
|
|
|
|
#26 | ||
|
Aug 2006
175B16 Posts |
Quote:
Quote:
![]() I don't have time for that at present. |
||
|
|
|
|
|
#27 |
|
Jan 2016
1E16 Posts |
Actually yeah you did. Your reply was a counter to my statement, which was not wrong to begin with. The bi-conditional nature is not stated in the paper, but upon investigation it is true. That's what I said/meant originally. I wasn't asserting that their paper stated it. It is implied however when you look close enough. Your reply went on, like you were correcting a newbie, that had made a classic overstatement about FLT and WSS. Just to be clear.
Since this is a forum, for which you frequent all the time, with many more posts, that are far more in depth than a couple of lemmas, its hard to believe you. It's more likely that you have applied a social predicate against what you perceive as my credibility, and you don't want to waste your time and effort on something that isn't true. That's fine, good luck in all your prime searching endeavors, as long as they may take. |
|
|
|
|
|
#28 | ||
|
Aug 2006
597910 Posts |
Quote:
Quote:
It's true that I have standards for determining credibility of claims before investing time in checking them. (You might see links in some of my posts top them, using lists from Tao, Aaronson, Carroll, and Caldwell.) In this case I haven't even gotten around to applying them because I'm not sure what you're trying to prove or how. It seems there's some material earlier in the thread but I haven't the time to review it at present. |
||
|
|
|
|
|
#29 | |
|
Jan 2016
2·3·5 Posts |
Quote:
Because AI is hard enough to build, trust me on this, not to mention a self sustaining AI, that would change and grow perfectly over time. These are two different demons. People that are smart enough to build such things, should be smart enough to build in backdoors, and trapdoors, even if that is only for the debug environment. |
|
|
|
|
|
|
#30 | |
|
Jan 2016
2·3·5 Posts |
Quote:
The paper is a publish in progress, so not going to post a full copy online. However there is a wikipedia talk page with the full notation of the second revision. The proof was written at wiki mostly, and Marc Renault proof read the initial methods, and commented for the public record. He was a skeptic too, at first. He supports the initial methods, and how the methods are applied to the problem. Take a peek. https://en.wikipedia.org/wiki/User_talk:Primedivine |
|
|
|
|
|
|
#31 | |
|
Aug 2006
135338 Posts |
Quote:
|
|
|
|
|
|
|
#32 | |
|
Aug 2006
3·1,993 Posts |
Quote:
|
|
|
|
|
|
|
#33 |
|
Jan 2016
2×3×5 Posts |
Here is a video abstract illustrating the flow of logic.
Green arrows are what we know. Blue arrows are what is hypothesized, and conjectured. Circled in orange, and red are the mathematical overstatements of the Wall Sun Sun conjecture. https://www.youtube.com/watch?v=__X-VQzAfmY I would consider this a sort of error by the Sun brothers, since they didn't bother to check and see what happens recursively in their formula, ie Any Fibonacci divisible by a WSS prime, would also trivially be the index of some other larger Fibonacci number. This means that an infinite number of Fibonacci's would have equal entry points, which is impossible by definition. A requirement from above: As you can see the antecedent(normally viewed as the consequent) is an infinite expression. The left side is unsolvable, but the right side is easy as pi. In this case we use the latter as the antecedent, since for this question it gives us the desired answer. |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| The Joys of Cracked.com: 5 Ways We Ruined the Occupy Wall Street Generation | Dubslow | Soap Box | 17 | 2012-05-14 08:51 |
| Wall Street Pundits are such Weenies | ewmayer | Soap Box | 25 | 2009-06-17 23:07 |
| Head, meet wall | fivemack | Factoring | 13 | 2007-04-13 23:26 |
| possible primes (real primes & poss.prime products) | troels munkner | Miscellaneous Math | 4 | 2006-06-02 08:35 |
| The Ladder Against The Wall | Numbers | Puzzles | 27 | 2005-07-02 10:19 |