[QUOTE=Batalov;443761]You didn't?

Maybe you misunderstood the concept of the [URL="https://en.wikipedia.org/wiki/Slippery_slope"]slippery slope[/URL]?
Slippery slope has to do with the logic of the argument. It has nothing to do with "attacking you"[B].
[/B]
In contrast, these are not just one but two personal attacks:

Comments?[/QUOTE]

No, it was preceded by open prejudice against an amateur with a solution to a difficult problem. That is offensive, and a very common form of bigotry, in the field. It's bullshit. Fuck that. I will be speaking about it after I publish. I will not be speaking kindly of him.

If you call something a slippery slope, a common phrase, you are absolutely obligated say something about what you are referring to. Slippery logic as far as I know is being stupid, silly, careless with an argument etc. The wiki link didn't apply to anything I said.
He offered no reason why he would say that. You have crazy ideas, ......what ideas are crazy? .....silence....

Take Charles's word "with a grain of salt". Take it as an insult, but don't worry, Charles is famous for saying this about others, even without reading their papers. That is when I immediately knew that he was an ass. You can't judge someone's math without reading the paper. You can't just base your judgment on some wacky social predicate.

Anyways, it has nothing to do with WSS.

[QUOTE=Gandolf;443758]Just figured I'd re-iterate that it was an open question, with a strong hypothesis, not just a weak conjecture as stated by Charles.[/QUOTE]

By "weak conjecture" I meant only that Wall wasn't expressing a high degree of certainty.

[QUOTE=Gandolf;443763]If you call something a slippery slope, a common phrase, you are absolutely obligated say something about what you are referring to. [/QUOTE]
Except if one is replying to the previous line, which he did.

[QUOTE=Gandolf;443672]...As you can see the antecedent(normally viewed as the consequent) is an infinite expression.
[TEX]p^2|F_{\alpha(p)}[/TEX], if and only if [TEX]F_{F_{F_{F_{F_{F_{F_{F_{p^2}}}}}}}}...|F_{F_{F_{F_{F_{F_{F_{F_{F_{\alpha(p)}}}}}}}}}...[/TEX].
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.
[/QUOTE]
That, above, [B]is[/B] a [URL="https://en.wikipedia.org/wiki/Slippery_slope"]slippery slope argument[/URL]. The argument slips from singular to an infinite expression.

[COLOR=DarkRed]Now listen carefully - one more personal attack will lead to a permanent ban. But for now, a week ban to sit back and think twice before calling someone who was foolishly helping you - the pile of ugly things that you just dumped in the previous message.

:banned:
[/COLOR]

[QUOTE=Gandolf;443763]You can't judge someone's math without reading the paper. You can't just base your judgment on some wacky social predicate.[/QUOTE]

Sure you can -- and must, if you're to make any headway through the vast number of published and unpublished papers today. Here are three links dealing with this sort of mental heuristic, from gentlest to harshest:
[url]https://terrytao.wordpress.com/career-advice/dont-prematurely-obsess-on-a-single-big-problem-or-big-theory/[/url]
[url]http://www.scottaaronson.com/blog/?p=304[/url]
[url]http://primes.utm.edu/notes/crackpot.html[/url]

Not everyone has the courage these three show by posting these guidelines, but everyone -- by virtue of the sheer amount of material out there -- has to have some principles on what they choose to read. Maybe they prefer to read whatever they come across first, maybe they read only what has been recommended to them in person, maybe they read only what is assigned in their classes, but somehow or other they have to decide between reading [url=http://timecube.2enp.com/]this[/url], [url=https://arxiv.org/abs/math/0606088]this[/url], and everything else.

I'm sorry you're so offended by my application of my heuristics, or in explaining such frankly. I imagine many others merely passed the thread by rather than risk comment. Certainly I leave open the possibility that you have some great discovery which I have passed over in error. (There's always a Type I/Type II tradeoff.) I will revisit my decision if and when your paper is accepted for publication in a reputable journal.

As for the heuristics themselves, I would be interested to hear your thoughts on distinguishing papers which are worth your time to read from those which are not. This would belong in a new thread, naturally.

[QUOTE=Gandolf;424680]An abstract example of a Fibonacci-Wieferich prime p, where [TEX]p_{1}=p,\ e_{1}\ge 2[/TEX].
If [TEX]i=F_{(F_{(u_{p^1})})}=(F_{(p_{1}^2)}\ \cdot\ F_{(p_{2}^{e_{2}})}\ \cdot\ ...\ F_{(p_{n}^{e_{n}})}\ \cdot\ \prod{})[/TEX] then, can the entry point of [TEX]i[/TEX] still equal the same index, ie [TEX]u_{(F_{(F_{(u_{p^1})}}))}=F_{(u_{p^1})}[/TEX]?
Answer: No.
Proof: ''This is based upon the observation that the entry point of the product of primitive prime factors, is supposed to be equal to the entry point of the product of non-primitive prime factors, ie Fibonacci numbers with unique factorization for indices, in this case.''

The factor, [TEX]j=(F_{(p_{1}^1)}\ \cdot\ F_{(p_{2}^{e_{2}})}\ \cdot\ ...\ F_{(p_{n}^{e_{n}})}\ \cdot\ \prod{})[/TEX] always has an entry point of, [TEX]u_j=\operatorname{lcm}[p_{1}^1,\ p_{2}^{e_{2}},\ ...\ p_{n}^{e_{n}},\ F_{(u_{p^1})}]=\operatorname{lcm}[p_{1}^1,\ p_{2}^{e_{2}},\ ...\ p_{n}^{e_{n}}]=F_{(u_{p^1})}[/TEX].
While the factor [TEX]i[/TEX] has a later entry point, [TEX]u_i=\operatorname{lcm}[p_{1}^{2},\ p_{2}^{e_{2}},\ ...\ p_{n}^{e_{n}},\ F_{(u_{p^1})}]=\operatorname{lcm}[p_{1}^{2},\ p_{2}^{e_{2}},\ ...\ p_{n}^{e_{n}}]\neq F_{(u_{p^1})}=F_{(p\cdot u_{p^1})}[/TEX]

[/QUOTE]

This looks suspect. By hypothesis, p1^e1 divides F(u(p1)). Hence lcm[p1, p2^e2, ... , F(u(p1))] = p1^e1*p2^e2... = F(u(p1)). But lcm[p1^2, p2^e2, ... , F(u(p1))] will also be p1^e1*p2^e2 ... = F(u(p1)).

[QUOTE=axn;444202]This looks suspect. By hypothesis, p1^e1 divides F(u(p1)). Hence lcm[p1, p2^e2, ... , F(u(p1))] = p1^e1*p2^e2... = F(u(p1)). But lcm[p1^2, p2^e2, ... , F(u(p1))] will also be p1^e1*p2^e2 ... = F(u(p1)).[/QUOTE]

Yes. The paper and subsequent refinements have been reviewed by several journals although unfortunately none of them decided to publish the results based on conflicts of interest, and the controversial nature of the subject matter. The consensus is that both the main idea and stratagem appear to be correct though. The paper now splits the fundamental theorem of arithmetic into 4 groups, in order to prove the final collective result in terms of Fibonacci numbers rather than natural numbers. These kinds of questions may very well not be answerable in terms of natural numbers, directly.

Dr. Carl Pomerance has semi-officially proof-read the paper and he made some very good suggestions that made it into the revised paper. Both Marc Renault and Pomerance appear in the acknowledgment section for their contributions.

This paper remains a working draft.
[url]https://www.dropbox.com/s/bkdkhhmnexyynd6/Wall.pdf?dl=0[/url]