Talk:Fractran: Difference between revisions
→Some fractions are equal to others...: new section
(→"natural format"?: Easy to do.) |
(→Some fractions are equal to others...: new section) |
||
| (5 intermediate revisions by 3 users not shown) | |||
Line 8:
:It seems to be a simple thing to do. I took it to mean parsing a format similar to that used in the task description. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 20:46, 23 January 2014 (UTC)
::Saying you can't use % instead of / feels kinda like persecution to me. (After all, there's a slash in the middle of %, and fractions are ratios too.) So in the spirit of liberality I've taken the liberty to remove the 'incomplete' from Haskell. --[[User:TimToady|TimToady]] ([[User talk:TimToady|talk]]) 02:18, 24 January 2014 (UTC)
:::Noted. But I will use this discussion page to voice my objection to this flagrant favouritism shown to the Haskel community in the ''least'' strident way available to me: humour! --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 07:26, 24 January 2014 (UTC)
==Several formulae rendered invisible to many browsers by cosmetic edits==
Cosmetic edits made to the task page at 22:55, 6 August 2016, including the injection of spaces around expressions in <math> tags, have left several of the formulae completely invisible to all browsers which display the graphic file version of formulae rather than processing the MathML (this is, in fact, the majority of browsers). The MediaWiki processor does not currently expect such spaces, and generates syntactically ill-formed HTML if they are introduced. Other aspects of these edits may further compound the problem. [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 17:48, 20 September 2016 (UTC)
: Visibility of task formulae restored on 20 October 2016 [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 01:10, 20 October 2016 (UTC)
== Some fractions are equal to others... ==
In the statement ... ''if N.f is integral'' for a given fraction ''f'' there is a possible ambiguity. Suppose ''f = p/q'' then one can make the test by checking only if ''q'' divides ''N'' rather than performing the full calculation. But, this is equivalent only if ''p'' does not have ''q'' as a factor. Thus, 6/2 would be a hit only if two divides ''N'', whereas 3/1 will always be a hit as will ''N.f''. In other words, will the fractions always have their greatest common divisor divided out? Since input data are always suspect, should one enforce this so that the MOD(N,Q) = 0 approach will succeed? [[User:Dinosaur|Dinosaur]] ([[User talk:Dinosaur|talk]]) 00:09, 24 October 2016 (UTC)
| |||