photo

GeeTwo


Last seen: 2일 전 |  2022년부터 활동

Followers: 0   Following: 0

Proud father, underwater acoustician, FIRST robotics volunteer, once and future FIRST mentor

Programming Languages:
C++, C, Java, Javascript, MATLAB, SQL, HTML, CSS, Arduino, Shell, Assembly, Fortran
Spoken Languages:
English

통계

All
MATLAB Answers

1 질문
5 답변

Cody

1 문제
760 답안

순위
8,419
of 302,293

평판
5

참여
1 질문
5 답변

답변 채택
100.0%

획득한 표
1

순위
 of 21,679

평판
N/A

평균 평점
0.00

참여
0 파일

다운로드 수
0

ALL TIME 다운로드 수
0

순위
111
of 181,020

참여
1 문제
760 답안

점수
11,437

배지 수
64

참여
0 게시물

참여
0 공개 채널

평균 평점

참여
0 하이라이트

평균 좋아요 수

  • Thankful Level 1
  • Knowledgeable Level 1
  • Creator
  • Combinatorics I Master
  • Cody5 Hard Master
  • Speed Demon
  • Sequences And Series III Master
  • Scholar
  • Promoter
  • Sequences And Series II Master
  • Indexing III Master
  • Computational Geometry I Master

배지 보기

Feeds

보기 기준

문제를 풀었습니다


Play PRIMEGAME
Have you ever used the Sieve of Eratosthenes and said, "I wonder whether there’s a less efficient way to find prime numbers."? N...

2일 전

문제를 풀었습니다


Test the generalized Legendre conjecture

2일 전

문제를 풀었습니다


Create a sequence of primes p such that p > n π(p)

2일 전

문제를 풀었습니다


Construct a prime circle
A <https://mathworld.wolfram.com/PrimeCircle.html prime circle> is a circular arrangement of the numbers 1 to 2n such that pairs...

2일 전

문제를 풀었습니다


Test approximations of the prime counting function

2일 전

문제를 풀었습니다


Determine digits of the Copeland-Erdos constant
<https://www.mathworks.com/matlabcentral/cody/problems/1477-champernowne-constant/solutions/new Cody Problem 1477> asks us to de...

2일 전

문제를 풀었습니다


Identify primorial primes
Cody Problems <https://www.mathworks.com/matlabcentral/cody/problems/46054-count-trailing-zeros-in-a-primorial 46054> and <https...

3일 전

문제를 풀었습니다


Find the last non-zero digit in a primorial
<https://www.mathworks.com/matlabcentral/cody/groups/2001/problems/45251 Cody Problem 45251> asked us to find the last non-zero ...

3일 전

문제를 풀었습니다


Count trailing zeros in a primorial
<https://www.mathworks.com/matlabcentral/cody/problems/44068-the-number-of-trailing-zero-digit-of-a-factorial Cody Problem 44068...

3일 전

문제를 풀었습니다


Identify Wagstaff primes
The numbers 3, 43, and 2731 are examples of <https://mathworld.wolfram.com/WagstaffPrime.html Wagstaff primes>. Write a func...

4일 전

문제를 풀었습니다


Identify full reptend primes

4일 전

문제를 풀었습니다


Determine whether a number is a cluster prime
A <https://mathworld.wolfram.com/ClusterPrime.html cluster prime> is an odd prime number _p_ such that all even numbers less tha...

4일 전

문제를 풀었습니다


Investigate the frequency of last digits of prime numbers
The last digit of a prime number greater than 5 can be 1, 3, 7, or 9. If the primes are distributed randomly, then these digits ...

4일 전

문제를 풀었습니다


Compute the nth Naerogahtyp emirp

4일 전

문제를 풀었습니다


Determine whether a prime is Pythagorean

4일 전

문제를 풀었습니다


Determine RSA keys (public and private) given two prime number character strings (p and q)
Given two prime number character strings (p and q), generate the RSA public and private keys (n and d) with e = 65537. The more ...

8개월 전

문제


Precise Almost Pythagorean Triples
This is essentially the same as: Problem 52834. Easy Sequences 32: Almost Pythagorean Triples; it even presents the same set o...

8개월 전 | 3 | 솔버 수: 3

문제를 풀었습니다


Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...

8개월 전

문제를 풀었습니다


Record the Actions ( Medium )
Find the minimum steps to get T units from jugs A and B. Return the sequence of actions as cell array of strings. Available act...

8개월 전

문제를 풀었습니다


The Broken Jug: Constrain ( Hard )
One of your jugs is "broken": it can not be Emptied to the drain. It can only be Filled or Poured to another jug. Input: C, T, ...

8개월 전

문제를 풀었습니다


The Classic 8-5-3 Sharing ( Medium )
You have 3 jugs with capacities [8,5,3]. The 8L jug, the others are empty: [8,0,0]. There is no tap and no drain. You can only p...

8개월 전

문제를 풀었습니다


Total Volume Goal ( Medium )
Usually, the target T must be in one jug. In this version, the target T is the sum of water in all N jugs. Example: C = [3,5], ...

8개월 전

문제를 풀었습니다


The Ultimate Water Challenge ( Expert )
Description: In the previous problems, you were given a target T and asked to find the minimum number of steps to reach it. ...

8개월 전

문제를 풀었습니다


The Generalized N-Jug Water Pouring Problem ( Hard )
Description: You are given N water jugs with maximum capacities specified in a vector C = [ c1, c2, c3,.., c_n]. Initially, all...

8개월 전

문제를 풀었습니다


Two Jugs: Minimum Steps ( Medium )
Following the first problem, now you need to find the shortest path. Given two jugs with capacities A and B, find the minimum nu...

8개월 전

문제를 풀었습니다


Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...

8개월 전

문제를 풀었습니다


Is it Possible? ( Easy )
In the first part of series, we simplify the problem. Given two jugs with capacities A and B, and a target amount T, determine i...

8개월 전

문제를 풀었습니다


Clueless - Lord Ned in the Game Room with the Technical Computing Language
[Warning: this is a nontrivial programming problem] Worried about the decline in reasoning skills in the clueless populace of...

8개월 전

문제를 풀었습니다


Popular Word Game™ Distance
Professor Ned, who holds the Nedowed Chair of Crackpot Mathematics at the University of Nedsburg, has recently discovered the da...

9개월 전

더 보기