All about
flooble
|
fun stuff
|
Get a free chatterbox
|
Free JavaScript
|
Avatars
perplexus
dot
info
Home
>
Numbers
Quite a triplet (
Posted on 2015-07-02
)
Let
(n,n+1,n+2)
represent a triplet of consecutive numbers, each having
5
distinct prime factors.
Find tne value of the lowest
n
.
No Solution Yet
Submitted by
Ady TZIDON
No Rating
Comments: (
You must be logged in to post comments.
)
Subject
Author
Date
re(4): computer solution -- prolonged search
Charlie
2015-07-04 08:06:14
re(3): computer solution -- prolonged search
broll
2015-07-04 00:06:06
re(2): computer solution -- prolonged search
Charlie
2015-07-03 11:36:27
re: computer solution new sequebce !!
Ady TZIDON
2015-07-03 08:51:49
re(2): more info
Ady TZIDON
2015-07-03 08:21:53
re: more info
Charlie
2015-07-03 07:56:45
more info
Ady TZIDON
2015-07-03 03:35:18
re: computer solution
broll
2015-07-02 22:23:37
Silly Observation?
Kenny M
2015-07-02 18:49:15
computer solution
Charlie
2015-07-02 15:49:37
Please log in:
Login:
Password:
Remember me:
Sign up!
|
Forgot password
Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ
|
About This Site
Site Statistics
New Comments (8)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
blackjack
flooble's webmaster puzzle
Copyright © 2002 - 2024 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information