![]() |
![]() |
#45 |
Feb 2008
2016 Posts |
![]()
Do these functions have an infinite number of values but a specific number of prime values?
Last fiddled with by Housemouse on 2008-08-29 at 12:54 |
![]() |
![]() |
![]() |
#46 |
Nov 2003
1D2416 Posts |
![]() |
![]() |
![]() |
![]() |
#47 |
Jun 2003
The Texas Hill Country
32×112 Posts |
![]()
At this point, I will join Dr. Silverman and suggest that you study the elementary mathematics related to the definitions and properties of the terms that you are attempting to use. With some more of that understanding, you might realize how your question is just ridiculous.
Suggested topics: Domain, range, mapping, function (Bob: Sorry, I didn't realize that you were formulating the same sort of reply) Last fiddled with by Wacky on 2008-08-29 at 13:15 Reason: Dr. Silverman beat me to the reply |
![]() |
![]() |
![]() |
#48 |
Feb 2008
25 Posts |
![]()
Can you please give me an example of one function that has an infinate number of values, but can be proven to have exactly 10 prime values?
|
![]() |
![]() |
![]() |
#49 |
Nov 2003
11101001001002 Posts |
![]() |
![]() |
![]() |
![]() |
#50 |
Undefined
"The unspeakable one"
Jun 2006
My evil lair
10111111001112 Posts |
![]()
Perhaps: f(x)=29-x^2 ?
Last fiddled with by retina on 2008-08-29 at 14:16 |
![]() |
![]() |
![]() |
#51 | |
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
246268 Posts |
![]() Quote:
Let f(x) be the function such that f(x) = x for 1<=x<=29 and f(x) = 4x for all all other values of x. Paul Last fiddled with by xilman on 2008-08-29 at 14:07 Reason: Add spoiler tags |
|
![]() |
![]() |
![]() |
#52 |
Jun 2003
The Texas Hill Country
32·112 Posts |
![]()
Housemouse,
Yes, I can. However I choose to not do so because, as noted previously, it is trivial. If, instead, you will show that you have done the "homework" that I have suggested, and still cannot formulate such a function, I will be happy to continue the discussion. |
![]() |
![]() |
![]() |
#53 |
Nov 2003
164448 Posts |
![]() |
![]() |
![]() |
![]() |
#54 |
Undefined
"The unspeakable one"
Jun 2006
My evil lair
29×211 Posts |
![]() |
![]() |
![]() |
![]() |
#55 |
Nov 2003
11101001001002 Posts |
![]()
Although not explicitly stated, I believe that the domain is N. Now,
f(x) is prime for x = 0, 4 and no other. If you accept the more general definition of prime (i.e. not restricted to just N) then f(x) will be prime i.o. (although a proof is lacking). If we allow x \in R, then f(x) is indeed prime the required number of times. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Is CEMPLLA 1.5 "the only software in the world capable of discovering" something? Not really. | CRGreathouse | Number Theory Discussion Group | 51 | 2018-12-16 21:55 |
Aouessare-El Haddouchi-Essaaidi "test": "if Mp has no factor, it is prime!" | wildrabbitt | Miscellaneous Math | 11 | 2015-03-06 08:17 |
Palindrome primes (a.k.a. Elementary S03E03 "Just a Regular Irregular") | Batalov | And now for something completely different | 12 | 2014-11-16 19:03 |
Prime-Related History: Leibniz' "Universal Language Based on Primes" | ewmayer | Math | 10 | 2007-03-02 12:47 |
Would Minimizing "iterations between results file" may reveal "is not prime" earlier? | nitai1999 | Software | 7 | 2004-08-26 18:12 |